• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.687-690
• /
• 1998

The full Viterbi detector for EPRML read channel system needs large area due to complex computation. There are several conventional methods to reduce the complexity such as GVA(Generalized Viterbi Algorithm) and BMS(Branch Metric Shift). This paper proposes another method, FVD(Folding Viterbi Detector), that has state transition diagram folded with inverted states. Compared with GVA detector, FVD requires only 61% gates and has lower power consumption and better BER performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11C
• /
• pp.896-900
• /
• 2010

We investigate the bit error rate against signal-to-noise ratio performance corresponding to track mis-registration for patterned media storage. The patterned media channels with and without soft underlayer are implemented, and we simulate using one-dimensional Viterbi detector and two-dimensional soft output Viterbi detector (SOVA) when the track mis-registration is 0% (on-track), 10%, 20%, 30%, and 40%. While the BER performance degrades approximate 0.3 ~ 0.5 dB at 10% track mis-registration, it degrades severe over 10% track mis-registration.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.1E
• /
• pp.21-26
• /
• 2007

In this paper, we propose a modified Viterbi algorithm to compensate for endpoint detection error during the decoding phase of an isolated word recognition task. Since the conventional Viterbi algorithm explores only the search space whose boundaries are fixed to the endpoints of the segmented utterance by the endpoint detector, the recognition performance is highly dependent on the accuracy level of endpoint detection. Inaccurately segmented word boundaries lead directly to recognition error. In order to relax the degradation of recognition accuracy due to endpoint detection error, we describe an unconstrained search of word boundaries and present an algorithm to explore the search space with efficiency. The proposed algorithm was evaluated by performing a variety of simulated endpoint detection error cases on an isolated word recognition task. The proposed algorithm reduced the Word Error Rate (WER) considerably, from 84.4% to 10.6%, while consuming only a little more computation power.

• Journal of Korea Multimedia Society
• /
• v.10 no.12
• /
• pp.1585-1590
• /
• 2007

This paper introduces adaptive PRML (Partial Response Maximum Likelihood) architecture with PR (a,b,c,d,e) channel type for the improved readability of high-density optical discs with capacity greater than 30GB. The proposed PRML architecture consists of an adaptive equalizer, a Viterbi detector and a channel identifier. Detailed description for each component is included. The architecture is implemented in chip and also confirmed its performance on the test board mounting the chip. Test results show that the proposed 5-tap PRML architecture is well operated, and less than $2{\times}10^{-4}$ of BER (Bit Error Rate) is achieved with radial and tangential tilt margin of ${\pm}0.6^{\circ}$ on self-made 30GB BD at 1x speed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9C
• /
• pp.871-876
• /
• 2005

In this paper, we propose an improved partial response maximum likelihood (PRML) detection scheme that has an adaptive equalizer and can be applied in the asymmetric optical recording system with high-density. We confirmed that the proposed PRML detector improves detection performance. In addition, we implemented the detector by Verilog HDL. The adaptive equalizer is composed of tap coefficient updating unit using LMS algorithn and FIR filter. FIR filter is implemented by the transposed direct form architecture for high speed operation. Viterbi detector is implemented by the register exchange method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7C
• /
• pp.642-646
• /
• 2005

We propose an improved partial response maximum likelihood (PRML) detector with the branch value compensation of Viterbi decoder for asymmetric high-density optical channel. Since the compensation value calculated by a survival path is applied to each branch metric, it reduces the detection errors by the asymmetric channel. The proposed PRML detection scheme improves the detection performance on the $2^{nd},\;3^{rd}\;and\;4^{th}$ order PR targets for asymmetric optical recording channel.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.5
• /
• pp.583-586
• /
• 2004

Transition jitter noise is one of major sources of detection errors in high density recording channels. Implementation complexity of the optimal detector for such channels is high due to the data dependency and correlated nature of the jitter noise. In this paper, two types of hardware efficient sub-optimal detectors are derived by modifying branch metric of Viterbi algorithm and applied to partial response (PR) channels combined with run length limited modulation coding. The additional complexity over the conventional Viterbi algorithm to incorporate the modified branch metric is either a multiplication or an addition for each branch metric in the Viterbi trellis.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.3
• /
• pp.8-14
• /
• 1992

In this paper, the differential detection technique of multi-h CPM is introduced and described. We derived the sets of modulation index of multi-h phase codes adequate to the differential detection. The power spectra of multi-h signals with various sets of modulation index are presented and compared to those of MSK and QPSK. Error rate performances of the conventional detector and Viterbi algorithm detector of 2-h and 3-h CPM are evaluated and compared.

• Journal of Communications and Networks
• /
• v.16 no.3
• /
• pp.270-279
• /
• 2014

The Viterbi decoding algorithm, which provides maximum - likelihood decoding, is currently considered the most widely used technique for the decoding of codes having a state description, including the class of linear error-correcting convolutional codes. Two classes of nonbinary convolutional codes are presented. Distance preserving mapping convolutional codes and M-ary convolutional codes are designed, respectively, from the distance-preserving mappings technique and the implementation of the conventional convolutional codes in Galois fields of order higher than two. We also investigated the performance of these codes when combined with a multiple frequency-shift keying (M-FSK) modulation scheme to correct narrowband interference (NBI) in power-line communications channel. Themodification of certain detectors of the M-FSK demodulator to refine the selection and the detection at the decoder is also presented. M-FSK detectors used in our simulations are discussed, and their chosen values are justified. Interesting and promising obtained results have shown a very strong link between the designed codes and the selected detector for M-FSK modulation. An important improvement in gain for certain values of the modified detectors was also observed. The paper also shows that the newly designed codes outperform the conventional convolutional codes in a NBI environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9C
• /
• pp.891-897
• /
• 2003

Partial response maxim likelihood (PRML) is a powerful and indispensable detection scheme for perpendicular magnetic recording channels. The performance of PRML can be improved by incorporating a noise prediction scheme into branch metric computations of Viterbi algorithm (VA). However, the systems constructed by VA have shortcomings in the form of high complexity and cost. In this connection, a new simple detection scheme is proposed by exploiting the minimum run-length parameter d=1 of RLL code. The proposed detection scheme have a slicer instead of Viterbi detector and a noise predictor as a feedback filter. Therefore, to improve BER performance, the proposed detection scheme is extended to dual detection scheme for improving the BER performance. Simulation results show that the proposed scheme has a comparable performance to noise-predictive maximum likelihood (NPML) detector with less complexity when the partial response (PR) target is (1,2,1).