Construction of Some Block Structured (Complex) Hadamard Matrices

S. N. Topno¹ , M. K. Singh²

Section:Research Paper, Product Type: Isroset-Journal
Vol.6 , Issue.2 , pp.124-130, Apr-2019

CrossRef-DOI:   https://doi.org/10.26438/ijsrmss/v6i2.124130

Online published on Apr 30, 2019

Copyright © S. N. Topno, M. K. Singh . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

343 Views    172 Downloads    87 Downloads

Abstract :
This article investigates some methods to construct Hadamard matrices, made up of other Hadamard blocks of lower orders. Some methods are presented to construct families of real and complex block structuted Hadamard matrices using real and complex orthogonal designs together with some suitable matrices. Other new arrays are also introduced to construct block structured (complex) Hadamard matrices, along with a few methods for their constructions. Block structured (complex) Hadamard matrices have further resulted in (block structured) weighing matrices. Also infinite families of orthogonal design of order 4t and type (2t, 2t) are also constructed which depend upon the existence of Williamson matrices and Turyn-type Williamson matrices.

Key-Words / Index Term :
Hadamard matrix, weighing matrix, orthogonal design, plug-in arrays, Kronecker product

References :
[1] S. S. Agaian, “Hadamard matrices and their Applications”, Springer- Verlag, Berlin Heidelberg, New York, Tokyo, pp.78-102, 1985.
[2] R. Craigen, W. Holzmann and H. Kharaghani, “Complex Golay sequences: structure and applications” Discrete Math., Vol. 252 ,pp 73–89, 2002.
[3] C. Ding, S. Liao, Y. Wang, et. al. “CircNN: Accelerating and compressing deep neural networks using block-circulant weight matrices”, International symposium on microarchitecture (MICRO) pp.395-408, 2017..
[4] J. Hadamard, “Résolutiond’une question relative aux déterminants”, Bull. Sci. Math., Vol. 17, pp. 240-246, 1893.
[5] A. V. Geramita and J. M. Geramita, “Complex orthogonal designs” J. Combin. Theory Ser. A, Vol. 25 , pp.211–225, 1978.
[6] M. Hall (Jr.), “Combinatorial Theory”, Wiley- Interscience, 2nd edition, pp.238-263, 1988.
[7] O. Mateo, D. Ž. Doković and I. S. Kotsireas, “Symmetric Hadamard matrices of order 116 and 172 exist”, Spec. Matrices, Vol. 3, pp.227–234, 2015.
[8] J. Seberry, “Orthogonal Designs: Hadamard Matrices, Quadratic Forms and Algebras”, Springer International Publishing AG 2017.
[9] J. Seberry and N. A. Balonin, “Two infinite families of symmetric Hadamard matrices”, Australas. J. Combin. Vol. 69, No. 3, pp.349–357, 2017.
[10] M. K. Singh, K. Sinha and S. Kageyama, “A construction of Hadamard matrices from BIBD( )”, Australas. J. Combin., Vol. 26, pp.93–97, 2002.
[11] M. K. Singh, and S. N. Topno, “On the construction of Hadamard matrices of order 4n (n odd, n 3) with Hadamard blocks of order 4”, Acta Cient. Indica, Vol XL M, No. 3, pp.309–313, 2014.
[12] M. K. Singh, S. N. Topno and T. Paswan, “Anticirculant structured block weighing matrices from Williamson matrices”, Int. J. Math. Trends Tech., Vol. 52, No. 4, pp.43-47, 2017.
[13] J. J. Sylvester, “Thoughts on inverse orthogonal matrices, simultaneous sign successions, and tessellated pavements two or more colours, with applications to Newton’s rule, ornamental tile-work, and the theory of numbers”, Phil. Mag. Vol. 34, No. 1, pp. 461–475, 1867.
[14] S. N. Topno and M. K. Singh, “Construction of Block Structured Complex Hadamard Matrices”, Acta Cient. Indica, Vol. XLIII M, No. 2 , pp.109–115, 2017.
[15] R. J. Turyn,“An infinite Class of Williamson Matrices”, J. Combin. Theory Ser. A, Vol. 12, pp. 319–321, 1972.
[16] W. D. Wallis, A. P. Street and J. S. Wallis, Combinatorics: Room Squares, Sum-Free Sets, Hadamard matrices, Springer-Verlag, Berlin-Heidelberg, New York, pp.279-299, 1972.
[17] P. Mazumder, R. Middya and M. K. Naskar, “Hardware Implementation of Fast Recursive Walsh-Hadamard Transform”, International Journal of Computer Sciences and Engineering, Vol.7, Issue.1, pp.28-32, 2019.