• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10C
• /
• pp.758-763
• /
• 2008

We introduce a noise-predictive turbo equalization using noise filter in perpendicular magnetic recording(PMR) channel. The noise filter mitigates the colored noise in high-density PMR channel. In this paper, the channel detectors used are SOVA (Soft Output Viterbi Algorithm) and BCJR algorithm which proposed by Bahl et al., and the outer decoder used is LDPC (Low Density Parity Check) code that is implemented by sum-product algorithm. Two kinds of LDPC codes are experimented. One is the 0.5Kbyte (4336,4096) LDPC code with the code rate of 0.94, and the other is 1Kbyte (8432,8192) LDPC code with the code rate of 0.97.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.1
• /
• pp.115-126
• /
• 1999

As the processing speed of communication and computer system has been improved, high speed data processing is required to correct error of data. In this paper, decoding algorithm which is applicable to the wireless communication system is proposed and encoder and decoder are designed by using the proposed decoding algorithm. We design the encoder and decoder by using the VHDL(VHSIC Hardware Description Language) and simulate the designed encoder and decoder by using V-system. Designed algorithm is synthesized by using synopsys tools and is made to one chip by means of XILINX XC4010EPC84-4. When 20MHz was used as the input clock, data arrival time was 29.20ns and data require time was 48.70ns.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1998.06a
• /
• pp.1017-1020
• /
• 1998

• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.29-32
• /
• 2000

HMM(Hidden Markov Model)은 시간적인 정보를 토대로 하는 수학적인 방법으로서 문자인식에 많이 사용되어지고 있다. 그런데 HMM이 적용되고자 하는 문제에서 사용되어지는 상태 수와 HMM에서 사용되어지는 parameter들은 처음에 결정되는 값들에 의해서 상당히 많은 영향을 받게 된다. 따라서 한글의 특성을 이용한 HMM의 상태 수를 결정한 후 결정되어진 각각의 HMM parameter들을 Genetic Algorithm을 이용하였다. Genetic Algorithm은 매개변수 최적화 문제에 대하여 자연의 진화 원리를 마땅한 알고리즘으로 선택, 교배, 돌연변이 연산을 이용하여 최적의 개체를 구하게 된다. 여기서는 HMM에서의 Viterbi Algorithm을 적합도 검사에 사용하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.6
• /
• pp.1056-1063
• /
• 2008

This paper describes an efficient design of a multi-standard Viterbi decoder that supports multiple constraint lengths and code rates. The Viterbi decoder is parameterized for the code rates 1/2, 1/3 and constraint lengths 7,9, thus it has four operation nodes. In order to achieve low hardware complexity and low power, an efficient architecture based on hardware sharing techniques is devised. Also, the optimization of ACCS (Accumulate-Subtract) circuit for the one-point trace-back algorithm reduces its area by about 35% compared to the full parallel ACCS circuit. The parameterized Viterbi decoder core has 79,818 gates and 25,600 bits memory, and the estimated throughput is about 105 Mbps at 70 MHz clock frequency. Also, the simulation results for BER (Bit Error Rate) performance show that the Viterbi decoder has BER of $10^{-4}$ at $E_b/N_o$ of 3.6 dB when it operates with code rate 1/3 and constraints 7.

• Journal of Broadcast Engineering
• /
• v.18 no.2
• /
• pp.311-318
• /
• 2013

This paper deals with a noise reduction algorithm which uses the binary masking in the time-frequency domain. To improve speech intelligibility in noise, noise-masked speech is decomposed into time-frequency units and mask "0" is assigned to masker-dominant region removing time-frequency units where noise is dominant compared to speech. In the previous research, Gaussian mixture models were used to classify the speech-dominant region and noise-dominant region which correspond to mask "1" and mask "0", respectively. In each frequency band, data were collected and trained to build the Gaussian mixture models and detection procedure is performed to the test data where each time-frequency unit belongs to speech-dominant region or noise-dominant region. In this paper, we consider the correlation of masks in the frequency domain and propose a post-processing method which exploits the Viterbi algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.7
• /
• pp.1468-1476
• /
• 1997

In mobile communication systems, the Reduced State Sequence Estimation(RSSE) receiver must be able to track changes in the channel. This is carried out by the adaptive channel estimator. However, when the tentative decisions are used in the channel estimator, incorrect decisions can cause error propagation. This paper presents a new channel estimator using the path history in the Viterbi decoder for preventing error propagation. The selection of the path history in the Viterbi decoder for preventing error propagation. The selection of the path history for the channel estimator depends on the path metric as in the decoding of the Viterbi decoder in RSSE. And a discussion on the channel estimator with different adaptation algorithms such as Least Mean Square(LMS) algorithm and Recursive Least Square(RLS) algorithm is provided. Results from computer simulations show that the RSSE receivers using the proposed channel estimator have better performance than the other conventional RSSE receiver, and that the channel estimator with RLS algorithm is adequate for multipath fading channel.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.11
• /
• pp.51-62
• /
• 2003

This paper presents a novel survivor memeory management and decoding techniques with sequential backward state transition control in the trace back Viterbi decoder. The Viterbi algorithm is an maximum likelihood decoding scheme to estimate the likelihood of encoder state for channel error detection and correction. This scheme is applied to a broad range of digital communication such as intersymbol interference removing and channel equalization. In order to achieve the area-efficiency VLSI chip design with high throughput in the Viterbi decoder in which recursive operation is implied, more research is required to obtain a simple systematic parallel ACS architecture and surviver memory management. As a method of solution to the problem, this paper addresses a progressive decoding algorithm with sequential backward state transition control in the trace back Viterbi decoder. Compared to the conventional trace back decoding techniques, the required total memory can be greatly reduced in the proposed method. Furthermore, the proposed method can be implemented with a simple pipelined structure with systolic array type architecture. The implementation of the peripheral logic circuit for the control of memory access is not required, and memory access bandwidth can be reduced Therefore, the proposed method has characteristics of high area-efficiency and low power consumption with high throughput. Finally, the examples of decoding results for the received data with channel noise and application result are provided to evaluate the efficiency of the proposed method.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.3 no.1 s.4
• /
• pp.117-125
• /
• 2004

Space-time coding and modulation exploit the presence of multiple transmit antennas to improve performance on multipath Rayleigh fading channels. In this paper, we propose the Trellis-Coded Differential Space Time Modulation-OFDM system with multiple symbol detection. The Trellis-code perform the set partition with unitary group codes. The Viterbi decoder containing new branch metrics is introduced in order to improve the bit error rate (BER) in the differential detection of the Unitary differential space time modulation. Also, we describe the Viterbi algorithm in order to use this branch metrics. Our study shows that such a Viterbi decoder improves BER performance without sacrificing bandwidth and power efficiency.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.10
• /
• pp.1869-1876
• /
• 2006

Recently, STC techniques have been considered to be candidate to support multimedia services in the next generation mobile radio communications and have been developed the many communications systems in order to achieve the high data rates. In this paper, we Nose the Trellis-Coded Differential Space Time Modulation system with multiple symbol detection. The Trellis-code performs the set partition with unitary group codes. The Viterbi decoder containing new branch metrics is introduced in order to improve the bit error rate (BER) in the differential detection of the unitary differential space time modulation. Also, we describe the Viterbi algorithm in order to use this branch metrics. Our study shows that such a Viterbi decoder improves BER performance without sacrificing bandwidth and power efficiency.