IEICE TRANSACTIONS on Fundamentals
A Trace-Back Method with Source States for Viterbi Decoding of Rate-1/n Convolutional Codes
Summary :
The Viterbi algorithm is widely used for decoding of the convolutional codes. The trace-back method is preferable to the register exchange method because of lower power consumption especially for convolutional codes with many states. A drawback of the conventional trace-back is that it generally requires long latency to obtain the decoded data. In this paper, a method of the trace-back with source states instead of decision bits is proposed which reduces the number of memory accesses. The dedicated memory is also presented which supports the proposed trace-back method. The reduced memory accesses result in smaller power consumption and a shorer decode latency than the conventional method.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E95-A No.4 pp.767-775
- Publication Date
- 2012/04/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E95.A.767
- Type of Manuscript
- PAPER
- Category
- VLSI Design Technology and CAD
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kazuhito ITO, "A Trace-Back Method with Source States for Viterbi Decoding of Rate-1/n Convolutional Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E95-A, no. 4, pp. 767-775, April 2012, doi: 10.1587/transfun.E95.A.767.
Abstract: The Viterbi algorithm is widely used for decoding of the convolutional codes. The trace-back method is preferable to the register exchange method because of lower power consumption especially for convolutional codes with many states. A drawback of the conventional trace-back is that it generally requires long latency to obtain the decoded data. In this paper, a method of the trace-back with source states instead of decision bits is proposed which reduces the number of memory accesses. The dedicated memory is also presented which supports the proposed trace-back method. The reduced memory accesses result in smaller power consumption and a shorer decode latency than the conventional method.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E95.A.767/_p
Copy
@ARTICLE{e95-a_4_767,
author={Kazuhito ITO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Trace-Back Method with Source States for Viterbi Decoding of Rate-1/n Convolutional Codes},
year={2012},
volume={E95-A},
number={4},
pages={767-775},
abstract={The Viterbi algorithm is widely used for decoding of the convolutional codes. The trace-back method is preferable to the register exchange method because of lower power consumption especially for convolutional codes with many states. A drawback of the conventional trace-back is that it generally requires long latency to obtain the decoded data. In this paper, a method of the trace-back with source states instead of decision bits is proposed which reduces the number of memory accesses. The dedicated memory is also presented which supports the proposed trace-back method. The reduced memory accesses result in smaller power consumption and a shorer decode latency than the conventional method.},
keywords={},
doi={10.1587/transfun.E95.A.767},
ISSN={1745-1337},
month={April},}
Copy
TY - JOUR
TI - A Trace-Back Method with Source States for Viterbi Decoding of Rate-1/n Convolutional Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 767
EP - 775
AU - Kazuhito ITO
PY - 2012
DO - 10.1587/transfun.E95.A.767
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E95-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2012
AB - The Viterbi algorithm is widely used for decoding of the convolutional codes. The trace-back method is preferable to the register exchange method because of lower power consumption especially for convolutional codes with many states. A drawback of the conventional trace-back is that it generally requires long latency to obtain the decoded data. In this paper, a method of the trace-back with source states instead of decision bits is proposed which reduces the number of memory accesses. The dedicated memory is also presented which supports the proposed trace-back method. The reduced memory accesses result in smaller power consumption and a shorer decode latency than the conventional method.
ER -
English
