Search

We propose a robust close-to-capacity dirty-paper coding (DPC) design framework in which multi-level low density parity check (LDPC) codes and trellis coded quantization (TCQ) are employed as the channel and source coding components, respectively. The proposed design framework is robust in the sense that it yields close to capacity solutions in the high-, medium-, and low-rate regimes. This is in contrast to existing practical DPC schemes that perform well only in one or two of these regimes, but not all three. We design codes for transmission rates of 0.5, 1.0, 1.5, and 2.0 bits/sample (b/s) using one, two, three, and four LDPC levels; at a block length of 2×105, the codes perform 0.95, 0.58, 0.55, and 0.54 dB from the corresponding information theoretic limits, respectively. We also propose a low-complexity decoding scheme that does not involve iterative message passing between the source and channel decoders; the low-complexity scheme performs only 1.08, 0.85, and 0.79 dB away from the theoretical limits at transmission rates of 1.0, 1.5, and 2.0 b/s, respectively.

A novel approach is here presented to superimpose a low-priority data stream on a high-priority data stream for OFDM systems. The main improvement with respect to conventional hierarchical modulation, which is included with the same purpose in various wireless technologies, is that the low-priority data stream can be decoded from the received subcarrier symbols without any previous equalization for multipath fading channels. As a consequence, the expected performance is nearly invariant of the channel estimation method used to equalize the channel. The low-priority stream is inserted adopting a gain-invariant dirty paper coding based on Rational Dither Modulation, which was proposed for data hiding applications. In this paper an analysis of the developed system is presented and several simulations have been carried out using DVB-T system parameters to verify the validity of the proposed approach. The experimental results show the better performance of the proposed method with respect to that of a conventional hierarchical modulation, particularly when the accuracy of the estimated channel response decreases.

We consider practical schemes for binary dirty-paper channels and broadcast channels (BCs) with two receivers and varying channel quality. With the BC application in mind, this paper proposes a new design for binary dirty paper coding (DPC). By exploiting the concept of coset binning, the complexity of the system is greatly reduced when compared to the existing works. Some design challenges of the coset binning approach are identified and addressed. The proposed binary DPC system achieves similar performance to the state-of-the-art, superposition-coding-based system while demonstrating significant advantages in terms of complexity and flexibility of system design. For binary BCs, achieving the capacity generally requires the superposition of a normal channel code and a carefully designed channel code with non-uniform bit distribution. The non-uniform bit distribution is chosen according to the channel conditions. Therefore, to achieve the capacity for binary BCs with varying channel quality, it is necessary to use quantization codes of different rates, which significantly increases the implementation complexity. In this paper, we also propose a broadcast scheme that generalizes the concept of binary DPC, which we term soft DPC. By combining soft DPC with time sharing, we achieve a large percentage of the capacity for a wide range of channel quality with little complexity overhead. Our scheme uses only one fixed pair of codes for users 1 and 2, and a single quantization code, which possesses many practical advantages over traditional time sharing and superposition coding solutions and provides strictly better performance.

This paper investigates how much the rate region of the two-user Gaussian interference channel can be enlarged by allowing the two source nodes to cooperate. Two cooperative transmission schemes are proposed, based on dirty-paper coding and the assumption that the radio bandwidth is partitioned into two parts, and each part is utilized by one source node. The achievable rate regions and the outage performance of these two schemes are compared with the simplified Han-Kobayashi scheme, which is an efficient coding scheme for the interference channel. Simulation results show that in some channel realizations, the rate region of the Han-Kobayashi scheme is a subset of the rate regions of our two proposed cooperative transmission schemes. Furthermore, a significant gain in outage performance can be obtained, as the cooperative schemes have twice the diversity order of the simplified Han-Kobayashi scheme. While both cooperative schemes are able to yield large diversity gain, one of them can be implemented by simple decoder. Besides, it has an efficient algorithm for maximizing its weighted sum rate, and can be extended easily to the multi-channel case.

In this paper, an efficient greedy scheduler for zero-forcing dirty-paper coding (ZF-DPC), which can be incorporated in complex Householder QR factorization of the channel matrix, is proposed. The ratio of the complexity of the proposed scheduler to the complexity of the channel matrix factorization required by ZF-DPC is O(M-1), while such ratio for the original greedy scheduler is O(M), where M is the number of transmitters. Therefore, the new scheduler reduces the overhead of scheduling from being the bottleneck of ZF-DPC to being negligible.

This paper presents bandwidth-efficient speech transmission systems using rate-compatible channel coders and variable bitrate embedded source coders. Rate-compatible punctured convolutional codes (RCPC) are often used to provide unequal error protection (UEP) via progressive bit puncturing. RCPC codes are well suited for constellations for which Euclidean and Hamming distances are equivalent (BPSK and 4-PSK). This paper introduces rate-compatible punctured trellis codes (RCPT) where rate compatibility and UEP are provided via progressive puncturing of symbols in a trellis. RCPT codes constitute a special class of codes designed to maximize residual Euclidean distances (RED) after symbol puncturing. They can be designed for any constellation, allowing for higher throughput than when restricted to using 4-PSK. We apply RCPC and RCPT to two embedded source coders: a perceptual subband coder and the ITU embedded ADPCM G.727 standard. Different operating modes with distinct source/channel bit allocation and UEP are defined. Each mode is optimal for a certain range of AWGN channel SNRs. Performance results using an 8-PSK constellation clearly illustrate the wide range of channel conditions at which the adaptive scheme using RCPT can operate. For an 8-PSK constellation, RCPT codes are compared to RCPC with bit interleaved coded modulation codes (RCPC-BICM). We also compare performance to RCPC codes used with a 4-PSK constellation. Index Terms--Adaptive multirate (AMR), bit interleaved coded modulation (BICM), embedded coding, punctured codes, rate-compatible channel coding, perceptual coding, rate-compatible punctured convolutional codes (RCPC), rate-compatible punctured trellis codes (RCPT), trellis codes, unequal error protection.

A dirty-paper channel is considered, where the transmitter knows the interference sequence up to a constant multiplicative factor, known only to the receiver. Lower bounds on the achievable rate of communication are derived by proposing a coding scheme that partially compensates for the imprecise channel knowledge.We focus on a communication scenario where the signal-to-noise ratio is high. Our approach is based on analyzing the performance achievable using lattice-based coding schemes. When the power of the interference is finite, we show that the achievable rate of this lattice-based coding scheme may be improved by a judicious choice of the scaling parameter at the receiver. We further show that the communication rate may be improved, for finite as well as infinite interference power, by allowing randomized scaling at the transmitter.

In this paper, an iterative algorithm for joint decoding and channel estimation in frequency-hopping (FH) networks is proposed. In the proposed algorithm, soft decoder outputs are used in the iterative estimation of the time-varying variance of the additive interference resulting from the sum of the thermal noise, partial-band noise jamming, and other-user interference. The soft outputs are also used in the estimation of the independent random carrier phases and multiplicative Rayleigh fading coefficients in different frequency dwells. The estimation process is further enhanced through the insertion of known symbols in the transmitted data stream. The proposed iterative symbol-aided demodulation scheme is compared with the coherent scenario, where the channel state information is assumed to be known a priori at the receiver, for both convolutionally coded and Turbo coded FH systems. The proposed iterative channel estimation approach is suited for slow FH systems where the channel dynamics are much slower than the hopping rate. This observation motivates the consideration of another robust approach for generating the log-likelihood ratios for fast hopping systems in additive white Gaussian noise channels. Simulation results that demonstrate the excellent performance of the proposed algorithms in various scenarios are also presented. Index Terms--Channel estimation, convolutional codes, frequency hopping, iterative decoding, partial band jamming, Turbo codes.

Optimal multi-antenna wide-band signaling schemes are derived for multipath channels assuming perfect channel state information at the transmitter. The scheme that minimizes the bit-error probability in the single-user case is a rank-one space--time beamformer which focuses the signal transmission in the direction of the most dominant channel mode. Several suboptimal variations are discussed for multiuser applications. The optimal signaling scheme given channel statistics at the transmitter is also derived. The optimal scheme in this case is a full-rank space-time beamformer that transmits on all channel modes. Analysis and simulation results are used to compare the schemes proposed in this paper. Finally, we discuss the optimal signaling scheme when a delayed version of the channel state is available at the transmitter. It is shown that in this case the optimal scheme is a rank-1 beamformer when the channel variations are sufficiently slow and is a full rank beamformer in a sufficiently fast fading channel. Index Terms--Antenna arrays, diversity signaling, feedback, multipath, spread spectrum communication systems, transmit beam forming.

In this paper, we propose a blind successive interference cancellation receiver for asynchronous direct-sequence code-division multiple-access (DS-CDMA) systems using a maximum mean energy (MME) optimization criterion. The covariance matrix of the received vector is used in conjunction with the MME criterion to realize a blind successive interference canceler that is referred to as the BIC-MME receiver. The receiver executes interference cancellation in a successive manner, starting with the most dominant interference component and successively cancelling the weaker ones. The receiver is compared against various centralized and decentralized receivers, and it is shown to perform well in the presence of estimation errors of the covariance matrix, making it suitable for application in time-varying channels. We also analyze properties of the covariance matrix estimates which are relevant to the performance of the BIC-MME receiver. Further, the BIC-MME receiver is particularly efficient in the presence of a few strong interferers as may be the case in the downlink of DS-CDMA systems where intracell user transmissions are orthogonal. An iterative implementation that results in reduced complexity is also studied. Index Terms--Blind interference cancellation, CDMA downlink, successive interference cancellation.

This paper deals with the capacity behavior of wireless orthogonal frequency-division multiplexing (OFDM)-based spatial multiplexing systems in broad-band fading environments for the case where the channel is unknown at the transmitter and perfectly known at the receiver. Introducing a physically motivated multiple-input multiple-output (MIMO) broad-band fading channel model, we study the influence of physical parameters such as the amount of delay spread, cluster angle spread, and total angle spread, and system parameters such as the number of antennas and antenna spacing on ergodic capacity and outage capacity. We find that, in the MIMO case, unlike the single-input single-output (SISO) case, delay spread channels may provide advantages over flat fading channels not only in terms of outage capacity but also in terms of ergodic capacity. Therefore, MIMO delay spread channels will in general provide both higher diversity gain and higher multiplexing gain than MIMO flat-fading channels. Index Terms--Broad-band fading channels, diversity gain, ergodic capacity, MIMO, multiplexing gain, OFDM, outage capacity.

A novel multiuser-interference (MUI)-free code division multiple access (CDMA) transceiver for frequency-selective multipath channels is developed in this paper. Relying on chip-interleaving and zero padded transmissions, orthogonality among different users' spreading codes is maintained at the receiver even after frequency-selective propagation. As a result, deterministic multiuser separation with low-complexity code-matched filtering becomes possible without loss of maximum likelihood optimality. In addition to MUI-free reception, the proposed system guarantees channel-irrespective symbol detection and achieves high bandwidth efficiency by increasing the symbol block size. Filling the zero-gaps with known symbols allows for perfectly constant modulus transmissions. Important variants of the proposed transceivers are derived to include cyclic prefixed transmissions and various redundant or nonredundant precoding alternatives. (Semi-) blind channel estimation algorithms are also discussed. Simulation results demonstrate improved performance of the proposed system relative to competing alternatives. Index Terms--Block spreading, channel estimation, chip interleaving, code division multiple access (CDMA), multipath, multiuser interference.

Path pruning, a new coding concept to achieve free distance enlargement for convolutional codes, is proposed in this paper. Through path pruning, every convolutional code can be used for unequal error protection (UEP), no matter whether it is originally a UEP code. To avoid undesired path discontinuity and reduce possible path distance loss, a cascaded implementation together with a path-compatible criterion is proposed, under which path-compatible pruned convolutional (PCPC) codes are constructed. Necessary and sufficient conditions are also derived for a subclass of PCPC codes whose decoding can be done by a single decoder for the parent code. Finally, some PCPC codes with good UEP capabilities found by computer search are given. Index Terms--Convolutional codes, free distance, path pruning, single-trellis decoding, unequal error protection.

Real world source coding algorithms usually leave a certain amount of redundancy within the coded bit stream. Shannon already mentioned that this redundancy can be exploited at the receiver side to achieve a higher robustness against channel errors. In this paper, we show how joint source-channel decoding can be performed in a way that is applicable to any mobile communication system standard. Considerable gains in terms of bit error rate or signal-to-noise ratio (SNR) are possible dependent on the amount of redundancy. However, an even better performance can be achieved by changing also the transmitter sided source and channel encoders. We propose an encoding concept employing low-dimensional quantization. Keeping the gross bit rate as well as the clean channel quality the same, it decreases the complexity of the source encoder and the decoder significantly. Finally, we give an application of our methods to spectral coefficient coding in speech transmission over a Rayleigh fading channel resulting in channel SNR gains of about 2 dB as compared to state-of-the-art (de-)coding and bad frame handling methods. Index Terms--Channel coding, convolutional codes, decoding, redundancy, source coding.

In this paper, we address the use of the extrinsic information generated by each component decoder in an iterative decoding process. The algorithm proposed by Bahl et al. (BCJR) and the soft-output Viterbi algorithm (SOVA) are considered as component decoders. In both cases, we consider, in a unified view, various feedback schemes which use the extrinsic information in different fashions. Numerical results for a classical rate-1/2 turbo code and a serially concatenated code transmitted over a memory-less additive white Gaussian noise (AWGN) channel are provided. The performance of the considered schemes leads to interesting remarks about the nature of the extrinsic information. Index Terms--Iterative decoding, soft-input/soft-output algorithms, turbo (de)coding.

In this paper, we present a practical method to construct dirty paper coding (DPC) schemes using sum codes. Unlike the commonly used approach to DPC where the coding scheme involves concatenation of a channel code and a quantization code, the proposed method embodies a unified approach that emulates the binning method used in the proof of the DPC result. Auxiliary bits are used to create the desired number of code vectors in each bin. Sum codes are obtained when information sequences augmented with auxiliary bits are encoded using linear block codes. Sum-code-based DPC schemes can be implemented using any linear block code, and entail a relatively small increase in decoder complexity when compared to standard communication schemes. They can also lead to significant reduction in transmit power in comparison to standard schemes.

We consider a common-memory (CM) type N x N ATM switch, where CM block consists of K (K [greater than or equal to] N) separated submemories. We propose an address assignment algorithm to avoid input/output contentions so that we can have the read/write speed of submemories as low as the interface (input/output) port speed. Taking a replication-at-sending approach to multicast, we pursue memory efficiency and maximum throughput. We develop an analytical model to evaluate the system in terms of cell loss ratio and average delay time. In the analysis, we take into account two loss factors causing losses of incoming cells: 1) the failure of scheduling to avoid the input/output contentions and 2) overflow in the CM block. The first factor is dominating and can be significantly reduced by increasing K. From our analytical results compared with simulations, it is observed that we can take K [approximately equal to] 3N as a guide of system design. Index Terms--ATM switch, common memory switch, multicast, cell loss ratio, delay.

A major challenge in the operation of wireless communications systems is the efficient use of radio resources. One important component of radio resource management is power control, which has been studied extensively in the context of voice communications. With the increasing demand for wireless data services, it is necessary to establish power control algorithms for information sources other than voice. We present a power control solution for wireless data in the analytical setting of a game theoretic framework. In this context, the quality of service (QoS) a wireless terminal receives is referred to as the utility and distributed power control is a noncooperative power control game where users maximize their utility. The outcome of the game results in a Nash equilibrium that is inefficient. We introduce pricing of transmit powers in order to obtain Pareto improvement of the noncooperative power control game, i.e., to obtain improvements in user utilities relative to the case with no pricing. Specifically, we consider a pricing function that is a linear function of the transmit power. The simplicity of the pricing function allows a distributed implementation where the price can be broadcast by the base station to all the terminals. We see that pricing is especially helpful in a heavily loaded system. Index Terms--Game theory, Pareto efficiency, power control, pricing, wireless data.

Multiclass CDMA systems, which support multiple services with various quality of service (QoS) requirements, are studied. The focus is on the reverse link capacity and application of macrodiversity with maximal ratio combining (MMRC), where the signals from each mobile station (MS) are received by multiple base stations (BSs) and coherently combined. A simple analytical solution is first derived for the multiclass reverse link carrier-to-interference ratio (CIR). Using this CIR solution, a simple capacity analysis is developed in terms of the QoS requirements. Finally, the analysis is fully supported by simulation results. Index Terms--Macrodiversity, maximal ratio combining, power control, call admission control.