Training Optimization for Gauss-Markov Rayleigh Fading Channels

In this paper, pilot-assisted transmission over Gauss-Markov Rayleigh fading channels is considered. A simple scenario, where a single pilot signal is transmitted every T symbols and T-1 data symbols are transmitted in between the pilots, is studied. First, it is assumed that binary phase-shift keying (BPSK) modulation is employed at the transmitter. With this assumption, the training period, and data and training power allocation are jointly optimized by maximizing an achievable rate expression. Achievable rates and energy-per-bit requirements are computed using the optimal training parameters. Secondly, a capacity lower bound is obtained by considering the error in the estimate as another source of additive Gaussian noise, and the training parameters are optimized by maximizing this lower bound.Comment: To appear in the Proc. of the 2007 IEEE International Conference on Communication

Near-Instantaneously Adaptive HSDPA-Style OFDM Versus MC-CDMA Transceivers for WIFI, WIMAX, and Next-Generation Cellular Systems

Burts-by-burst (BbB) adaptive high-speed downlink packet access (HSDPA) style multicarrier systems are reviewed, identifying their most critical design aspects. These systems exhibit numerous attractive features, rendering them eminently eligible for employment in next-generation wireless systems. It is argued that BbB-adaptive or symbol-by-symbol adaptive orthogonal frequency division multiplex (OFDM) modems counteract the near instantaneous channel quality variations and hence attain an increased throughput or robustness in comparison to their fixed-mode counterparts. Although they act quite differently, various diversity techniques, such as Rake receivers and space-time block coding (STBC) are also capable of mitigating the channel quality variations in their effort to reduce the bit error ratio (BER), provided that the individual antenna elements experience independent fading. By contrast, in the presence of correlated fading imposed by shadowing or time-variant multiuser interference, the benefits of space-time coding erode and it is unrealistic to expect that a fixed-mode space-time coded system remains capable of maintaining a near-constant BER

Transmit Diversity Assisted Space Shift Keying for Colocated and Distributed/Cooperative MIMO Elements

Space Shift Keying (SSK) modulation is a recently proposed MIMO technique, which activates only a single transmit antenna during each time slot and uses the specific index of the activated transmit antenna to implicitly convey information. Activating a single antenna is beneficial in terms of eliminating the inter-channel interference, and mitigates the peak-to-mean power ratio, while avoiding the need for synchronisation among transmit antennas. However, this benefit is achieved at a sacrifice, since the transmit diversity gain potential of the multiple transmit antennas is not fully exploited in existing SSK assisted systems. Furthermore, a high SSK throughput requires the transmitter to employ a high number of transmit antennas, which is not always practical. Hence, we propose four algorithms, namely open-loop Space Time Space Shift Keying (ST-SSK), closed-loop feedback-aided phase rotation, feedback-aided power allocation, and cooperative ST-SSK, for the sake of achieving a diversity gain. The performance improvements of the proposed schemes are demonstrated by Monte-Carlo simulations for spatially independent Rayleigh fading channels. Their robustness against channel estimation errors is also considered. We advocate the proposed ST-SSK techniques, which are capable of achieving a transmit diversity gain of about 10 dB at a BER of 10-5, at a cost of imposing a moderate throughput loss dedicated to a modest feedback overhead. Furthermore, our proposed ST-SSK scheme lends itself to efficient communication, because the deleterious effects of deep shadow fading no longer impose spatial correlation on the signals received by the antennas, which cannot be readily avoided by co-located antenna elements

Short Packets over Block-Memoryless Fading Channels: Pilot-Assisted or Noncoherent Transmission?

We present nonasymptotic upper and lower bounds on the maximum coding rate achievable when transmitting short packets over a Rician memoryless block-fading channel for a given requirement on the packet error probability. We focus on the practically relevant scenario in which there is no \emph{a priori} channel state information available at the transmitter and at the receiver. An upper bound built upon the min-max converse is compared to two lower bounds: the first one relies on a noncoherent transmission strategy in which the fading channel is not estimated explicitly at the receiver; the second one employs pilot-assisted transmission (PAT) followed by maximum-likelihood channel estimation and scaled mismatched nearest-neighbor decoding at the receiver. Our bounds are tight enough to unveil the optimum number of diversity branches that a packet should span so that the energy per bit required to achieve a target packet error probability is minimized, for a given constraint on the code rate and the packet size. Furthermore, the bounds reveal that noncoherent transmission is more energy efficient than PAT, even when the number of pilot symbols and their power is optimized. For example, for the case when a coded packet of $168$ symbols is transmitted using a channel code of rate $0.48$ bits/channel use, over a block-fading channel with block size equal to $8$ symbols, PAT requires an additional $1.2$ dB of energy per information bit to achieve a packet error probability of $10^{-3}$ compared to a suitably designed noncoherent transmission scheme. Finally, we devise a PAT scheme based on punctured tail-biting quasi-cyclic codes and ordered statistics decoding, whose performance are close ($1$ dB gap at $10^{-3}$ packet error probability) to the ones predicted by our PAT lower bound. This shows that the PAT lower bound provides useful guidelines on the design of actual PAT schemes.Comment: 30 pages, 5 figures, journa

Programmable H.263-Based Wireless Video Tranceivers for Interference-Limited Environments

In order to exploit the non-uniformly distributed channel capacity over the cell area, the intelligent 7.3 kBaud programmable videophone transceiver of Table I is proposed, which is capable of exploiting the higher channel capacity of uninterfered, high channel-quality cell areas, while supporting more robust, but lower bitrate operation in more interfered areas. The system employed an enhanced H.263-compatible video codec. Since most existing wireless systems exhibit a constant bitrate, the video codec's bitrate fluctuation was smoothed by a novel adaptive packetisation algorithm, which is capable of supporting Automatic Repeat Request (ARQ) assisted operation in wireless distributive video transmissions, although in the proposed low-latency interactive videophone transceiver we refrained from using ARQ. Instead, corrupted packets are dropped by both the local and remote decoders, in order to prevent error propagation. The minimum required channel signal to interference-plus-noise ratio (SINR) was in the range of 8-28 dB for the various transmission scenarios of Table I, while the corresponding video peak signal-to-noise ratio (PSNR) was in the range of 32-39 dB. The main system features are summarised in Table I. Index Terms - H.263-based video communications, interactive wireless video, QAM-based video transmission, video communications in interference-limited environments, video tranceivers