Noncoherent Capacity Research Articles

Performance and Capacity Analysis of MDCSK-BICM for Impulsive Noise in PLC

To further mitigate the BER error floor of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$M$</tex-math></inline-formula> -ary differential chaos shift keying (MDCSK) modulation for impulsive noise, a low-cost high-reliability coded modulation scheme without equalizations is desirable for impulsive noise. In this paper, a protograph-based low-density parity-check coded MDCSK-based bit-interleaved coded modulation (MDCSK-BICM) scheme is proposed for the scenario with impulsive noise obeying Bernoulli-Laplace distribution. Considering the Gaussian distribution of protograph extrinsic information transfer (PEXIT) and the benchmark of coding design, the U-shaped non-coherent capacity is derived with optimal code rate for square MDCSK, showing that the code rates are stable with <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$E_b/N_0$</tex-math></inline-formula> increasing but still much lower than that of DS-16DQAM at code rate <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$&gt;\!0.145$</tex-math></inline-formula> . The derived joint probability density function can be considered as approximately a Gaussian distribution, which is used to improve the impulsive noise fitted PEXIT. Finally, a new code under a novel principle is designed for better bit error rate performance based on the improved PEXIT analysis. Both PEXIT analysis and simulation results demonstrate that the proposed scheme achieves a better BER than that with a traditional scheme, and suggesting a research approach based on simple methods. This basic research work provides a guide to establish a framework and optimize the performance of transmission systems over practical power line communication.

Capacity Scaling in a Non-Coherent Wideband Massive SIMO Block Fading Channel

The scaling of coherent and non-coherent channel capacity is studied in a single-input multiple-output (SIMO) block Rayleigh fading channel as both the bandwidth and the number of receiver antennas go to infinity jointly with the transmit power fixed. The transmitter has no channel state information (CSI), while the receiver may have genie-provided CSI (coherent receiver), or the channel statistics only (non-coherent receiver). Our results show that if the available bandwidth is smaller than a threshold bandwidth which is proportional (up to leading order terms) to the square root of the number of antennas, there is no gap between the coherent capacity and the non-coherent capacity in terms of capacity scaling behavior. On the other hand, when the bandwidth is larger than this threshold, there is a capacity scaling gap. Since achievable rates using pilot symbols for channel estimation are subject to the non-coherent capacity bound, this work reveals that pilot-assisted coherent receivers in systems with a large number of receive antennas are unable to exploit excess spectrum above a given threshold for capacity gain.

A Simple Formula for Noncoherent Capacity in Highly Underspread WSSUS Channel

Channel capacity is a useful numerical index not only for grasping the upper limit of the transmission bit rate but also for comparing the abilities of various digital transmission schemes commonly used in radio-wave propagation environments because the channel capacity does not depend on specific communication methods such as modulation/demodulation schemes or error correction schemes. In this paper, modeling of the noncoherent capacity in a highly underspread WSSUS channel is investigated using a new approach. Unlike the conventional method, namely, the information theoretic method, a very straightforward formula can be obtained in a statistical manner. Although the modeling in the present study is carried out using a somewhat less rigorous approach, the result obtained is useful for roughly understanding the channel capacity in doubly selective fading environments. We clarify that the radio wave propagation parameter of the spread factor, which is the product of the Doppler spread and the delay spread, can be related quantitatively to the effective maximum signal-to-interference ratio by a simple formula. Using this model, the physical limit of wireless digital transmission is discussed from a radio wave propagation perspective.

Non-Coherent Capacity of $M$ -ary DCSK Modulation System Over Multipath Rayleigh Fading Channels

Non-coherent capacity bounds for the $M$ -ary differential chaos shift keying (DCSK) modulation system are derived and analyzed over multipath Rayleigh fading channels, deriving conditions on the channel state information/non-channel state information (CSI/NonCSI) and soft-decision/hard-decision (SD/HD), respectively. Meanwhile, the inter-symbol interference is modeled and analyzed mathematically. Through numerical simulations and analyses, it is found that: 1) the influences of the spreading factor $\beta $ , multipath number $L$ , modulation dimension $M$ , CSI/NonCSI, and SD/HD on the non-coherent capacity bounds are significant; 2) there is a relatively broad range of code rates corresponding to the optimal system power in U-shaped capacity curves of the non-coherent reception; and 3) the U-shaped non-coherent capacity bounds are proven to exist by investigating the mechanism of the low density parity check coded the $M$ -ary DCSK system. These results are useful as benchmarks for designing power-efficient coded $M$ -ary DCSK systems.

A Simple Recursively Computable Lower Bound on the Noncoherent Capacity of Highly Underspread Fading Channels

Real-world wireless communication channels are typically highly underspread: their coherence time is much greater than their delay spread. In such situations, it is common to assume that, with sufficiently high bandwidth, the capacity without channel state information (CSI) at the receiver (termed the noncoherent channel capacity) is approximately equal to the capacity with perfect CSI at the receiver (termed the coherent channel capacity). In this paper, we propose a lower bound on the noncoherent capacity of highly underspread fading channels, which assumes only that the delay spread and coherence time are known. Furthermore, our lower bound can be calculated recursively, with each increment corresponding to a step increase in bandwidth. These properties, we contend, make our lower bound an excellent candidate as a simple method to verify that the noncoherent capacity is indeed approximately equal to the coherent capacity for typical wireless communication applications. We precede the derivation of the aforementioned lower bound on the information capacity with a rigorous justification of the mathematical representation of the channel. Furthermore, we also provide a numerical example for an actual wireless communication channel and demonstrate that our lower bound does indeed approximately equal the coherent channel capacity.

Time-Frequency Grassmannian Signalling for MIMO Multi-Channel-Frequency-Flat Systems

In this paper, we consider the application of non-coherent Grassmannian signalling in practical multi-channel-frequency-flat multiple-input multiple-output (MIMO) wireless communication systems. In these systems, Grassmannian signalling, originally developed for single-channel block-fading systems, is not readily applicable. In particular, in such systems, the channel coefficients are constant across time and frequency, which implies that spectrally-efficient signalling ought to be jointly structured over these domains. To approach this goal, we develop a concatenation technique that yields a spectrally-efficient time-frequency Grassmannian signalling scheme, which enables the channel coherence bandwidth to be regarded as an additional coherence time. This scheme is shown to achieve the high signal-to-noise ratio non-coherent capacity of MIMO channels when the fading coefficients are constant over a time-frequency block. This scheme is also applicable in fast fading systems with coherence bandwidth exceeding that of one subchannel. The proposed scheme is independent of the symbol duration, i.e., the channel use duration, and is thus compatible with the transmit filter designs in current systems.

Grassmannian Signalling Achieves Tight Bounds on the Ergodic High-SNR Capacity of the Noncoherent MIMO Full-Duplex Relay Channel

This paper considers the ergodic noncoherent capacity of a multiple-input multiple-output frequency-flat block Rayleigh fading full duplex relay channel at high signal-to-noise ratios (SNRs). It is shown that, for these SNRs, restricting the input distribution to be isotropic on a compact Grassmann manifold maximizes an upper bound on the cut-set bound. Furthermore, it is shown that, from a degrees of freedom point of view, no relaying is necessary and Grassmannian signalling at the source achieves the upper bound within an SNR-independent gap. When the source-relay channel is sufficiently stronger than the source-destination and relay-destination channels, it is shown that, with the number of relay transmit antennas appropriately chosen, a Grassmannian decode-and-forward scheme, which is devised herein, achieves the ergodic noncoherent capacity of the relay channel within an approximation gap that goes to zero as the SNR goes to infinity. Closed-form expressions for the optimal number of relay transmit antennas indicate that this number decreases monotonically with the source transmit power.

On the Sensitivity of Continuous-Time Noncoherent Fading Channel Capacity

The noncoherent capacity of stationary discrete-time fading channels is known to be very sensitive to the fine details of the channel model. More specifically, the measure of the support of the fading-process power spectral density (PSD) determines if noncoherent capacity grows logarithmically with the signal-to-noise ratio (SNR) or slower than logarithmically. Such a result is unsatisfactory from an engineering point of view, as the support of the PSD cannot be determined through measurements. The aim of this paper is to assess whether, for general continuous-time Rayleigh-fading channels, this sensitivity has a noticeable impact on capacity at SNR values of practical interest. To this end, we consider the general class of band-limited continuous-time Rayleigh-fading channels that satisfy the wide-sense stationary uncorrelated-scattering (WSSUS) assumption and are, in addition, under spread. We show that, for all SNR values of practical interest, the noncoherent capacity of every channel in this class is close to the capacity of an additive white Gaussian noise channel with the same SNR and bandwidth, independently of the measure of the support of the scattering function (the 2-D channel PSD). Our result is based on a lower bound on noncoherent capacity, which is built on a discretization of the channel input-output relation induced by projecting onto Weyl-Heisenberg sets. This approach is interesting in its own right as it yields a mathematically tractable way of dealing with the mutual information between certain continuous-time random signals.

Bounds on the Capacity of OFDM Underspread Frequency Selective Fading Channels

The analysis of the channel capacity in the absence of prior channel knowledge (noncoherent channel) has gained increasing interest in recent years. Yet, the noncoherent channel capacity is still unknown for the general case. In this paper, we derive bounds on the capacity of the noncoherent, underspread complex Gaussian, orthogonal frequency division multiplexing, wide sense stationary channel with uncorrelated scattering, under a peak power constraint or a constraint on the second and fourth moments of the transmitted signal. These bounds are characterized only by the system signal-to-noise ratio (SNR) and by a newly defined quantity termed effective coherence time. Intuitively, the effective coherence time can be interpreted as the length of a block in the block-fading model in which a system with the same SNR will achieve the same capacity as in the analyzed channel. Unlike commonly used coherence time definitions, it is shown that the effective coherence time depends on the SNR, and is a nonincreasing function of it. We show that for low SNR, the capacity is proportional to the effective coherence time, while for higher SNR, the coherent channel capacity can be achieved provided that the effective coherence time is large enough.

Noncoherent Capacity of Secret-Key Agreement With Public Discussion

We study the noncoherent capacity of secret-key agreement with public discussion over independent identically distributed (i.i.d.) Rayleigh fading wireless channels, where neither the sender nor the receivers have access to instantaneous channel state information (CSI). We present two results. At high signal-to-noise ratio (SNR), the secret-key capacity is bounded in SNR, regardless of the number of antennas at each terminal. Second, for a system with a single antenna at both the legitimate and the eavesdropper terminals and an arbitrary number of transmit antennas, the secret-key capacity-achieving input distribution is discrete, with a finite number of mass points. Numerically we observe that at low SNR, the capacity achieving distribution has two mass points with one of them at the origin.

Capacity bounds for peak-constrained multiantenna wideband channels

Bounds are derived on the noncoherent capacity of a very general class of multiple-input multiple-output fading channels that are selective in time and frequency as well as correlated in space. The bounds apply to peak-constrained inputs; they are explicit in the channel's scattering function, are useful for a large range of bandwidth, and allow one to coarsely identify the capacity-optimal combination of bandwidth and number of transmit antennas. Furthermore, a closed-form expression is obtained for the first-order Taylor series expansion of capacity in the limit of infinite bandwidth. From this expression, it is concluded that in the wideband regime: (i) it is optimal to use only one transmit antenna when the channel is spatially uncorrelated; (ii) rank-one statistical beamforming is optimal if the channel is spatially correlated; and (iii) spatial correlation, be it at the transmitter, the receiver, or both, is beneficial.

Noncoherent Capacity of Underspread Fading Channels

We derive bounds on the noncoherent capacity of wide-sense stationary uncorrelated scattering (WSSUS) channels that are selective both in time and frequency, and are underspread, i.e., the product of the channel's delay spread and Doppler spread is small. The underspread assumption is satisfied by virtually all wireless communication channels. For input signals that are peak constrained in time and frequency, we obtain upper and lower bounds on capacity that are explicit in the channel's scattering function, are accurate for a large range of bandwidth, and allow to coarsely identify the capacity-optimal bandwidth as a function of the peak power and the channel's scattering function. We also obtain a closed-form expression for the first-order Taylor series expansion of capacity in the infinite-bandwidth limit, and show that our bounds are tight in the wideband regime. For input signals that are peak constrained in time only (and, hence, allowed to be peaky in frequency), we provide upper and lower bounds on the infinite-bandwidth capacity. Our lower bound is closely related to a result by Viterbi (1967). We find cases where the bounds coincide and, hence, the infinite-bandwidth capacity is characterized exactly. The analysis in this paper is based on a discrete-time discrete-frequency approximation of WSSUS time- and frequency-selective channels. This discretization takes the underspread property of the channel explicitly into account.

Optimization of Training and Scheduling in the Non-Coherent SIMO Multiple Access Channel

Channel state information (CSI) is important for achieving large rates in MIMO channels. However, in time-varying MIMO channels, there is a tradeoff between the time/energy spent acquiring channel state information (CSI) and the time/energy remaining for data transmission. This tradeoff is accentuated in the MIMO multiple access channel (MAC), since the number of channel vectors to be estimated increases with the number of users. Furthermore, the problem of acquiring CSI is tightly coupled with the problem of exploiting CSI through multiuser scheduling. This paper considers a block-fading MAC with coherence time <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</i> , n uncoordinated users-each with one transmit antenna and the same average power constraint, and a base station with <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</i> receive antennas and no a priori CSI. For this scenario, a training-based communication scheme is proposed and the training and multiuser-scheduling aspects of the scheme are jointly optimized. In the high-SNR regime, the sum capacity of the non-coherent SIMO MAC is characterized and used to establish the SNR-scaling-law optimality of the proposed scheme. In the low-SNR regime, the sum-rate of the proposed scheme is found to decay linearly with vanishing SNR when flash signaling is incorporated. Furthermore, this linear decay is shown to be order-optimal through comparison to the low-SNR sum capacity of the non-coherent SIMO MAC. A by product of these SNR-asymptotic analyses is the observation that non-trivial scheduling (i.e., scheduling a strict subset of trained users) is advantageous at low SNR, but not at high SNR. The sum-rate and per-user throughput are also explored in the large- <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> and large- <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">M</i> regimes. Non-coherent capacity, training, multiple access channel, multiuser scheduling, opportunistic scheduling.

Capacity of Noncoherent Time-Selective Rayleigh-Fading Channels

The capacity of noncoherent time-selective Rayleigh-fading channels is studied under various models for the variations in time. The study includes both single-input and single-output (SISO) and multiple-input and multiple-output (MIMO) systems. A block-fading model is first considered where the channel changes correlatively over each block period of length T, and independently across blocks. The predictability of the channel is characterized through the rank Q of the correlation matrix of the vector of channel gains in each block. This model includes, as special cases, the standard block-fading model where the channel remains constant over block periods (Q=1), and models where the fading process has finite differential entropy rate (Q=T). The capacity is initially studied for long block lengths and some straightforward but interesting asymptotes are established. For the case where Q is kept fixed as T/spl rarr//spl infin/, it is shown that the noncoherent capacity converges to the coherent capacity. For the case where both T,Q/spl rarr//spl infin/, with Q/T being held constant, a bound on the capacity loss due to channel unpredictability is established. The more interesting scenario of large signal-to-noise ratio (SNR) is then explored in detail. For SISO systems, useful upper and lower bounds on the large SNR asymptotic capacity are derived, and it is shown that the capacity grows logarithmically with SNR with a slope of T-Q/spl rarr/T, for Q<T. Next, in order to facilitate the analysis of MIMO systems, the rank-Q block-fading model is specialized to the case where each T-symbol block consists of Q subblocks of length L, with the channel remaining constant over each subblock and changing correlatively across subblocks. For this model, it is shown that the log SNR growth behavior of the capacity is the same as that of the standard block-fading model with block length L. Finally, the SISO and MIMO channel models are generalized to allow the fading process to be correlated across blocks in a stationary and ergodic manner. It is shown that the log SNR growth behavior of the capacity is not affected by the correlation across blocks.

Performance Evaluation of Multiple Transmit Antenna Non-CoherentDetection Schemes in Fast Fading Channels

For the fast fading channels, e.g., fast mobile channels, non-coherent detection scheme is promising because the receiver does not require to measure the channel information, which results in reducing transmission overhead. In this paper, we compare the bit error rate of two non-coherent encoding/decoding schemes for multiple transmit antennas under fast fading environments when the number of antenna varies from two to three. The first approach is a unitary space-time modulation (USTM) that aims to achieve the non-coherent channel capacity. The second one is a differential space-time block code (DSTBC), which projects information symbols to a number of orthogonal bases that consist of the previously sent symbols. We exhibit the fact that the block length of both schemes affects the performance significantly rather than encoding/decoding methods when the channel varies fast. In addition, we present some problems of the DSTBC sending the complex symbols with more than two transmit antennas.