• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.2
• /
• pp.103-109
• /
• 2021

About the orthogonal Hadamard matrix announced by Hadamard in France in 1893, Professor Moon Ho Lee newly defined it as Center Weight Hadamard in 1989 and announced it, and discovered the Jacket matrix in 1998. The Jacket matrix is a generalization of the Hadamard matrix. In this paper, we propose a method of obtaining the Symmetric Jacket matrix, analyzing important properties and patterns, and obtaining the Jacket matrix's determinant and Eigenvalue, and proved it using Eigen decomposition. These calculations are useful for signal processing and orthogonal code design. To analyze the matrix system, compare it with DFT, DCT, Hadamard, and Jacket matrix. In the symmetric matrix of Galois Field, the element-wise inverse relationship of the Jacket matrix was mathematically proved and the orthogonal property AB=I relationship was derived.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7C
• /
• pp.635-639
• /
• 2009

In this paper, we show that any two Hadamard matrices of the same size are equivalent if they have the property that the rows of each Hadamard matrix are closed under binary vector addition. One of direct consequences of this result is that the equivalence between cyclic Hadamard matrices constructed by maximal length sequences and Walsh-Hadamard matrix of the same size generated by Kronecker product can be established.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.3-10
• /
• 2014

In this paper we review the typical Toeplitz matrices and block circulant matrices, and propose the a circulant Hadamard matrix which is consisted of +1 and -1, but its structure is different from typical Hadamard matrix. The proposed circulant Hadamard matrix decreases computational complexities to $Nlog_2N$ additions through high speed algorithm compare to original one. This matrix is able to be applied to Massive MIMO channel estimation, FIR filter design, amd signal processing.

• Journal for History of Mathematics
• /
• v.20 no.2
• /
• pp.109-126
• /
• 2007

This paper is to study theorems related with congruence of triangles in Lobachevskii's and Hadamard's geometry textbooks, and to compare their proof methods. We find out that Lobachevskii's geometry textbook contains 5 theorems of triangles' congruence, but doesn't explain congruence of right triangles. In Hadamard's geometry textbook description system of the theorems of triangles' congruence is similar with our mathematics textbook. Hadamard's geometry textbook treat 3 theorems of triangles' congruence, and 2 theorems of right triangles' congruence. But in Hadamard's geometry textbook all theorems are proved.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.5
• /
• pp.9-17
• /
• 2013

In this paper we introduce modular symmetric designs and use them to study the existence of Hadamard-Jacket matrices modulo 3/5. We prove that there exist 5-modular Hadamard-Jacket matrices of order n if and only if n≢3.7 (mod 10) and n≢6,11. In particular, this solves the 5-modular version of the Hadamard conjecture.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.169-181
• /
• 2007

Applying the properties of Hadamard core for totally nonnegative matrices, we give new lower bounds of the determinant for Hadamard product about matrices in Hadamard core and totally nonnegative matrices, the results improve Oppenheim inequality for tridiagonal oscillating matrices obtained by T. L. Markham.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.5
• /
• pp.10-15
• /
• 2010

Good performance of spectral-amplitude-coding optical CDMA can be obtained using codes based upon Hadamard matrices, but Hadamard codes have very restrictive code lengths of $2^n$. In this paper a new code family, namely extended Hadamard code, is proposed to relax the code length restriction and the number of simultaneous users. The improved performance of the proposed system is analysed with the consideration of phase-induced intensity noise(PIIN).

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.19 no.8
• /
• pp.927-932
• /
• 2008

We propose a novel $4{\times}4$ Hadamard matrix feed network for a $4{\times}1$ array antenna to form a dual beam. If each element of the array is excited following the elements in a row of the Hadamard matrix, a two-lobed antenna beam can be obtained. The angle between the two lobes can be controlled. The Hadamard matrix feed network consists of four $90^{\circ}$ hybrids, a crossover and four $90^{\circ}$ phase shifters. The array, including the Hadamard matrix feed network, was fabricated on a microstip structure. The measured beam directions of the two lobes are $0^{\circ}$, ${\pm}15^{\circ}$, ${\pm}33^{\circ}$, ${\pm}45^{\circ}$ depending on the choice of the input port of the feed network.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.8
• /
• pp.5-9
• /
• 2011

Spectral-amplitude-coding optical CDMA systems using codes based upon Hadamard matrices have very restrictive code lengths of $2^n$ and high phase-induced intensity noise(PIIN). In this paper a new code family, namely modified Hadamard code, is proposed to relax the code length restriction and the number of simultaneous users. The improved performance of the proposed system is analysed with the consideration of noise.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.498-503
• /
• 2009

As for Hadamard Transform, because the calculation time of this transform is slower than Discrete Cosine Transform (DCT) and Fast Fourier Transform (FFT), the effectiveness and the practicality are insufficient. Then, the computational complexity can be decreased by using the butterfly operation as well as FFT. We composed calculation time of FFT with that of Fast Complex Hadamard Transform by constructing the algorithm of Fast Complex Hadamard Transform. They are indirect conversions using program of complex number calculation, and immediate calculations. We compared calculation time of them with that of FFT. As a result, the reducing the calculation time of the Complex Hadamard Transform is achieved. As for the computational complexity and calculation time, the result that quadrinomial Fast Complex Hadamard Transform that don't use program of complex number calculation decrease more than FFT was obtained.