期刊文献+

一种改进的打孔方法及其DSP实现

Improved Puncture Method and Its Implementation Based on DSP
下载PDF
导出
摘要 在信道编码中,由于无线物理信道和传输信道之间存在速率差,故需要对输入数据比特进行打孔操作。传统的打孔操作是通过查询不同的打孔表来进行,并且一种打孔方式需开辟一张表,而开辟多张表格的做法对系统的内存消耗将非常大。通过分析其打孔特点,提出一种新的打孔方法和新的打孔码表,能有效地提高计算效率并减小系统内存消耗。并对其进行了DSP工程实现,对其他模式下的打孔操作具有一定指导意义。 In channel coding, the input data bits need puncture operations because of the rate difference between the wireless physical channels and transport channels. Traditional puncture operations is carried out through querying different puncturing table, and different puncture type needs different puncturing table. In order to store these tables the system needs a large of memory consumption. Through the analysis of the puncture characteristics, a new method of puncture and a new puncturing table which can effectively improve the computational efficiency and reduce memory consumption are pro- posed. And the DSP implementation has a certain guiding significance to other mode's puncture operations.
出处 《电视技术》 北大核心 2014年第5期54-57,共4页 Video Engineering
基金 国家新一代宽带无线移动通信网科技重大专项(2012ZX03001-012)
关键词 编码 打孔 DSP coding puncture DSP
  • 相关文献

参考文献6

  • 1崔雁松.移动通信技术[M].西安:西安电子科技大学出版社,2012.
  • 2臧岚,陈紫强.一种基于贪婪搜索的码率兼容LDPC码打孔算法[J].电视技术,2013,37(13):105-108. 被引量:1
  • 33GPP TS 45. 001, Physical layer on the radio path; General description ( Release 5 ) [ S ]. 2005.
  • 43GPP TS 45. 002, Multiplexing and multiple access on the radio path (l~e- lease 5 ) [ S ]. 2005.
  • 53GPP "IS 45. 003, Channel coding( Release 5 ) [ S ]. 2006.
  • 6ZSPSO0 digital signal processor core technical manual [ EB/OL]. [ 2013- 05 - 20 ]. http ://www. verisilican, com/IPPorffolio _ cn _ 13 _ 50 _ 2 _ ZSP800. html .

二级参考文献9

  • 1HA J, MCLAUGHLIN S W. Optimal puncturing distributions for rate compatible low- density parity- check codes[ C]//Proc. IEEE Interna- tional Symposium on Information Theory. Yokohama,Japan:IEEE Press, 2003 233.
  • 2BEERMANN M, BREDDERMANN T, VARY P. Rate- compatible LD- PC codes using optimized dummy bit insertion [ C ]//Proc. International Symposium on Wireless Communication Systems (ISWCS). Aachen, Germany: IEEE Press ,2011:44-7-4-51.
  • 3SAEEDI H,PISHRO-NIK H,BANIHASHEMI A H. Successive maximi- zation for systematic design of universally capacity approaching rate-com- patible sequences of LDPC code ensembles over binary-input output- symmetric memoryless channels [ J ]. IEEE Trans. Communications, 2011,59(7) :1807-1819.
  • 4HA J, KIM J, KLINC D, et al. Rate-compatible punctured low-density parity-check codes with short block lengths [ J ]. IEEE Trans. Informa- tion Theory,2006,52(2) :728-738.
  • 5VELLAMBI B N,FEKRI F. Finite-length rate-compatible LDPC codes: a novel puncturing scheme[ J]. IEEE Trans. Communications,2009,57 (2) :297-301.
  • 6SI Z W,ANDERSSON M,THOBABEN R,et al. Rate-compatible LDPC convolutional codes for capacity-approaching hybrid ARQ[ C]//Prec. IEEE Information Theory Workshop (ITW). Dublin, Ireland: IEEE Press,2011:513-517.
  • 7PSOTA E, PE REZ L C. Iterative construction of regular LDPC codes from independent tree-based minimum distance bounds[J3. IEEE Com- munications Letters, 15(3 ) :334-336.
  • 8CHUNG S Y,RICHARDSON T,URBANKE R. Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approxima- tion[ J]. IEEE Trans. Information Theory ,2001,47 ( 1 ) :657-670.
  • 9HU X Y,ELEFrI-IERIOU E,ARNOLD D M. Progressive edge-growth Tanner graphs[C]//Proc. Global Telecommunications Conference. San Antonio,TX : IEEE Press,2001:995-1001.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部