|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b11. 会議発表論文・発表資料等 >
b11-1. 会議発表論文・発表資料 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/10531
|
| タイトル: | Serially Concatenated Joint Source-Channel Coding for Binary Markov Sources |
| 著者: | Zhou, Xiaobo
Anwar, Khoirul
Matsumoto, Tad |
| キーワード: | Joint source channel coding
EXIT chart
Binary Markov Source
BCJR Algorithm |
| 発行日: | 2011-08-17 |
| 出版者: | Institute of Electrical and Electronics Engineers (IEEE) |
| 誌名: | 2011 6th International ICST Conference on Communications and Networking in China (CHINACOM) |
| 開始ページ: | 53 |
| 終了ページ: | 60 |
| DOI: | 10.1109/ChinaCom.2011.6158119 |
| 抄録: | In this paper, we propose a joint design of serially concatenated source channel coding for binary Markov sources over AWGN channels. To exploit the memory structure inherent within the sequence output from the source, modifications are made on the BCJR algorithm. To decode the outer code, the modified version of the BCJR algorithm is used, while the inner code by the standard version of the algorithm. Since optimal design of serially concatenated convolutional code falls into the problem of curve matching between the extrinsic information transfer (EXIT) curves of the inner and outer codes, we first evaluate the EXIT curve of the outer code decoded by the modified BCJR algorithm. It is then shown that the EXIT curve obtained by the modified BCJR algorithm is better matched with short memory inner convolutional code, which significantly reduces coding/decoding complexity. Numerical results demonstrate significant gains over the systems in which source statistics are not exploited (i.e., the standard BCJR algorithm is used for the both codes), and thereby narrowing the performance gap to the Shannon limit. We also compare in this paper the performance of the proposed design with the algorithm presented in [1], designed also for transmission of binary Markov source using parallel concatenated convolutional code (the authors of Ref.[1] refer the technique as Joint Source Channel Turbo Code(JSCTC)). It is shown that our proposed system is superior in both system complexity and BER performance to the JSCTC technique presented in [1]. |
| Rights: | This is the author's version of the work. Copyright (C) 2011 IEEE. 2011 6th International ICST Conference on Communications and Networking in China (CHINACOM), 2011, 53-60. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. |
| URI: | http://hdl.handle.net/10119/10531 |
| 資料タイプ: | author |
| 出現コレクション: | b11-1. 会議発表論文・発表資料 (Conference Papers)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 16808.pdf | | 168Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
