Full metadata record
DC FieldValueLanguage
dc.contributor.authorHuang, Tina D. -H.en_US
dc.contributor.authorChang, Chi-Yuanen_US
dc.contributor.authorZheng, Yan-Xiuen_US
dc.contributor.authorSu, Yu T.en_US
dc.date.accessioned2014-12-08T15:16:06Z-
dc.date.available2014-12-08T15:16:06Z-
dc.date.issued2007en_US
dc.identifier.isbn978-1-4244-0658-6en_US
dc.identifier.issn1525-3511en_US
dc.identifier.urihttp://hdl.handle.net/11536/11945-
dc.identifier.urihttp://dx.doi.org/10.1109/WCNC.2007.23en_US
dc.description.abstractWe study the decoding of product codes and a class of parallel concatenated product codes (PCP/). PCPC improves the minimum distance while retaining the merit of low decoding complexity of turbo product codes (TPC). We prove that using the Fibonacci interleaver does help increasing the minimum distance. The regularity of the interleaver also reduces the implementation complexity and makes parallel interleaving feasible. We show that Pyndiah's algorithm for decoding product codes produce an annealing effect similar to that of the so-called annealed belief propagation (ABP) algorithms which adjusts the "temperature" of an augmented cost surface. Decoding methods based on modified Pyndiah and annealed BCJR algorithms for both PC and PCPC are proposed and their performance is compared.en_US
dc.language.isoen_USen_US
dc.titleProduct codes and parallel concatenated product codesen_US
dc.typeProceedings Paperen_US
dc.identifier.doi10.1109/WCNC.2007.23en_US
dc.identifier.journal2007 IEEE WIRELESS COMMUNICATIONS & NETWORKING CONFERENCE, VOLS 1-9en_US
dc.citation.spage94en_US
dc.citation.epage99en_US
dc.contributor.department電信工程研究所zh_TW
dc.contributor.departmentInstitute of Communications Engineeringen_US
dc.identifier.wosnumberWOS:000252337100018-
Appears in Collections:Conferences Paper


Files in This Item:

  1. 000252337100018.pdf