期刊文献+

Double-Space-Cooperation Method for Increasing Channel Capacity

Double-Space-Cooperation Method for Increasing Channel Capacity
下载PDF
导出
摘要 Shannon channel capacity theorem poses highest bit-rate of error free transmission over additive white Gaussian noise channel.In addition,he proved that there exists channel code that can theoretically achieve the channel capacity.Indeed fortunately,the latter researchers found some practical channel codes approaching the channel capacity with insignificant losses of spectral efficiency under ignorable bit error rate(BER).The authors note,in general,that bits of the channel codes are not independent of each other in code space.Further,we note that the modulated symbols are not independent among them,as well,in Euclidean Space.By exploiting a usage of the dependencies jointly to signal design,we can transmit two independent signal streams through an additive white Gaussian channel and separate them in Euclidean space at the receiver.The capacity of this approach is found larger than that of Shannon capacity in the same channel assumptions.The numerical results confirm the theoretical procedures. Shannon channel capacity theorem poses highest bit-rate of error free transmission over additive white Gaussian noise channel.In addition,he proved that there exists channel code that can theoretically achieve the channel capacity.Indeed fortunately,the latter researchers found some practical channel codes approaching the channel capacity with insignificant losses of spectral efficiency under ignorable bit error rate(BER).The authors note,in general,that bits of the channel codes are not independent of each other in code space.Further,we note that the modulated symbols are not independent among them,as well,in Euclidean Space.By exploiting a usage of the dependencies jointly to signal design,we can transmit two independent signal streams through an additive white Gaussian channel and separate them in Euclidean space at the receiver.The capacity of this approach is found larger than that of Shannon capacity in the same channel assumptions.The numerical results confirm the theoretical procedures.
出处 《China Communications》 SCIE CSCD 2015年第12期76-83,共8页 中国通信(英文版)
基金 supported by two Programs of National Natural Science Foundation of China(No.61271203 and No.61531004)
关键词 Euclidean transmit receiver symbol parity latter separate coded additive losses 信道容量 欧氏空间 协同方法 加性高斯白噪声信道 误比特率 香农定理 信道编码 频谱效率
  • 相关文献

参考文献10

  • 1C. E. Shannon, "A mathematical Theory of Com- munication," Bell System Technical Journal, Vol- ume: 27, 1948.
  • 2R.G.Gallager. "Low-Density Parity-Check code". IRE Transactions on Information Theory, 1962, 8(1):21-28.
  • 3D. J. C. MacKay, R. M. Neal, "Near Shannon limit performance of low-density parity-check codes". IEEE Electronic Letters, Aug. 1996.8.29, 32(18): 1645-1646.
  • 4Sae-Young Chung, G. D. Forney Jr., T. J. Richard- son, R. L. Urbanke, "On the design of low-den- sity parity-check codes within 0.0045 dB of the Shannon limit". IEEE Commun. Lett., Feb. 2001.2, 5(2): 58-60.
  • 5H.Yagi, H. V. Poor, "Bounds on Maximum Likeli- hood Decoding Performance for Linear Codes at Low Rate" Information Theory, IEEE Transac- tions on, Year:2013, Volume:59, Issue:7, Pages: 4482-4497.
  • 6G. Ungerboeck and I. Csajka, "On improving data-link performance by increasing channel alphabet and introducing sequence coding," in Proc. IEEE Int. Syrup. Inf. Theory, June 1976.
  • 7G. J. Pottle and D. P. Taylor, "Multilevel codes based on partitioning," IEEE Trans. Inf. Theory, vol. 35, pp. 87-98, Jan. 1989.
  • 8J. Huber and U. Wachsmann, "Capacities of equivalent channels in multilevel coding schemes," IEEE Electron. Lett., vol. 30, pp. 557- 558, Mar. 1994.
  • 9G. Gul, ; Aharon Vargas, ; W.H. Gerstacker, ; M. Breiling, "Low Complexity Demapping Algo- rithms for Multilevel Codes", Communications, IEEE Transactions on, Volume: 59, Issue: 4 ,Year: 2011 , Page(s): 998 - 1008.
  • 10Helmut Nickl, Joachim Hagenauer, Frank Burk- eft, "Approaching Sgannon's Capacity Limit by 0.27dB using Simple Hamming Codes", IEEE Comm Letters, vol.1, no. S, 1997.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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