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

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

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

• International Journal of Computer Science & Network Security
• /
• v.24 no.9
• /
• pp.21-29
• /
• 2024

Precoding of the orthogonal frequency division multiplexing (OFDM) with Walsh Hadamard transform (WHT) is known in the literature. Instead of performing WHT precoding and inverse discrete Fourier transform separately, a product of two matrix can yield a new matrix that can be applied with lower complexity. This resultant transform, T-transform, results in T-OFDM. This paper extends the limited existing work on T-OFDM significantly by presenting detailed account of its computational complexity, a lower complexity receiver design, an expression for PAPR and its cumulative distribution function (cdf), sensitivity of T-OFDM to timing synchronization errors, and novel analytical expressions signal to noise ratio (SNR) for multiple equalization techniques. Simulation results are presented to show significant improvements in PAPR performance, as well improvement in bit error rate (BER) in Rayleigh fading channel. This paper is Part II of a three-paper series on alternative transforms and many of the concepts and result refer to and stem from results in generalized multicarrier communication (GMC) system presented in Part I of this series.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.2A
• /
• pp.116-123
• /
• 2002

The jacket matrix is based on the Walsh-Hadamard matrix and an extension of it. While elements of the Walsh-Hadamard matrix are +1, or -1, those of the Jacket matrix are ${\pm}$1 and ${\pm}$$\omega$, which is $\omega$, which is ${\pm}$j and ${\pm}$2$\sub$n/. This matrix has weights in the center part of the matrix and its size is 1/4 of Hadamard matrix, and it has also two parts, sigh and weight. In this paper, instead of the conventional Jacket matrix where the weight is imposed by force, a simple Jacket sequence generation method is proposed. The Jacket sequence is generated by AND and Exclusive-OR operations between the binary indices bits of row and those of column. The weight is imposed on the element by when the product of each Exclusive-OR operations of significant upper two binary index bits of a row and column is 1. Each part of the Jacket matrix can be represented by jacket sequence using row and column binary index bits. Using Distributed Arithmetic (DA), we present a VLSI architecture of the Fast Jacket transform is presented. The Jacket matrix is able to be applied to cryptography, the information theory and complex spreading jacket QPSK modulation for WCDMA.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.12
• /
• pp.66-74
• /
• 2001

In this paper, we proposed the new structure of the Rake Finger using Walsh Switch, the shared accumulator, and the pipeline FWHT(Fast Walsh Hadamard Transform) algorithm for reducing the signal processing complexity resulting from the increase of the number of data correlators. The function simulation of the proposed architecture is performed by Synopsys tool and the timing simulation is performed by Compass tool. The number of computational operation in the proposed data correlators is 160 additions and the conventional ones is 512 additions when the number of walsh code channels is 4. As a result, it is reduced about 3.2 times other than the number of computational operation of the conventional ones. Also, the result shows that the data processing time of the proposed Rake Finger architecture is 90,496[ns] and the conventional ones is 110,696[ns]. It is 18.3% faster than the data processing time of the conventional Rake Finger architecture.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.511-518
• /
• 2005

The conventional OFDM (Orthogonal Frequency Division Multiplexing) modulation can be combined with WHT (Walsh-Hadamard Transform) to reduce PAPR (Peak-to-Average Power Ratio) and improve BER (Bit Error Rate) performance. However, this WHT-based OFDM system still suffers a relatively high PAPR. Therefore, we suggest a new technique, called DGT (Data Grouping Technique) and design an OFDM system employing it and WHT to further decrease PAPR without the BER performance degradation. h salient property of DGT is the independence of the side information which is inherently a principal drawback of the well-known PAPR reduction techniques for OFDM system as well as WHT-based OFDM. The simulation programs have been also performed to verify the validity of the proposed system.

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