• 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 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 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.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1125-1128
• /
• 1993

We propose the new method about the neural-based pattern recognition by using Hadamard transform for the improvement of learning speed, stability and flexibility of network. We can obtain the spatial feature of pattern by Hadamard transformed pattern. We carried out an experiment to estimate the effect of Hadamard transform. We tried the learning of numeric patterns, and tried the pattern recognition with noisy pattern. As a result, the learning times of the network for the 'Hadamard' case is smaller than that of usual case. And the recognition rate of the network for the 'Hadamard' case is higher than that of usual case, too.

• Proceedings of the KIEE Conference
• /
• 1997.07b
• /
• pp.616-619
• /
• 1997

The spectrum-recovery scheme in Hadamard transform spectroscopy is commonly implemented with a fast Hadamard transform (FHT). When the Hadamard or simplex matrix corresponding to the mask does not have the same ordering as the Hadamard matrix corresponding to the FHT, a modification is required. When the two Hadamard matrices are in the same equivalence class, this modification can be implemented as a permutation scheme. This paper investigates permutation schemes for this application. This paper is to relieve the confusion about the applicability of existing techniques, reveals a new, more efficient method: and leads to an extension that allows a permutation scheme to be applied to any Hadamard or simplex matrix in the appropriate equivalence class.

• 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.

• 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.

• 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.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).

• Journal of electromagnetic engineering and science
• /
• v.7 no.1
• /
• pp.17-27
• /
• 2007

Jacket matrices which are defined to be $n{\times}n$ matrices $A=(a_{jk})$ over a field F with the property $AA^+=nI_n$ where $A^+$ is the transpose matrix of elements inverse of A,i.e., $A^+=(a_{kj}^-)$, was introduced by Lee in 1984 and are used for signal processing and coding theory, which generalized the Hadamard matrices and Center Weighted Hadamard matrices. In this paper, some properties and constructions of Jacket matrices are extensively investigated and small orders of Jacket matrices are characterized, also present the full rate and the 1/2 code rate complex orthogonal space time code with full diversity.