| 新型的近仙农理论极限码:之型码和级联之型码 |
| |
| 引用本文： | 邓家梅,王喆,李明,李坪.新型的近仙农理论极限码:之型码和级联之型码[J].上海大学学报(英文版),2002,6(1):64-67. |
| |
| 作者姓名： | 邓家梅 王喆 李明 李坪 |
| |
| 作者单位： | [1]SchoolofElectromechanicalEngineeringandAutomation,ShanghaiUniversity,Shanghai200072,China [2]DeparementofElectricalEngineering,CityUniversityofHongKong,HongKong,China |
| |
| 基金项目： | ProjectsupportedbytheYouthScienceFoundationofShanghai
MunicipalCommissionofEducation( 2 0 0QN71)andtheScience
FoundationofShanghaiMunicipalCommissionofScienceand
Technology( 99XD14 0 0 1) |
| |
| 摘 要： | This paper introduces a family of error-correcting codes called zigzag codes.A zigzag code is described by a highly structured zigzag graph.Due to the structureal properties of the graph,very low-complexity soft-in,soft-out decoding rules can be implemented.we present a decoding rule,absed on the Max-Log-APP(MLA) formulation,which requires a total of only 20 addition-equivalent-operations per information bit per iteration.Simulation of a rate-1/2 concatenated zigzag code with four constitutent encoders with interlezer length 65536 yields a bit error rate(BER) and of 10^-5 at 0.9 dB and 1.4dB away from the Shannon limit by optimal (APP) and low-cost sub-optimal(MLA) decoders,respectively.
|
| 关 键 词： | 编码 Z字形码 串联Z字形码 涡轮码 |
| 收稿时间： | 1 March 2001 |
New near shannon limit codes: Zigzag codes and concatenated zigzag codes |
| |
| Jia-Mei Deng Ph. D.,Zhe Wang,Ming Li,Jia-Lin Cao,Ping Li.New near shannon limit codes: Zigzag codes and concatenated zigzag codes[J].Journal of Shanghai University(English Edition),2002,6(1):64-67. |
| |
| Authors: | Jia-Mei Deng Ph D Zhe Wang Ming Li Jia-Lin Cao Ping Li |
| |
| Institution: | 1. School of Electromechanical Engineering and Automation, Shanghai University, Shanghai 200072, China
2. Deparement of Electrical Engineering, City University of Hong Kong, Hong Kong, China |
| |
| Abstract: | This paper introduces a family of error correcting codes called zigzag codes. A zigzag code is described by a highly structured zigzag graph. Due to the structural properties of the graph, very low complexity soft in, soft out decoding rules can be implemented. We present a decoding rule, based on the Max Log APP(MLA) formulation, which requires a total of only 20 addition equivalent operations per information bit per iteration. Simulation of a rate 1/2 concatenated zigzag code with four constituent encoders with interleaver length 65536 yields a bit error rate (BER) and of 10 5 at 0.9 dB and 1.4 dB away from the Shannon limit by optimal (APP) and low cost sub optimal (MLA) decoders, respectively. |
| |
| Keywords: | Turbo codes zigzag codes low complexity decoding |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
|
