DocumentCode
2029869
Title
Tail-Biting LDPC Convolutional Codes
Author
Tavares, M.B.S. ; Zigangirov, K.Sh. ; Fettweis, G.P.
Author_Institution
Tech. Univ. Dresden, Dresden
fYear
2007
fDate
24-29 June 2007
Firstpage
2341
Lastpage
2345
Abstract
In this paper, the tail-biting version of the low-density parity-check convolutional codes (LDPCCCs) is introduced and investigated. The definition of the tail-biting LDPCCCs (TB-LDPCCCs) is given through their parity-check matrices and the basic ideas behind the architectures of the encoders and decoders for these codes are also presented. In addition, the asymptotical lower bound for the minimum distance of these codes and simulation results are shown.
Keywords
convolutional codes; decoding; encoding; matrix algebra; parity check codes; decoder architectures; encoder architectures; parity-check matrices; tail-biting low-density parity-check convolutional codes; Block codes; Convolutional codes; Decoding; Equations; Parity check codes; Pipelines; Turbo codes; Wrapping;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location
Nice
Print_ISBN
978-1-4244-1397-3
Type
conf
DOI
10.1109/ISIT.2007.4557569
Filename
4557569
Link To Document