完整後設資料紀錄
DC 欄位語言
dc.contributor.authorYan-Xiu, Zhengen_US
dc.contributor.authorSu, Yu T.en_US
dc.date.accessioned2014-12-08T15:15:20Z-
dc.date.available2014-12-08T15:15:20Z-
dc.date.issued2007en_US
dc.identifier.isbn978-1-4244-1397-3en_US
dc.identifier.urihttp://hdl.handle.net/11536/11501-
dc.identifier.urihttp://dx.doi.org/10.1109/ISIT.2007.4557300en_US
dc.description.abstractThis paper presents an achievable codeword weight lower bound associated with weight-2 input sequences of a class of turbo codes. The class of codes has an interleaver structure that encompasses most practical interleavers used by turbo codes. It partitions the incoming information sequence into blocks of the same size and the interleaver performs intra-block and inter-block permutations. Both pre- and post-permuted blocks are individually tail-biting encoded. Following [4], we refer to the codeword associated with a weight-2 input sequence as a weight-2 error event We apply a special permutation function that incorporates the separate encoding concept to derive a lower bound of the weight-2 error event. This lower bound reveals that (i) a larger component code period gives better distance for the weight-2 error events, and (ii) separate encoding results in improved distance if the block length is suitably chosen and is large enough.en_US
dc.language.isoen_USen_US
dc.titleA codeword weight lower bound for a class of tail-biting turbo codesen_US
dc.typeProceedings Paperen_US
dc.identifier.doi10.1109/ISIT.2007.4557300en_US
dc.identifier.journal2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7en_US
dc.citation.spage661en_US
dc.citation.epage665en_US
dc.contributor.department電信工程研究所zh_TW
dc.contributor.departmentInstitute of Communications Engineeringen_US
dc.identifier.wosnumberWOS:000257010200133-
顯示於類別:會議論文


文件中的檔案:

  1. 000257010200133.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。