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

Document Type : 2022 CCGTA IN SOUTH FLA


1 University of Galway (Formerly National University of Ireland Galway), Ireland

2 Friar's Hill, Galway, Ireland


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  separable matrix. A non-separable matrix is a matrix which is not separable and is often referred to as 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 type non-separable matrices are constructible by the general methods.
Non-separable matrices of required types 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 multidimensional entangled paraunitary matrices; these have applications for wavelet and filter bank design. The constructions are 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.


Main Subjects

[1] C. Polcino Milies and S. K. Sehgal, An introduction to Group Rings, Algebra and Applications, 1, Kluwer Academic Publishers, Dordrecht, 2002.
[2] G. Strang and T. Nguyen, Wavelets and Filter Banks, Wellesley-Cambridge Press, Wellesley, MA, 1996.
[3] C. J. Colbourn and J. H. Dinitz (Eds.), Handbook of combinatorial designs, Discrete Mathematics and its applications, Chapman and Hall, London/New York, 2007.
[4] H. V. Henderson, F. Pukelsheim and S. R. Searle, On the history of the kronecker product, Linear and Multilinear Algebra, 14 (1983) 113–120.
[5] P. Powell, Calculating determinants of block matrices, 11 pp.
[6] B. M. Hochwald and W. Sweldens, Differential unitary space-time modulation, IEEE Trans. Comm., 48 (2000) 2041–2052.
[7] T. Hurley and B. Hurley, Paraunitary matrices and group rings, Int. J. Group Theory, 3 (2014) no. 1 31–56.
[8] T. Hurley, Full diversity sets of unitary matrices from orthogonal sets of idempotents,
[9] R. Hosoya and H. Suzuki, Type II matrices and their Bose-Mesner algebras, J. Algebraic Combin., 17 (2003) 19–37.
[10] P. Diţă, Some results on the parametrization of complex Hadamard matrices, J. Phys. A, 37 (2004) 5355–5374.
[11] J. Zhou, Minh N. Do and J. Kovaĉević, Special paraunitary matrices, Cayley transform, and multidimen-sional orthogonal filter banks, IEEE Trans. Image Process., 15 (2006) 511–519.
[12] A. Shokrollahi, B. Hassibi, B. M. Hochwald and W. Sweldens, Representation theory for high-rate multiple-antenna code design, IEEE Trans. Inform. Theory, 47 (2001) 2335–2367.
[13] T. Hurley, Unique builders for classes of matrices, Spec. Matrices, 9 (2021) 52–65.
[14] M. A. Nielsen and I. Chuang, Quantum computation and quantum information, Cambridge University Press, Cambridge, 2000.
[15] B. A. Sethuraman, Division algebras and wireless communication, Notices Amer. Math. Soc., 57 (2010) 1432–1439.
[16] P. P. Vaidyanathan, Multirate systems and filterbanks, Prentice-Hall, 1993.
Volume 13, Issue 3 - Serial Number 3
September 2024
Pages 271-291
  • Receive Date: 13 January 2023
  • Revise Date: 22 August 2023
  • Accept Date: 23 August 2023
  • Published Online: 01 September 2024