• Proceedings of the KIEE Conference
• /
• 2007.11c
• /
• pp.141-145
• /
• 2007

Using the New Fast Walsh Transform algorithm, we present a new algorithm which reduces the computational amount, and it can consequently calculate the real and imaginary components for current and voltage signals of power system in sampling intervals. The calculation amount is reduced to 2X(m-1) at m samples to measure full harmonics using developed algorithm. When in single harmonic measuring, it needs only 2(log2N-1)+1 additions and subtractions. We developed hardware device for testing, and tested the developed algorithm by measuring real and imaginary components.

• Journal of Biomedical Engineering Research
• /
• v.7 no.1
• /
• pp.67-74
• /
• 1986

We have implemented data compression and reconstruction by using a fast Walsh transform. The ECG signals were generated by an ECG BimLllator (KONT- RON). The sampling frequency was 480 Hz and the data point number used was 512. In order to eliminate the 60 Hz noise and baseline drift, a digital notch filter was designed. We obtaine!1 a compression ratio of 5 : 1 and at this ratio it was possible to obtain a true diagnosis and an ECG morphology analysis.

• ETRI Journal
• /
• v.27 no.2
• /
• pp.195-205
• /
• 2005

In this paper, an error-free Butcher algorithm is introduced to study the singular system of a linear electrical circuit for time invariant and time varying cases. The discrete solutions obtained using Runge-Kutta (RK)-Butcher algorithms are compared with the exact solutions of the electrical circuit problem and are found to be very accurate. Stability regions for the single term Walsh series (STWS) method and the RK-Butcher algorithm are presented. Error graphs for inductor currents and capacitor voltages are presented in a graphical form to show the efficiency of the RK-Butcher algorithm. This RK-Butcher algorithm can be easily implemented in a digital computer for any singular system of electrical circuits.

• 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 applied mathematics & informatics
• /
• v.7 no.1
• /
• pp.269-278
• /
• 2000

A Boolean function generates a binary sequence which is frequently used in a stream cipher. There are number of critical concepts which a Boolean function, as a key stream generator in a stream cipher, satisfies. These are nonlinearity, correlation immunity, balancedness, SAC(strictly avalanche criterion), PC(propagation criterion) and so on. In this paper, we present the algorithms for generating random nonlinear combining functions satisfying given correlation immune order and nonlinearity. These constructions can be applied for designing the key stream generators. We use Microsoft Visual C++6.0 for our program.

• ETRI Journal
• /
• v.34 no.2
• /
• pp.168-174
• /
• 2012

In Advanced Television Systems Committee (ATSC) terrestrial digital television (DTV) systems, additional very low-rate data can be transmitted by modulating the amplitude and polarity of the transmitter identification (TxID) signal. Although the additional data transmission scheme offers reliable transmission and has a very large coverage area, it has a limitation on the data rate. In this paper, we propose a novel additional data transmission scheme based on the TxID sequences of the ATSC DTV system and Walsh modulation. The proposed scheme not only increases the data rate significantly, but also offers a virtually identical coverage area compared to a conventional scheme.

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

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.206-212
• /
• 2012

In this paper, in order to effectively apply unitary space-time modulation to the direct-sequence spread-spectrum multiple-access (DSSS-MA) networks, we propose a low-rate, noncoherent, unitary, and space-time modulated DSSS system supporting any number of transmit antennas based on Walsh matrices. The proposed scheme simultaneously performs bandwidth spreading and space-time coding and outperforms those using high-rate, conventional unitary space-time constellations. Furthermore, the proposed scheme allows for a simple detector structure based on fast Walsh transforms.

• 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 information and communication convergence engineering
• /
• v.20 no.1
• /
• pp.1-7
• /
• 2022

Herein, a new space-time block coding technique is proposed for a MIMO 2 × 2 multiple-input multiple output (MIMO) system to minimize the bit error rate (BER) in Rayleigh fading channels with reduced decoding complexity using ZF and MMSE linear detection techniques. The main objective is to improve the service quality of wireless communication systems and optimize the number of antennas used in base stations and terminals. The idea is to exploit the correlation product technique between both information symbols to transmit per space-time block code and their own orthogonal Walsh-Hadamard sequences to ensure orthogonality between both symbol vectors and create a full-rate orthogonal STBC code. Using 16 quadrature amplitude modulation and the quasi-static Rayleigh channel model in the MATLAB environment, the simulation results show that the proposed space-time block code performs better than the Alamouti code in terms of BER performance in the 2 × 2 MIMO system for both cases of linear decoding ZF and MMSE.