DocumentCode
1829601
Title
Versatile graphs for tail-biting convolutional codes
Author
Zahabi, M.R. ; Meghdadi, V. ; Meghdadi, H. ; Cances, J.-P.
Author_Institution
XLIM-Dept., Univ. of Limoges, Limoges
fYear
2008
fDate
18-21 May 2008
Firstpage
216
Lastpage
219
Abstract
A unified method to derive Tanner graph related to tail-biting convolutional codes (CCs) is presented. The graphs obtained by this method have low complexity even for codes with a large number of states. It is shown that under certain conditions, a unique graph can be used for decoding of recursive and non-recursive CCs. Analog realization of such a graph employing MOS transistors is discussed and its circuit-level simulation results are given.
Keywords
MOSFET; computational complexity; convolutional codes; decoding; recursive estimation; MOS transistors; Tanner graph; analog realization; circuit-level simulation; decoding; non-recursive CC; recursive CC; tail-biting convolutional codes; versatile graphs; Analog circuits; Block codes; Carbon capture and storage; Circuit simulation; Convolutional codes; Decoding; Delay; Feedback; Feedforward systems; MOSFETs;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 2008. ISCAS 2008. IEEE International Symposium on
Conference_Location
Seattle, WA
Print_ISBN
978-1-4244-1683-7
Electronic_ISBN
978-1-4244-1684-4
Type
conf
DOI
10.1109/ISCAS.2008.4541393
Filename
4541393
Link To Document