• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1A
• /
• pp.43-50
• /
• 2012

The use of an error-correcting code is essential in digital communication systems where the channel is noisy. Unless a receiver has accurate channel coding parameters, it becomes difficult to decode the digitized encoding bits correctly. In this paper, estimation algorithm for RM(Reed-Muller) codes using FHT (Fast Hadamard algorithm) is proposed. The proposed algorithm estimates the channel coding parameters of RM codes and then decodes the codes using the characteristic of FHT. And we also verify the algorithm by performing intensive computer simulation in additive white gaussian noise (AWGN) channel.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.93-101
• /
• 2010

In this paper we generate Gold-sequence by using M-sequence which is made by two primitive polynomial of GF(2). Generally M-sequence is generated by linear feedback shift register code generator. Here we show that this matrix of appropriate permutation has Hadamard matrix property. This matrix proves that Gold-sequence through two M-sequence and additive matrix of one column has one of major properties of Hadamard matrix, orthogonal. and this matrix show another property that multiplication with one matrix and transpose matrix of this matrix have the result of unit matrix. Also M-sequence which is made by linear feedback shift register gets Hadamard matrix property mentioned above by adding matrices of one column and one row. And high-speed conversion is possible through L-matrix and the S-matrix.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.3
• /
• pp.197-203
• /
• 1986

The images which are scanned by CCTV are converted to digital signal and 6502 Microcomputer processes data by Transform coding. Thus data is reduced to $64{ imes}64$pixels and input by outer memory using same address with inner one for the fast process. Hadmard Transform, Weighted Hadamard Transform which is weighted in the center of matrix and Haar Transform are programmed by assembly language and every Transform is dome within one second.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1175-1178
• /
• 1998

we propose the Walsh-Hadamard Transform adaptive filter with time-varying step size. The performance of the proposed algorithm is evealuated in system identification where computer simulations are performed for both time-invariant and time-varying system. It is shown that the proposed algorithm produces good results compared with similar algorithms under different conditions, particularly in case of time-varying circumstance.

• The Magazine of the IEIE
• /
• v.20 no.3
• /
• pp.81-92
• /
• 1993

• Journal of the Korean Professional Engineers Association
• /
• v.20 no.1
• /
• pp.14-20
• /
• 1987

The development of the FHT (fast Hadamard transform) was presented and based on the derivation by Cooley-Tukey algorithm. Alternately, it can be derived by matrix partitioning or matrix factorization techniques. This paper proposes a simple sparse matrix technique by Kronecker product of successive lower Hadamard matrix. The following shows how the Kronecker product can be mathematically defined and efficiently implemented using a matrix factorization methods.

• Proceedings of the KIEE Conference
• /
• 1997.07b
• /
• pp.478-481
• /
• 1997

Hadamard Transform Spectrometer (HTS) is an instrument which measures the spectrum of a source with high signal to noise ratio using multiplexing advantage. While the conventional HTS has the 1-dimensional characteristics because it measures only the spectrum, the system presented in this paper is 2-dimensional so that it can measure the spectrum of each position. We introduce here 2-dimensional Hadamard transform spectrometer and analyze it. The $T^{-1}$ method which recover the spectrum and compensate the transmissive nonideality of the stationary electro-optical mask(EOM) are applied to the system. By computer simulations we show we can get better estimates from the proposed system than that from the conventional HTS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8C
• /
• pp.712-719
• /
• 2007

In this paper, we propose a new, effective, fast motion estimation algorithms using $4{\times}4$ pixels Hadamard transform. The Hadamard transform has the advantage of simplicity because it uses only addition and subtraction. Motion estimation is composed of three stages. First, it should be decided whether to terminate the search early and use a previous motion vector with DC(Direct Current) coefficients. Then the adaptive matching scan order for motion estimation should be determined according to the image complexity using AC(Alternating Current) coefficients. Experimentally, we adapted this algorithms to MVFAST and PMVFAST algorithms, and the proposed algorithms turn out to be very efficient in terms of computational speed while remaining almost the same in terms of PSNR(Peak Signal-to-Noise Ratio) compared to MVFAST and PMVFAST algorithms.

• Journal of Biomedical Engineering Research
• /
• v.16 no.2
• /
• pp.239-248
• /
• 1995

The method of increasing signal to noise ratio (SNR) in a Hadamard transform spectrometer (HTS) is multiplexing. The multiplexing is executed by a mask. Conventional masks are mechanical or electro-optical. A mechanical mask has disadvantages of jamming and misalignment. A stationary electro-optical mask has a disadvantage of information losses caused by spacers which partition mask elements. In this paper, a mixed-concept electro-optical mask (MCEOM) is developed by expanding the length of a spacer to that of lon-off mask element. An MCEOM is operated by stepping a movable mask. 2N measurements are required for N spectrum estimates. The average mean square error (AMSE) using MCEQM is equal to that using a stationary electro-optical mask without spacers for large N. The cost of manufacturing an MCEOM is lower than that of producing a conventional electro-optical mask because an MCEOM needs only (N + 1)/2 on-off mask elements whereas the con¬ventional electro-optical mask needs N on-off mask elements. There are no information losses in the spectrometers having an MCEOM.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.319-327
• /
• 2016

In this paper we investigate that most of plants and animals have the symmetric property, such as a tree or a sheep's horn. In addition, the human body is also symmetric and contains the DNA. We can see the logarithm helices in Fibonacci series and animals, and helices of plants. The sunflower has a shape of circle. A circle is circular symmetric because the shapes are same when it is shifted on the center. Einstein's spatial relativity is the relation of time and space conversion by the symmetrically generalization of time and space conversion over the spacial. The left and right helices of plants and animals are the symmetric and have element-wise inverse relationships each other. The weight of center weight Hadamard matrix is 2 and is same as the base 2 of natural logarithm. The helix matrices are symmetric and have element-wise inverses.