Coherent Continuous-Phase Frequency-Shift Keying: Parameter Optimization and Code Design

被引:12
作者
Cheng, Shi [1 ]
Valenti, Matthew C. [2 ]
Torrieri, Don [3 ]
机构
[1] ArrayComm LLC, San Jose, CA USA
[2] W Virginia Univ, Lane Dept Comp Sci & Elect Engn, Morgantown, WV 26506 USA
[3] USA, Res Lab, Adelphi, MD USA
关键词
Continuous-phase modulation; CPM; Capacity; Channel coding; PARITY-CHECK CODES; INFORMATION RATES; LINEAR CODES; MODULATION; PERFORMANCE;
D O I
10.1109/TWC.2009.071311
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The symmetric information rate of a modulation-constrained transmission system is the information-theoretic limit on performance under the assumption that the inputs are independent and uniformly distributed. The symmetric information rate for continuous-phase frequency-shift keying (CPFSK) over an AWGN channel may be estimated by considering the system to be a finite-state Markov channel and executing a BCJR-like algorithm. In this paper, the estimated symmetric information rate is used along with the exact expression for the 99% power bandwidth to determine the information-theoretic tradeoff between energy and spectral efficiency for CPFSK modulation. Using this tradeoff, the code rate and modulation index are jointly optimized for a particular spectral efficiency and alphabet size. Codes are then designed for the optimized system. The codes are comprised of variable nodes (which represent irregular repetition codes), check nodes (which represent single parity-check codes), and an interleaver connecting the variable and check nodes. The degree distributions of the code are optimized from the system's EXIT chart by using linear programming. Additional details of the code design, including labeling and interleaver design, are also discussed. Simulation results show that the optimized coded systems achieve bit error rates within 0.4 dB of the information-theoretic limits at BER = 10(-5).
引用
收藏
页码:1792 / 1802
页数:11
相关论文
共 31 条
  • [1] Anderson J. B., 1986, Digital Phase Modulation
  • [2] A more accurate one-dimensional analysis and' design of irregular LDPC codes
    Ardakani, M
    Kschischang, FR
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2004, 52 (12) : 2106 - 2114
  • [3] Simulation-based computation of information rates for channels with memory
    Arnold, Dieter M.
    Loeliger, Hans-Andrea
    Vontobel, Pascal I.
    Kavcic, Aleksandar
    Zeng, Wei
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (08) : 3498 - 3508
  • [4] OPTIMAL DECODING OF LINEAR CODES FOR MINIMIZING SYMBOL ERROR RATE
    BAHL, LR
    COCKE, J
    JELINEK, F
    RAVIV, J
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (02) : 284 - 287
  • [5] A Soft-Input Soft-Output APP Module for Iterative Decoding of Concatenated Codes
    Benedetto, S.
    Divsalar, D.
    Montorsi, G.
    Pollara, F.
    [J]. IEEE COMMUNICATIONS LETTERS, 1997, 1 (01) : 22 - 24
  • [6] Benedetto S, 2007, 2007 INFORMATION THEORY AND APPLICATIONS WORKSHOP, P34
  • [7] Cheng S., 2007, P C INF SCI SYST CIS
  • [8] On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
    Chung, SY
    Forney, GD
    Richardson, TJ
    Urbanke, R
    [J]. IEEE COMMUNICATIONS LETTERS, 2001, 5 (02) : 58 - 60
  • [9] GANESAN A, 2003, THESIS TEXAS A M U C
  • [10] Approaching Shannon performance by iterative decoding of linear codes with low-density generator matrix
    Garcia-Frias, J
    Zhong, W
    [J]. IEEE COMMUNICATIONS LETTERS, 2003, 7 (06) : 266 - 268