Capacity of Second-Order cyclostationary Gaussian noise channels
SCIE
SCOPUS
- Title
- Capacity of Second-Order cyclostationary Gaussian noise channels
- Authors
- Byung Wook Han; Cho, JH
- Date Issued
- 2012-01
- Publisher
- IEEE
- Abstract
- In this paper, we derive the capacity of a continuous-time, single-input single-output (SISO), frequency-selective, band-limited, linear time-invariant (LTI) channel, whose output is corrupted by a second-order cyclostationary (SOCS) complex Gaussian noise. By using a pair of invertible, linear-conjugate linear time-varying operators called a properizing FREquency SHift (p-FRESH) vectorizer and a p-FRESH scalarizer, it is shown that, whether the complex noise is proper or improper, the SISO channel can always be converted to an equivalent multiple-input multiple-output (MIMO) LTI channel whose output is now corrupted by a proper-complex vector wide-sense stationary noise. A variational problem is then formulated in the frequency domain to find the optimal input distribution that maximizes the throughput of the equivalent MIMO channel. It turns out that the optimal input to the SISO channel, obtained through a procedure similar to the water filling, is an SOCS complex Gaussian random process with the same cycle period as the noise. It is shown that this procedure, named cyclic water filling, significantly outperforms ordinary water filling by effectively utilizing the spectral correlation of the cyclostationary noise.
- Keywords
- Channel capacity; cyclostationarity; multi-input multi-output channel; water filling; RECEIVER OPTIMIZATION; INFORMATION-THEORY; JOINT TRANSMITTER; SIGNALS; TRANSMISSION; STATISTICS; MODULATION; OVERLAY; DESIGN
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/15881
- DOI
- 10.1109/TCOMM.2011.110711.100414
- ISSN
- 0090-6778
- Article Type
- Article
- Citation
- IEEE TRANSACTIONS ON COMMUNICATIONS, vol. 1, no. 1, page. 89 - 100, 2012-01
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.