完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Chiu, Mao-Ching | en_US |
dc.contributor.author | Lu, Hsiao-feng (Francis) | en_US |
dc.date.accessioned | 2014-12-08T15:10:06Z | - |
dc.date.available | 2014-12-08T15:10:06Z | - |
dc.date.issued | 2009-02-01 | en_US |
dc.identifier.issn | 0090-6778 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1109/TCOMM.2009.02.060165 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/7713 | - |
dc.description.abstract | A new construction of good, easily encodable, and soft-decodable codes is proposed in this paper. The construction is based on serially concatenating several simple 1+D convolutional codes as the outer code, and a rate-1 1/(1 + D) accumulate code as the inner code. These codes have very low encoding complexity and require only one shift-forward register for each encoding branch. The input-output weight enumerators of these codes are also derived. Divsalar's simple bound technique is applied to analyze the bit error rate performance, and to assess the minimal required signal-to-noise ratio (SNR) for these codes to achieve reliable communication under AWGN channel. Simulation results show that the proposed codes can provide good performance under iterative decoding. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Low-density parity-check (LDPC) codes | en_US |
dc.subject | accumulate codes | en_US |
dc.subject | convolutional codes | en_US |
dc.title | Accumulate Codes Based on 1+D Convolutional Outer Codes | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1109/TCOMM.2009.02.060165 | en_US |
dc.identifier.journal | IEEE TRANSACTIONS ON COMMUNICATIONS | en_US |
dc.citation.volume | 57 | en_US |
dc.citation.issue | 2 | en_US |
dc.citation.spage | 311 | en_US |
dc.citation.epage | 314 | en_US |
dc.contributor.department | 電信工程研究所 | zh_TW |
dc.contributor.department | Institute of Communications Engineering | en_US |
dc.identifier.wosnumber | WOS:000263298200004 | - |
dc.citation.woscount | 0 | - |
顯示於類別: | 期刊論文 |