Oversampling Increases the Pre-Log of Noncoherent Rayleigh Fading Channels

Meik Dörpinghaus, Günther Koliander, Giuseppe Durisi, Erwin Riegler, Heinrich Meyr

TL;DR

This paper shows that by oversampling the received signal in a time-selective Rayleigh fading channel, we can achieve a higher information rate (pre-log) than with standard symbol-rate sampling. This is a significant finding because it demonstrates that a simple, commonly used technique (symbol-rate sampling) is suboptimal for maximizing data throughput in these challenging wireless environments.

What Problem Does This Paper Address?

Wireless communication channels are often affected by fading, where the signal strength fluctuates over time due to the propagation environment. This paper focuses on a specific type of fading called "time-selective Rayleigh block-fading," where the fading characteristics remain relatively constant for a short block of time and then change independently for the next block. Crucially, neither the transmitter nor the receiver knows these fading characteristics in advance (a "noncoherent" setting).

A standard approach to analyze the capacity (maximum achievable data rate) of such channels is to model them as discrete-time systems. This is typically done by filtering the received signal with a matched filter and then sampling it at the symbol rate. While this approach provides a way to calculate the channel's capacity, it has been shown that the resulting capacity pre-log (a measure of how quickly capacity grows with signal strength) is limited. The question this paper addresses is whether this limitation is inherent to the channel itself or if it's an artifact of the chosen discrete-time modeling technique. Specifically, the authors investigate if a different sampling strategy can unlock higher data rates.

Methods

The core of this paper's contribution lies in analyzing the impact of oversampling the continuous-time channel output. Instead of sampling at the symbol rate ($1/T_s$), they sample at twice the symbol rate ($2/T_s$). This oversampling, combined with a specific filtering operation, creates a new discrete-time channel model.

The authors then employ advanced information-theoretic tools to derive a lower bound on the capacity pre-log of this oversampled channel. Their proof technique is inspired by prior work on similar problems but adapted to their specific oversampling scenario. A key aspect of their method involves:

  • Representing the fading process: The time-varying fading channel is modeled using a series expansion, allowing it to be characterized by a set of complex Gaussian random variables.
  • Analyzing the discrete-time channel: The oversampled continuous-time channel is transformed into a discrete-time representation.
  • Capacity Pre-log Calculation: They use a technique that involves bounding the differential entropy of the channel output, both conditioned and unconditioned on the input. This allows them to establish a lower bound on the mutual information, which directly relates to the capacity pre-log.
  • Mathematical Tools: The proof relies on concepts like differential entropy, Jacobian matrices, and properties of Gaussian random variables, along with specific lemmas and theorems from information theory and matrix analysis.

Datasets

Not discussed in the paper.

Key Insights and Ideas

  • Symbol-rate sampling is suboptimal: The most significant insight is that the conventional symbol-rate matched filtering approach is not capacity-achieving at high signal-to-noise ratios (SNR) for this type of channel. Oversampling provides a way to overcome this limitation.
  • Oversampling as a "spatial" oversampling equivalent: The paper draws an analogy to previous work where using multiple receive antennas (spatial oversampling) could improve the pre-log. Here, temporal oversampling achieves a similar pre-log improvement without requiring additional antennas.
  • The pre-log improvement is independent of fading correlation: A crucial finding is that the achieved pre-log improvement through oversampling is independent of the rank of the channel covariance matrix within a fading block. This means the benefit holds even when the fading is highly correlated within a block.
  • Oversampling provides more "dimensions" for information: Intuitively, oversampling provides more output samples per symbol duration. These extra samples can be leveraged by the receiver to gain more information about the unknown fading channel, which in turn allows for more efficient data transmission.
  • Nonlinear processing is key: The paper hints that achieving this pre-log gain with oversampling might require nonlinear processing at the receiver, which is more complex than the linear processing typically used in symbol-matched filtering.

Key Results

The paper proves that by oversampling the continuous-time Rayleigh block-fading channel output by a factor of two, the capacity pre-log can be at least $1 - 1/N$, where $N$ is the number of symbols transmitted within a fading block. This is a direct improvement over the $1 - Q/N$ pre-log achieved by symbol-rate sampling, where $Q$ is the rank of the channel covariance matrix. This implies that the capacity pre-log of the underlying continuous-time channel is at least $1 - 1/N$.

Limitations and Future Work

  • Complexity of nonlinear processing: The paper acknowledges that the oversampling approach may require nonlinear processing at the receiver, which is more complex than standard linear methods. This is a practical limitation for implementation.
  • Specific oversampling factor: The analysis focuses on oversampling by a factor of two. It's not explicitly stated whether further oversampling could yield even greater pre-log gains, though the paper suggests it's a direction for future research.
  • Generalization to other fading models: While the results are for Rayleigh block-fading, future work could explore if similar pre-log improvements can be achieved for other types of fading channels.
  • Practical implementation: The paper focuses on theoretical capacity. Translating these findings into practical communication systems would involve addressing the challenges of implementing the required nonlinear signal processing.

Summary updated

Abstract

We analyze the capacity of a continuous-time, time-selective, Rayleigh block-fading channel in the high signal-to-noise ratio (SNR) regime. The fading process is assumed stationary within each block and to change independently from block to block; furthermore, its realizations are not known a priori to the transmitter and the receiver (noncoherent setting). A common approach to analyzing the capacity of this channel is to assume that the receiver performs matched filtering followed by sampling at symbol rate (symbol matched filtering). This yields a discrete-time channel in which each transmitted symbol corresponds to one output sample. Liang & Veeravalli (2004) showed that the capacity of this discrete-time channel grows logarithmically with the SNR, with a capacity pre-log equal to $1-{Q}/{N}$. Here, $N$ is the number of symbols transmitted within one fading block, and $Q$ is the rank of the covariance matrix of the discrete-time channel gains within each fading block. In this paper, we show that symbol matched filtering is not a capacity-achieving strategy for the underlying continuous-time channel. Specifically, we analyze the capacity pre-log of the discrete-time channel obtained by oversampling the continuous-time channel output, i.e., by sampling it faster than at symbol rate. We prove that by oversampling by a factor two one gets a capacity pre-log that is at least as large as $1-1/N$. Since the capacity pre-log corresponding to symbol-rate sampling is $1-Q/N$, our result implies indeed that symbol matched filtering is not capacity achieving at high SNR.
BibTeX
@article{dorpinghaus2014oversampling,
  author = {Meik Dörpinghaus and Günther Koliander and Giuseppe Durisi and Erwin Riegler and Heinrich Meyr},
  title = {{Oversampling Increases the Pre-Log of Noncoherent Rayleigh Fading Channels}},
  journal = {IEEE Trans. Information Theory},
  year = {2014},
  url = {https://openreview.net/forum?id=FGfUckiA4H},
}
Figure