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

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

• ETRI Journal
• /
• v.43 no.2
• /
• pp.197-208
• /
• 2021

Single-carrier frequency division multiple access (SC-FDMA) is currently being used in long-term evolution uplink communications owing to its low peak-to-average power ratio (PAPR). This study proposes a new transceiver design for an SC-FDMA system based on Walsh-Hadamard transform (WHT). The proposed WHT-based SC-FDMA system has low-PAPR and better bit-error rate (BER) performance compared with the conventional SC-FDMA system. The WHT-based SC-FDMA transmitter has the same complexity as that of discrete Fourier transform (DFT)-based transmitter, while the receiver's complexity is higher than that of the DFT-based receiver. The exponential companding technique is used to reduce its PAPR without degrading its BER. Moreover, the performances of different ordered WHT systems have been studied in additive white Gaussian noise and multipath fading environments. The proposed system has been verified experimentally by considering a real-time channel with the help of wireless open-access research platform hardware. The supremacy of the proposed transceiver is demonstrated based on simulated and experimental results.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.4
• /
• pp.106-114
• /
• 2016

In this paper, we propose an efficient integer inverse transform structure for vp9 decoder. The proposed structure is a hardware structure which is easy to control and requires less hardware resources, and shares algorithms for realizing entire DCT(Discrete Cosine Transform), ADST(Asymmetric Discrete Sine Transform) and WHT(Walsh-Hadamard Transform) in vp9. The integer inverse transform for vp9 google model has a fast structure, named butterfly structure. The integer inverse transform for google C model, unlike universal fast structure, takes a constant rounding shift operator on each stage and includes an asymmetrical sine transform structure. Thus, the proposed structure approximates matrix coefficient values for all transform mode and is used to matrix operation method. With the proposed structure, shared operations for all inverse transform algorithm modes can be possible with reduced number of multipliers compared to the butterfly structure, which in turn manages the hardware resources more efficiently.

• Journal of Satellite, Information and Communications
• /
• v.7 no.3
• /
• pp.26-29
• /
• 2012

In this paper, we propose a Single Carrier Frequency Division Multiple Access(SC-FDMA) scheme with greatly enhanced tolerance of timing offset among the users. The type of the proposed scheme is similar to code spread Multiple Carrier Direct Spread Code Division Multiple Access(MC DS CDMA). The proposed scheme performs partial Discrete Fourier Transform(DFT) in order to solve high Peak to Average Power Ratio(PAPR) of the MC DS CDMA before Inverse Fast Fourier Transform(IFFT). Exploiting the property Properly Scrambled Walsh-Hadamard(PSW) code has zero correlation despite ${\pm}1$ chip timing offset, the proposed scheme achieves Multiple Access Interference free performance with the timing offset up to ${\pm}1$ OFDM symbol duration with low PAPR. In contrast, the other existing schemes in comparison undergo severe performance degradation even with small timing offset in multipath fading channel.

• Journal of Broadcast Engineering
• /
• v.24 no.5
• /
• pp.879-891
• /
• 2019

This paper provides performance evaluations of various channel estimation schemes for Advanced Television Systems Committee (ATSC) 3.0 multiple-input multiple-output (MIMO) system under a fixed reception environment. ATSC 3.0 MIMO system can obtain high spectral efficiency and improved reception performance compared to conventional terrestrial broadcasting systems. The ATSC 3.0 MIMO defines Walsh-Hadamard and null pilot encoding algorithms and the amplitude and phase of MIMO pilots are different from those of single-input single-output pilots. At the receiver, linear and discrete Fourier transform (DFT)-based interpolations can be used for the channel estimation. This paper provides the various combinations of the interpolation schemes for channel estimation in time and frequency dimensions, and then analyzes the performance of the various combinations through the computer simulation. The results of computer simulation show that the combination of the linear interpolation in the time dimension and then DFT-based interpolation in the frequency dimension can obtain the best performance among the considered combinations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.2
• /
• pp.352-358
• /
• 2004

This paper is studied the improvement of performance for moving picture encoder using H.263. This is used the new motion vector search algorithm using a relation with neighborhood search point and is applied the integer DCT for the encoder. The integer DCT behaves DCT by the addition operation of the integer using WHT and a integer lifting than conventional DCT that needs the multiplication operation of a floating point number. Therefore, the integer Dn can reduce the operation amount than basis DCT with having an equal PSNR. The new motion vector search algorithm is showed almost similar PSNR as reducing the operation amount than the conventional motion vector search algorithm. To experiment a compatibility of the integer DCT and the conventional DCT, according to result compare case that uses a method only and case that uses the alternate two methods of the integer DCT or the conventional DCT to H.263 encoder and decoder, case that uses the alternate two methods is showed doing not deteriorate PSNR-and being each other compatible visually than case that uses an equal method only.