• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.465-468
• /
• 2003

본 논문에서는 광 저장장치의 기록밀도가 증가할 경우 발생하는 여러 가지 문제점들에 대응하는 PRML 시스템 구현 방법을 제안하고 기존의 시스템의 성능과 제안된 시스템의 성능을 비교한다. 기존의 채널 적응기법 및 비터비 복호화기에 대비해 보다 종은 성능을 가지는 구조의 비선형 등화방식과 비터비 예상 레벨 적응 알고리즘을 이용한 새로운 구조를 제안하고, 23Gbyte 저장용량을 가지는 Blu-ray 디스크에 28GB의 데이터를 기록하여 기록 기록밀도가 증가한 실제 디스크에 대한 실험 결과에 대하여 논한다.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.3157-3159
• /
• 2000

Soft Output Viterbi Algorithm is modification of Viterbi algorithm to deliver not only the decoded codewords but also a posteriori probability for each bit. This paper presents SOVA decoder which can be used for component decoder of turbo decoder. We used two-step SMU architectures combined with systolic array traceback methods to reduce the complexity of the design. We followed the specification of CDMA2000 system for SOVA decoder design.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.3
• /
• pp.24-31
• /
• 1998

This paper presents a pipeline high-level synthesis tool for designing trace-back systolic array viterbi decoder. It consists of a dta flow graph(DFG) generator and a pipeline data path synthesis tool. First, the DFG of the vitrebi decoder is generated in the from of VHDL netlist. The inputs to the DFG generator are parameters of the convolution encoder. Next, the pipeline scheduling and allocationare performed. The synthesis tool explores the design space efficiently, synthesizes various designs which meet the given constraints, and choose the best one.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.40 no.4
• /
• pp.351-359
• /
• 1991

This paper describes performances of speaker adaptation using a probabilistic spectral mapping matrix in hidden-Markov model(HMM) -based Korean isolated word recognition. Speaker adaptation based on probabilistic spectral mapping uses a well-trained prototype HMM's and is carried out by Viterbi, dynamic time warping, and forward-backward algorithms. Among these algorithms, the best performance is obtained by using the Viterbi approach together with codebook adaptation whose improvement for isolated word recognition accuracy is 42.6-68.8 %. Also, the selection of the initial values of the matrix and the normalization in computing the matrix affects the recognition accuracy.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.93-96
• /
• 2008

This paper describes an efficient design of a multi-standard Viterbi decoder that supports multiple constraint lengths and code rates. The Viterbi decode. is parameterized for the code rates 1/2, 1/3 and constraint lengths 7, 9, thus it has four operation modes. 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.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.6
• /
• pp.718-726
• /
• 2002

This paper presents a novel Viterbi decoding architecture for European Digital Video Broadcasting (DVB) receiver. The channel sate information (CSI) of each sub carrier is used to weight the bit-metric of each symbol. The weighted bit-metric is delivered to Viterbi decoder after going through the symbol deinterleaver and bit deinterleaver, such that the CSI can be correctly applied to corresponding bits even after the two interleavings. Simulation shows that the new architecture gives significant performance enhancement of 6~13dB in Rayleigh fading channels depending on the modulation types. This results is also better than previous results by 3.7~10.3dB.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.1
• /
• pp.53-60
• /
• 1999

This paper is a study on the korean broadcasting speech recognition. Here we present the methods for the large vocabuary continuous speech recognition. Our main concerns are the language modeling and the search algorithm. The used acoustic model is the uni-phone semi-continuous hidden markov model and the used linguistic model is the N-gram model. The search algorithm consist of three phases in order to utilize all available acoustic and linguistic information. First, we use the forward Viterbi beam search to find word end frames and to estimate related scores. Second, we use the backword Viterbi beam search to find word begin frames and to estimate related scores. Finally, we use A/sup */ search to combine the above two results with the N-grams language model and to get recognition results. Using these methods maximum 96.0% word recognition rate and 99.2% syllable recognition rate are achieved for the speaker-independent continuous speech recognition problem with about 12,000 vocabulary size.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.10
• /
• pp.815-820
• /
• 2012

We introduce two-dimensional soft output Viterbi algorithm (2D SOVA) and iterative 2D SOVA for holographic data storage. Since the holographic data storage is 2D intersymbol interference (ISI) channel, the 2D detection schemes have good performance at holographic data storage. The 2D SOVA and iterative 2D SOVA are 2D detection schemes. We introduce and compare the two 2D detection schemes. The 2D SOVA is approximately 2 dB better than one-dimensional (1D) detection scheme, and iterative 2D SOVA is approximately 1 dB better than the 2D SOVA. In contrast, the iterative 2D SOVA is approximately twice complex higher than 2D SOVA, and 2D SOVA is approximately twice complex higher than 1D detection scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.6
• /
• pp.1323-1329
• /
• 2014

In this paper, we analyzed efficient decoding scheme with FTN (Faster than Nyquist) method that is transmission method faster than Nyquist theory and increase the throughput. we proposed viterbi equalizer model to minimize ISI (Inter-Symbol Interference) when FTN signal is transmitted. the proposed model utilized interference as branch information. In this paper, to decode FTN singal, we used turbo equalization algorithms that iteratively exchange probabilistic information between soft Viterbi equalizer (BCJR method) and LDPC decoder. By changing the trellis diagram in order to maximize Euclidean distance, we confirmed that performance was improved compared to conventional methods as increasing throughput of FTN signal.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.7
• /
• pp.1579-1588
• /
• 2014

The LAN method is the most widely used in domestic high-speed internet access and rapidly moving to 1 Gbps Ethernet from 100 Mbps one to provide high-speed services such as UHD TV. The 1000BASE-T PHY with 4 pairs UTP transmits a PAM-5 signal at the 125 MHz clock per each pair to achieve 1 Gbps rate. In order to correct errors over the channel, the transmitter uses a TCM which is combined the convolutional encoder and PAM-5, and the receiver uses the Viterbi decoder. In this paper, we implement a Viterbi decoder which can correct two pair errors and operate at the least 125 MHz clock speed. Finally, we will verify the error correction function and the operating speed of the implemented decoder with a logic analyzer.