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

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.318-318
• /
• 2006

• The KIPS Transactions:PartC
• /
• v.8C no.5
• /
• pp.499-506
• /
• 2001

In this work, we present an iris pattern recognition method as a biometrically based technology for personal identification and authentication For this, we propose a new algorithm for extracting an unique feature from the iris of the human eye and representing this feature using the discrete Walsh-Hadamard transform. From the computational simplicity of the adopted transform, this can perform the personal identification and authentication in a fast manner to accomplish the information security.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.10
• /
• pp.1617-1623
• /
• 1989

The introduction of the fast Fourier transform(FFT),an efficient computational algorithm for the discrete Fourier transform(DFT) by Cooley and Tukey(1965), has brought to the limelight various other discrete transforms. Some of the analog functions from which these transforms have been derived date back to the early 1920's, for example, Walsh functions (Walsh, 1923) and Hadamard Transform(Enomoto et al, 1965). Fast algorithms developed for the forward transform are equally applicable, exept for minor changes, to the inverse transform. In this paper, we present a simple pipelined Hadamard matrix(HM) which is used to develop a fast algorithm for the Hadamard Processor (HP). The Fast Hadamard Transform(FHT) can be derived using matrix partitioning techniques. The HP system is incorporated through a modular design which permits tailoring to meet a wide range of video data link applications. Emphasis has been placed on a low cost, a low power design suitable for airbone system and video codec.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.1
• /
• pp.132-137
• /
• 2007

Jacket transforms are a class of transforms which are simple to calculate, easily inverted and are size-flexible. Previously reported jacket transforms were generalizations of the well-known Walsh-Hadamard transform (WHT) and the center-weighted Hadamard transform (CWHT). In this paper we present a new class of jacket transform not derived from either the WHT or the CWHT. This class of transform can be applied to any even length vector, and is applicable to finite fields and is useful for constructing error control codes.

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

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2000.05a
• /
• pp.65-70
• /
• 2000

본 논문에서는 차세대 이동통신분야에서 고속의 데이터 전송과 무선 환경극복을 위해 사용되는 OFDM 시스템에서 전송되어지는 신호들의 PAPR(Peak-to-Average Power Ratio)를 감소시키는 방안을 제시한다. PN 시퀀스로 쓰이는 두 개의 직교 시퀀스, 즉 Walsh-Hadamard 시퀀스와 Golay complementary 시퀀스의 PAPR 성질을 살펴보고 그 결과를 보인다. 즉, 상대적으로 적은 채널사용자일 때 Walsh-Hadamard 시퀀스는 매우 큰 PAPR를 가지며, 반면 Golay complementary 시퀀스는 이론 값에 근접한 안정된 상태를 보인다. 이 두 시퀀스의 장단점을 이용하여 채널사용자 수에 따른 직교 시퀀스의 결정으로 OFDM 시스템의 PAPR를 줄이는 방법을 제안하고 컴퓨터 시뮬레이션을 통하여 그 감소효과를 검증한다.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1984.10a
• /
• pp.1-4
• /
• 1984

This paper is discussed to prepard reference data as a bassic study for Hangeul Character recognition and to extract 2 - Dtransform Korean Charater Image, The 1959 Hangeul Characters is established to form the total 170patterns of 17 formats classified by the initial soun, middle sound and terminal sound and prossessed the 2-D Korean Character Image. Using Superpostion theormm, we are applied to recognition Algorithm. For 50's Hangeul, the recognition efficiency is calculated by computer simulation.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.4
• /
• pp.304-312
• /
• 2008

Orthogonal codes like Walsh and Golay codes may have large correlation value when they are not synchronized, hence they are seldom used in asynchronous CDMA systems. Wysocki[1] showed that by multiplying the original Walsh-Hadamard matrix with an orthogonal transformation matrix the resultant matrix sustains orthogonality between row vectors and their cross-correlation can be reduced. Soberly and Wysocki[2] proposed similar scheme on Golay codes. This implies that using the proper orthogonal transformation cross-correlation of Walsh and Golay codes can be reduced, and the transformed codes can be used for user separation in the CDAM reverse link. In this paper we discuss cross-correlation related parameters which affect the performance of an asynchronous CDMA link, and we investigate the correlation properties of the transformed codes. When we designed orthogonal transformation matrices for Walsh and Golay codes, we minimized the maximum value of aperiodic cross-correlation of the codes ($ACC_{max}$) or the mean square value of the aperiodic cross-correlation($R_{cc}$) with preserving the orthogonality of the modified codes. We also evaluate the asynchronous CDMA system that uses the transformed Walsh and Golay codes.

• The KIPS Transactions:PartB
• /
• v.14B no.1 s.111
• /
• pp.13-22
• /
• 2007

In this paper, we propose an audience counting method in an auditorium based on pattern comparison. The previous counting methods based on object detection can't exactly count the audience in real time because auditorium has coarse illumination condition and so many audiences. Therefore, in this paper, we count the audience in an auditorium with fixed seats by the method which the pattern from each reference seat is compared to the pattern from each input seat. Especially, to overcome limitations based on either illumination or noise, two pattern comparison methods are efficiently employed and combined. One is based on the amplitude projection, and the other is based on Walsh-Hadamard Kernel. Walsh-Hadamard Kernel has the characteristic which complements amplitude projection. Therefore, we ran achieve the accurate counting in the presence of coarse illumination and noise. The experimental results show that our method performs well on sequences of images acquired in an auditorium. We also verify a realistic possibility for other applications applying our method to the parking positioning system.