Search

We develop an information theoretic characterization and a practical coding approach for segmented deletion channels. Compared to channels with independent and identically distributed (i.i.d.) deletions, where each bit is independently deleted with an equal probability, the segmentation assumption imposes certain constraints, i.e., in a block of bits of a certain length, only a limited number of deletions are allowed to occur. This channel model has recently been proposed and motivated by the fact that for practical systems, when a deletion error occurs, it is more likely that the next one will not appear very soon. We first argue that such channels are information stable, hence their channel capacity exists. Then, we introduce several upper and lower bounds with two different methods in an attempt to understand the channel capacity behavior. The first scheme utilizes certain information provided to the transmitter and/or receiver while the second one explores the asymptotic behavior of the bounds when the average bit deletion rate is small. In the second part of the paper, we consider a practical channel coding approach over a segmented deletion channel. Specifically, we utilize outer LDPC codes concatenated with inner marker codes, and develop suitable channel detection algorithms for this scenario. Different maximum-a-posteriori (MAP) based channel synchronization algorithms operating at the bit and symbol levels are introduced, and specific LDPC code designs are explored. Simulation results clearly indicate the advantages of the proposed approach. In particular, for the entire range of deletion probabilities less than unity, our scheme offers a significantly larger transmission rate compared to the other existing solutions in the literature. [ABSTRACT FROM AUTHOR]

This paper considers base station cooperation as an interference management technique for the downlink of a WiMAX network (IEEE 802.16 standard) with frequency reuse factor of 1. A low-complexity cooperative transmission and scheduling scheme is proposed that requires limited feedback from the users and limited information exchange between the base stations. The proposed scheme requires minor modifications to the legacy IEEE 802.16e systems. The performance of the proposed scheme is compared with noncooperative schemes with similar complexity through computer simulations. Results demonstrate that base station cooperation provides an attractive solution for mitigating the cochannel interference and increases the system spectral efficiency compared to traditional cellular architectures based on frequency reuse. [ABSTRACT FROM AUTHOR]

The particle swarm optimization (PSO) technique is employed to design MIMO arrays for superior capacity. A channel model based on the method of moments solution of the electric field integral equation is utilized with PSO for arrays of dipole elements. Freestanding and printed dipole arrays are analyzed and optimized. Their adaptive performance in the MIMO channel is compared. Numerical results in the form of mean capacity, including comparisons with genetic algorithm results and measurements, are given. © 2008 Wiley Periodicals, Inc. Microwave Opt Technol Lett 51: 333–337, 2009; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.24027 [ABSTRACT FROM AUTHOR]

In this paper, we consider multicell processing on the downlink of a cellular network to accomplish "macrodiversity" transmit beamforming. The particular downlink beamformer structure we consider allows a recasting of the downlink beam-forming problem as a virtual linear mean square error (LMMSE) estimation problem. We exploit the structure of the channel and develop distributed beamforming algorithms using local message passing between neighboring base stations. For 1-D networks, we use the Kalman smoothing framework to obtain a forward—backward beamforming algorithm. We also propose a limited extent version of this algorithm that shows that the delay need not grow with the size of the network in practice. For 2-D cellular networks, we remodel the network as a factor graph and present a distributed beamforming algorithm based on the sum—product algorithm. Despite the presence of loops in the factor graph, the algorithm produces optimal results if convergence occurs. [ABSTRACT FROM AUTHOR]

The performance of printed dipole arrays in the MIMO channel is investigated using a channel model based on the Method of Moments solution of the electric-field integral equation. Comparisons with freestanding dipoles are given in terms of channel capacity. Effects of the electrical properties (such as the dielectric thickness and permittivity) on the MIMO capacity are explored. Various dielectric-substrate configurations yielding high-capacity Ml MO arrays are presented. [ABSTRACT FROM AUTHOR]

Scaling results for the sum capacity of the multiple access, uplink channel are provided for a flat-fading environment, with multiple-input-multiple-output (MIMO) links, when there is interference from other cells. The classical MIMO scaling regime is considered in which the number of antennas per user and per base station grow large together. Utilizing the known characterizations of the limiting eigenvalue distributions of large random matrices, the asymptotic behavior of the sum capacity of the system is characterized for an architecture in which the base stations cooperate in the joint decoding process of all users (macrodiversity). This asymptotic sum capacity is compared with that of the conventional scenario in which the base stations only decode the users in their cells. For the case of base station cooperation, an interesting ‘resource pooling’ phenomenon is observed: in some cases, the limiting performance of a macrodiversity multiuser network has the same asymptotic behavior as that of a single-user MIMO link with an equivalent amount of pooled received power. This resource pooling phenomenon allows us to derive an elegant closed-form expression for the sum capacity of a new version of Wyner's classical model of a cellular network, in which MIMO links are incorporated into the model. [ABSTRACT FROM AUTHOR]

The design of space-time signals for noncoherent block-fading channels where the channel state information is not known a priori at the transmitter and the receiver is considered. In particular, a new algebraic formulation for the diversity advantage design criterion is developed. The new criterion encompasses, as a special case, the well-known diversity advantage for unitary space-time signals and, more importantly, applies to arbitrary signaling schemes and arbitrary channel distributions. This criterion is used to establish the optimal diversity-Versus-rate tradeoff for training based schemes in block-fading channels. Our results are then specialized to the class of affine space-time signals which allows for a low complexity decoder. Within this class, space-time constellations based on the threaded algebraic space-time (TAST) architecture are considered. These constellations achieve the optimal diversity-versus" rate tradeoff over noncoherent block-fading channels and outperform previously proposed codes in the considered scenarios as demonstrated by the numerical results. Using the analytical and numerical results developed in this paper, nonunitary space-time codes are argued to offer certain advantages in block-fading channels where the appropriate use of coherent space-time codes is shown to offer a very efficient solution to the noncoherent space-time communication paradigm. [ABSTRACT FROM AUTHOR]

In this letter, we present a simple generalization of the maximum ratio combining principle for space-time coded systems. This result leads to a maximum-likelihood decoder implementation that does not depend on the number of receive antennas and avoids the loss in performance incurred in the decoders proposed by Tarokh and Lo and Biglieri et al. The insights offered by this decoding rule allow for a simple and elegant proof for the space-time code design criterion in systems with large number of receive antennas. We further present an upper bound on probability of error that captures the dependence of space-time code design on the number of receive antennas. Finally, we present a computationally efficient approach for constructing space-time trellis codes that exhibit satisfactory performance in systems with variable number of receive antennas. [ABSTRACT FROM AUTHOR]