Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2101.00700

Non-separable matrix builders for signal processing, quantum information and MIMO applications

Ted Hurley·Barry Hurley
View original source ↗Read source document ↗Export metadata ↓

Abstract

Matrices are built and designed by applying procedures from lower order matrices. Matrix tensor products, direct sums or multiplication of matrices are such procedures and a matrix built from these is said to be a {\em separable} matrix. A {\em non-separable} matrix is a matrix which is not separable and is often referred to as {\em an entangled matrix}. The matrices built may retain properties of the lower order matrices or may also acquire new desired properties not inherent in the constituents. Here design methods for non-separable matrices of required types are derived. These can retain properties of lower order matrices or have new desirable properties. Infinite series of required non-separable matrices are constructible by the general methods. Non-separable matrices are required for applications and other uses; they can capture the structure in a unique way and thus perform much better than separable matrices. General new methods are developed with which to construct {\em multidimensional entangled paraunitary matrices}; these have applications for wavelet and filter bank design. The constructions are in addition used to design new systems of non-separable unitary matrices; these have applications in quantum information theory. Some consequences include the design of full diversity constellations of unitary matrices, which are used in MIMO systems, and methods to design infinite series of special types of Hadamard matrices.

Explore related subjects

math.RAcs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ted Hurley, Barry Hurley. 2023-08-15. Non-separable matrix builders for signal processing, quantum information and MIMO applications. https://arxiv.org/abs/2101.00700

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Maximal tails,character fibres and induced modules for pullback Kumjian-Pask algebras

Let $f:\N^{k}\to\N^{\ell}$ be a surjective monoid homomorphism and let $Γ$ be a row-finite $\ell$-graph with no sources and finitely many vertices. We give an explicit graded isomorphism from the Kumjian--Pask algebra of the pullback $f^{*}Γ$ onto the tensor product of $\KP_{\K}(Γ)$ and the group algebra of the kernel of the group completion of $f$. When $Γ$ is strongly aperiodic, but need not be cofinal, every maximal tail $T$ and every maximal ideal $\mathfrak m$ of the kernel group algebra determine an explicit primitive ideal and primitive quotient. If, in addition, $\K$ is uncountable and algebraically closed, these ideals exhaust the primitive spectrum. We prove that the resulting parametrisation is a homeomorphism for the product of the maximal-tail and Zariski topologies. Each primitive ideal is realised as the annihilator of a simple module induced from the isotropy of a path which is cofinal in $T$, and the character fibres are algebraic tori. Two examples exhibit, respectively, a single character fibre and the non-Hausdorff gluing of two such fibres.

math.RA↗
arXiv2026

A classification of group gradings on incidence algebras over commutative rings

Let $R$ be a commutative ring with 1, $P$ a locally finite partially ordered set, and $G$ a group. We derive necessary and sufficient conditions for an $R$-algebra isomorphism between the incidence algebra $I(P,R)$ and the group algebra $RG$. Then, for an indecomposable ring $R$, a finite poset $P$ and an arbitrary group $G$, we classify the $G$-gradings of $I(P,R)$ up to graded isomorphism. The classification rests on a complete set of primitive orthogonal homogeneous idempotents. The corner algebras are split group algebras of finite abelian subgroups of $G$, and the off-diagonal Peirce blocks are multiplicity-free sums of bimodules induced from characters of double coset stabilizers. Graded isomorphisms are shown to have a rigid form, and a grading is determined up to graded isomorphism by the poset of idempotents, the corner groups, the types of the atomic bimodules and the structure constants of their multiplication. The data which occur are characterized by polynomial conditions, and over an algebraically closed field of characteristic zero only finitely many graded isomorphism classes share given partial invariants. An example shows that the structure constants cannot be omitted. Some previous results are extended and enhanced, while providing alternative proofs for some known facts.

math.RA↗