Capacity of the Discrete-Time AWGN Channel Under Output Quantization
| dc.creator | Singh, Jaspreet | |
| dc.creator | Dabeer, Onkar | |
| dc.creator | Madhow, Upamanyu | |
| dc.date | 2008-01-08 | |
| dc.date | 2008-05-15 | |
| dc.date.accessioned | 2026-07-07T09:38:41Z | |
| dc.date.available | 2026-07-07T09:38:41Z | |
| dc.description | We investigate the limits of communication over the discrete-time Additive White Gaussian Noise (AWGN) channel, when the channel output is quantized using a small number of bits. We first provide a proof of our recent conjecture on the optimality of a discrete input distribution in this scenario. Specifically, we show that for any given output quantizer choice with K quantization bins (i.e., a precision of log2 K bits), the input distribution, under an average power constraint, need not have any more than K + 1 mass points to achieve the channel capacity. The cutting-plane algorithm is employed to compute this capacity and to generate optimum input distributions. Numerical optimization over the choice of the quantizer is then performed (for 2-bit and 3-bit symmetric quantization), and the results we obtain show that the loss due to low-precision output quantization, which is small at low signal-to-noise ratio (SNR) as expected, can be quite acceptable even for moderate to high SNR values. For example, at SNRs up to 20 dB, 2-3 bit quantization achieves 80-90% of the capacity achievable using infinite-precision quantization. | |
| dc.description | To appear at ISIT 2008. (Some changes in the content (in Section IV) compared to the first version uploaded on Jan 08, 2008.) | |
| dc.identifier | https://arxiv.org/abs/0801.1185 | |
| dc.identifier | http://arxiv.org/abs/0801.1185 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/160897 | |
| dc.subject | Information Theory | |
| dc.title | Capacity of the Discrete-Time AWGN Channel Under Output Quantization | |
| dc.type | text |