• DocumentCode
    2521835
  • Title

    Tight upper and lower bounds on the constrained capacity of non-coherent multi-antenna channels

  • Author

    Padmanabhan, Krishnan ; Venkatraman, Sundeep ; Collins, Oliver M.

  • Author_Institution
    Dept. of Electr. Eng., Univ. of Notre Dame, Notre Dame, IN
  • fYear
    2008
  • fDate
    6-11 July 2008
  • Firstpage
    2588
  • Lastpage
    2592
  • Abstract
    This paper first presents an optimal receiver and coding scheme for a multi-user, multi-receiver, non-coherent Rayleigh flat fading channel which achieves the channel´s constrained capacity (i.e., the capacity for a fixed input distribution). The paper then goes on to analyze the optimal receiver and uses it to generate tight upper and lower bounds on the constrained capacity. Knowing this constrained capacity is essential to judge the efficiency of coding schemes for the channel; it performs the same function as BPSK capacity for the AWGN channel in judging LDPC codes. The paper then goes on to present a practicable correlation based receiver that uses a novel iterative channel estimation technique. The performance of this receiver remains close to the constrained capacity as long as the per-user SNR is low; there is no requirement on the aggregate SNR. With 50 users, 50 receivers and a brickwall fading channel with a coherence length of 200 symbols, for example, the correlation based receiver achieves a sum rate of 36 bits/sec/Hz, significantly greater than any current cellular standards.
  • Keywords
    AWGN channels; Rayleigh channels; channel capacity; channel coding; channel estimation; iterative methods; parity check codes; radio receivers; AWGN channel; BPSK capacity; LDPC codes; brickwall fading channel; channel coding scheme; channel constrained capacity; iterative channel estimation technique; noncoherent Rayleigh flat fading channel; noncoherent multi-antenna channels; optimal receiver; AWGN channels; Aggregates; Binary phase shift keying; Channel capacity; Channel estimation; Decoding; Fading; Parity check codes; Transmitters; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2008. ISIT 2008. IEEE International Symposium on
  • Conference_Location
    Toronto, ON
  • Print_ISBN
    978-1-4244-2256-2
  • Electronic_ISBN
    978-1-4244-2257-9
  • Type

    conf

  • DOI
    10.1109/ISIT.2008.4595459
  • Filename
    4595459