About minimum distance for QPP interleavers
Author:
Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering
Link
http://link.springer.com/content/pdf/10.1007/s12243-009-0120-3.pdf
Reference14 articles.
1. Takeshita YO (2007) Permutation polynomial interleavers: an algebraic-geometric perspective. IEEE Trans Inf Theory 32(6):2116–2132
2. Sun J, Takeshita YO (2005) Interleavers for turbo codes using permutation polynomial over integers rings. IEEE Trans Inf Theory 51(1):101–119
3. Takeshita YO (2006) Maximum contention-free interleavers and permutation polynomials over integers rings. IEEE Trans Inf Theory 52(3):1249–1253
4. Ryu J, Takeshita YO (2006) On quadratic inverses for quadratic permutation polynomials over integers rings. IEEE Trans Inf Theory 52(3):1254–1260
5. Crozier S (2000) New High-spread high-distance interleavers for turbo-codes, 20th Biennial Symposium on Communications. Kingston, Ontario, Canada, pp 3–7
Cited by 11 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Some lengths for which CPP interleavers have weaker minimum distances than QPP interleavers;Journal of the Franklin Institute;2020-03
2. Methods to Search Permutation Polynomial Interleavers for Turbo Codes;Permutation Polynomial Interleavers for Turbo Codes;2018-10-02
3. Determining the Number of Permutation Polynomial-Based Interleavers in Terms of Their Length;Permutation Polynomial Interleavers for Turbo Codes;2018-10-02
4. Up to five degree permutation polynomial interleavers for short length LTE turbo codes with optimum minimum distance;2017 International Symposium on Signals, Circuits and Systems (ISSCS);2017-07
5. Determining the number of true different permutation polynomials of degrees up to five by Weng and Dong algorithm;Telecommunication Systems;2017-05-17
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3