Browse > Article

Design of an Area-Efficient Survivor Path Unit for Viterbi Decoder Supporting Punctured Codes  

Kim, Sik (서강대학교 전자공학과 CAD & Computer System 연구실)
Hwang, Sun-Young (서강대학교 전자공학과 CAD & Computer System 연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.29, no.3A, 2004 , pp. 337-346 More about this Journal
Abstract
Punctured convolutional codes increase transmission efficiency without increasing hardware complexity. However, Viterbi decoder supporting punctured codes requires long decoding length and large survivor memory to achieve sifficiently low bit error rate (BER), when compared to the Viterbi decoder for a rate 1/2 convolutional code. This Paper presents novel architecture adopting a pipelined trace-forward unit reducing survivor memory requirements in the Viterbi decoder. The proposed survivor path architecture reduces the memory requirements by removing the initial decoding delay needed to perform trace-back operation and by accelerating the trace-forward process to identify the survivor path in the Viterbi decoder. Experimental results show that the area of survivor path unit has been reduced by 16％ compared to that of conventional hybrid survivor path unit.
Keywords
Viterbi 복호기;면적 최적화;생존자 경로 계산기;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Convolutional Codes and their Performance in Communication Systems /
[ A.Viterbi ] / IEEE Trans. on Commun.   DOI
2 Architectural Tradeoffs for Survivor Sequence Memory Management in Viterbi Decoders /
[ G.Feygin;P.Gulak ] / IEEE Trans. on Commun.   DOI   ScienceOn
3 Stanford Telecom VLSI Design of a Convolutional Decoder /
[ H.Bustamante(et al.) ] / Proc. IEEE Conf. Military Commun.
4 An Area Efficient Surviving Path Unit for the Viterbi Algorithm /
[ D.Dabiri;I.Blake ] / Proc. ICC'99
5 A Scarce-State-Transition Viterbi Decoder VLSI for Bit Error Correction /
[ T.Ishitaniet(et al.) ] / IEEE Journal of Solid State Circuits
6 On the Maximum Path Metric Difference in Viterbi Decoders of Punctured Rate (n-1)/n Codes /
[ M.Alston;P.Chau ] / Proc. ISCAS
7 Hybrid Survivor Path Architectures for Viterbi Decoders /
[ P.Black;T.Meng ] / Proc. ICASSP-93
8 Memory Management in Traceback Viterbi Decoders /
[ O.Collins;F.Pollara ] / The JPL Progress Report
9 /
[ U.S.Patent ] / Patent Number 4802174
10 High-rate Punctured Convolutional Codes for Soft Decision Viterbi Decoding /
[ Y.Yasuda;K.Kashiki;Y.Hirata ] / IEEE Trans. on Commun.   DOI
11 /
[ U.S.Patent ] / Patent Number 5050191
12 /
[ A.Netravali;B.Haskell ] / Digital Picture Representation and Compression
13 Memory Management in a Viterbi Decoder /
[ C.Rader ] / IEEE Trans. on Commun.   DOI
14 비동기식 IMT-2000의 채널 부호화 /
[ 이문호 ] / 한국통신학회 학회지
15 Convolution Codes Ⅱ: Maximum Likelihood Decoding /
[ G.Forney ] / IEEE Trans. on Info. Theory
16 Area-Efficient VLSI Architecture for the Traceback Viterbi Decoder Supporting Punctured Codes /
[ S.Kim;S.Y.Hwang ] / Electronics Letters   DOI   ScienceOn