首页 | 本学科首页   官方微博 | 高级检索  
     


Upper bound on the minimum distance of turbo codes
Authors:Breiling  M Huber  JB
Affiliation:Lehrstuhl fur Nachrichtentech. II, Erlangen-Nurnberg Univ.;
Abstract:An upper bound on the minimum distance of turbo codes is derived, which depends only on the interleaver length and the component scramblers employed. The derivation of this bound considers exclusively turbo encoder input words of weight 2. The bound does not only hold for a particular interleaver but for all possible interleavers including the best. It is shown that in contrast to general linear binary codes the minimum distance of turbo codes cannot grow stronger than the square root of the block length. This implies that turbo codes are asymptotically bad. A rigorous proof for the bound is provided, which is based on a geometric approach
Keywords:
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号