Saved in:
Bibliographic Details
Main Authors: Yang, Sheng, Combes, Richard
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2407.16242
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917730917023744
author Yang, Sheng
Combes, Richard
author_facet Yang, Sheng
Combes, Richard
contents In this work, we investigate the capacity of multi-antenna fading channels with 1-bit quantized output per receive antenna. Specifically, leveraging Bayesian statistical tools, we analyze the asymptotic regime with a large number of receive antennas. In the coherent case, where the channel state information (CSI) is known at the receiver's side, we completely characterize the asymptotic capacity and provide the exact scaling in the extreme regimes of signal-to-noise ratio (SNR) and the number of transmit antennas. In the non-coherent case, where the CSI is unknown but remains constant during T symbol periods, we first obtain the exact asymptotic capacity for T<=3. Then, we propose a scheme involving uniform signaling in the covariance space and derive a non-asymptotic lower bound on the capacity for an arbitrary block size T. Furthermore, we propose a genie-aided upper bound where the channel is revealed to the receiver. We show that the upper and lower bounds coincide when T is large. In the low SNR regime, we derive the asymptotic capacity up to a vanishing term, which, remarkably, matches our capacity lower bound.
format Preprint
id arxiv_https___arxiv_org_abs_2407_16242
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Asymptotic Capacity of 1-Bit MIMO Fading Channels
Yang, Sheng
Combes, Richard
Information Theory
In this work, we investigate the capacity of multi-antenna fading channels with 1-bit quantized output per receive antenna. Specifically, leveraging Bayesian statistical tools, we analyze the asymptotic regime with a large number of receive antennas. In the coherent case, where the channel state information (CSI) is known at the receiver's side, we completely characterize the asymptotic capacity and provide the exact scaling in the extreme regimes of signal-to-noise ratio (SNR) and the number of transmit antennas. In the non-coherent case, where the CSI is unknown but remains constant during T symbol periods, we first obtain the exact asymptotic capacity for T<=3. Then, we propose a scheme involving uniform signaling in the covariance space and derive a non-asymptotic lower bound on the capacity for an arbitrary block size T. Furthermore, we propose a genie-aided upper bound where the channel is revealed to the receiver. We show that the upper and lower bounds coincide when T is large. In the low SNR regime, we derive the asymptotic capacity up to a vanishing term, which, remarkably, matches our capacity lower bound.
title Asymptotic Capacity of 1-Bit MIMO Fading Channels
topic Information Theory
url https://arxiv.org/abs/2407.16242