Asymptotic Distance and Convergence Analysis of Braided Protograph Convolutional Codes

Summary, in English

We analyze a class of LDPC convolutional codes that are constructed from tightly braided convolutional base codes by a lifting procedure. For these braided protograph convolutional codes, we show that the distances grow linearly with the constraint length, and we present lower bounds on their asymptotic segment distance and free distance as well as on the asymptotic minimum distance of their tail-biting versions. With some constraints imposed on the lifting permutations, braided protograph convolutional codes can also be decoded as turbo-like codes by iterative application of the BCJR algorithm. For this case, we derive an explicit upper-bound on the asymptotic decoding error probability as a function of the number of iterations.

• Författare: Marcos B.S. Tavares; Michael Lentmaier; Gerhard Fettweis; Kamil Zigangirov
• Avdelning/ar: Institutionen för elektro- och informationsteknik
• Publiceringsår: 2008
• Språk: Engelska
• Sidor: 1073-1080
• Publikation/Tidskrift/Serie: [Host publication title missing]
• Fulltext: - 471 kB; Download statistics
• Länkar: http://dx.doi.org/10.1109/ALLERTON.2008.4797678
• Dokumenttyp: Konferensbidrag
• Förlag: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Ämne: Electrical Engineering, Electronic Engineering, Information Engineering
• Nyckelord: braided codes; braided convolutional codes; spatial coupling
• Conference name: Annual Allerton Conference on Communication, Control and Computing (Allerton), 2008
• Conference date: 2008-09-23 - 2008-09-26
• Conference place: Monticello, IL, United States
• Status: Published
• Forskningsgrupp: Telecommunication Theory
• ISBN/ISSN/Övrigt: ISBN: 978-1-4244-2925-7