DocumentCode
2021320
Title
Markov Capacity of Continuous Phase Modulations
Author
Barbieri, A. ; Cero, A. ; Piemontese, A. ; Colavolpe, G.
Author_Institution
Dipt. di Ing. dell´Inf., Univ. di Parma, Parma
fYear
2007
fDate
24-29 June 2007
Firstpage
161
Lastpage
165
Abstract
We propose a novel iterative method, similar to the generalized Blahut-Arimoto algorithm recently proposed by Kavcic, to evaluate the Markov capacity of a continuous phase modulated signal over an additive white Gaussian noise channel. One of the novelty of our approach is that we maximize, with respect to the input distribution, the spectral efficiency in bps/Hz rather than the mutual information in bits per channel use. We address this problem by taking into account the bandwidth occupancy of the CPM signal by means of the Carson´s rule bandwidth definition, and solving a linearly constrained nonlinear optimization problem. The results show that Markov capacity obtained with the proposed input optimization algorithm strongly outperforms the capacity for independent and uniformly distributed input.
Keywords
AWGN channels; Markov processes; continuous phase modulation; iterative methods; nonlinear programming; Carson rule bandwidth definition; Markov capacity; additive white Gaussian noise channel; bandwidth occupancy; continuous phase modulated signal; continuous phase modulation; generalized Blahut-Arimoto algorithm; input optimization algorithm; iterative method; linearly constrained nonlinear optimization problem; mutual information; AWGN; Additive white noise; Bandwidth; Bit rate; Continuous phase modulation; Information rates; Iterative algorithms; Iterative methods; Mutual information; Phase modulation;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location
Nice
Print_ISBN
978-1-4244-1397-3
Type
conf
DOI
10.1109/ISIT.2007.4557220
Filename
4557220
Link To Document