Error statistics in data transmission over fading channels

We investigate the behavior of block errors which arise in data transmission on fading channels. Our approach takes into account the details of the specific coding/modulation scheme and tracks the fading process symbol by symbol. It is shown that a Markov approximation for the block error process (possibly degenerating into an identically distributed (i.i.d.) process for sufficiently fast fading) is a good model for a broad range of parameters. Also, it is observed that the relationship between the marginal error rate and the transition probability is largely insensitive to parameters such as block length, degree of forward error correction and modulation format, and depends essentially on an appropriately normalized version of the Doppler frequency. This relationship can therefore be computed in the simple case of a threshold model and then used more generally as an accurate approximation. This observation leads to a unified approach for the channel modeling, and to a simplified performance analysis of upper layer protocols     

Rate-adaptive transmission over correlated fading channels

In this paper, we investigate link adaptation and incremental redundancy (IR) retransmission schemes over correlated wireless channels. While computer simulations have been used to study the performance of these techniques, a numerically tractable analytical approach is more desirable to analyze generic protocols, and to reveal insights into the performance tradeoffs. An error-recursion approach is developed in this paper to mathematically analyze the throughput, delay, and energy efficiency of rate-adaptation techniques over fading channels with arbitrary correlations between retransmissions. Using Reed-Solomon codes as an example, we quantitatively predict the performance tradeoff of throughput and latency for IR schemes and the performance dependency on the channel correlation. Numerical results also show that reactive rate-adaptation schemes with IR retransmission outperform proactive rate-adaptive schemes, even with perfect channel side information, in terms of throughput and energy efficiency.     

Orthogonal superimposed training design for block transmission over frequency‐selective fading channels

Channel estimation for single‐carrier block transmission over frequency‐selective fading channel using superimposed training is addressed. A novel affine precoding model based on orthogonal polyphase sequence set is designed to decouple channel estimation from symbol detection. The orthogonal constraints on the training and precoding matrices ensure the separation of superimposed signals and accurate channel estimation with less training overheads as compared with time‐multiplexed scheme. Simulation results show that the proposed scheme exhibits good performance and outperforms another data‐dependent superimposed training scheme, especially for compact constellations or channel with long delay‐spread. Copyright © 2014 John Wiley & Sons, Ltd.     

Adaptive hierarchical modulation for simultaneous voice and multiclass data transmission over fading channels

In this paper, a new technique for simultaneous voice and multiclass data transmission over fading channels using adaptive hierarchical modulation is proposed. According to the link quality, the proposed scheme changes the constellation size as well as the priority parameters of the hierarchical signal constellations and assigns available subchannels (i.e., different bit positions) to different kinds of bits. Specifically, for very bad channel conditions, it only transmits voice with binary phase-shift keying (BPSK). As the channel condition improves, a variable-rate adaptive hierarchical M-ary quadrature amplitude modulation (M-QAM) is used to increase the data throughput. The voice bits are always transmitted in the lowest priority subchannel (i.e., the least significant bit (LSB) position) of the quadrature (Q) channel of the hierarchical M-QAM. The remaining (log/sub 2/M-1) subchannels, called data subchannels, are assigned to two different classes of data according to the selected priority parameters. Closed-form expressions as well as numerical results for outage probability, achievable spectral efficiency, and average bit error rate (BER) for voice and data transmission over Nakagami-m fading channels are presented. The adaptive techniques employing hybrid binary shift keying (BPSK)/M-ary AM (M-AM) and uniform M-QAM for simultaneous voice and two different classes of data transmission are also extended. Compared to the extended schemes, the new proposed scheme is spectrally more efficient for data transmission, while keeping the same outage probability for voice and data (both classes) as the scheme employing BPSK/M-AM. The new scheme also provides, as a by-product, a spectrally efficient way of transmitting voice and a single-class data.     

频率选择性信道下单载波空时分组编码传输系统中的信道估计技术

在频率选择性信道下给出了单载波频域均衡系统结合空时分组编码传输基于训练序列的最优信道估计算法。由于选取具有恒幅特性的Chu序列作为训练序列,因此这一算法能够实现信道估计的最小均方误差,并作了理论证明。最后,对本方案的性能进行了仿真比较,仿真的结果证实了本方案的优点。     

Construction of block modulation codes over rings for fading channels

A new methodology is described for construction of block coded modulation (BCM) over modulo-8 rings for fading channels. Code construction criteria are defined to obtain the maximum use of channel characteristics and to achieve the phase invariance property. Some code examples are presented.<>     

瑞利衰落下的空时频(STF)分组编码OFDM系统

基于正交频分复用(OFDM)系统，提出了一种发射分集方案——比特交织空时频(BI—STF)分组编码。其基本思路是：应用子载波分群方法并选择合适的系统参数，将OFDM系统转化成分群OFDM(G-OFDM)，对每个群分别进行空时频分组编码(GSTFBC)；在编码比特被重组和映射成GSTF分组编码前进行合理的比特交织，并按一定的规则分配给各个单群子载波进行酉星座旋转(CR)预编码。随后讨论了该方案的频谱利用率和成对错误概率(PEP)。仿真结果表明，同其它编码方案相比，提出的方案能在频率选择性瑞利衰落信道下获得最大的空间分集和频率分集增益，且只有较低的解码复杂性。     

Error protection for progressive image transmission over memorylessand fading channels

Product channel codes are proposed to protect progressively compressed and packetized images for noisy channels. Within packets, the product code uses the concatenation of a rate-compatible punctured convolutional code and an error detecting parity check code. Across packets, Reed-Solomon codes are used. Benefits include flexible choice of delay, adaptability of error protection level (i.e., unequal error protection), and scalable decoding complexity. The system outperforms the best known image coders for memoryless channels and performs well on fading channels     

Signal detection for non-orthogonal space-time block coding over time-selective fading channels

In the case of non-quasi-static (i.e., time-selective fast fading) channels, which do exist in practice, the performance of the existing NO-STBC detectors can suffer from an irreducible error floor. To this end, this letter proposes a zero-forcing-based signal detector, which is not only computationally simple but also highly effective in mitigating the impact of channel variation on system performance.     

Error probability for orthogonal space-time block code diversity system using rectangular QAM transmission over Rayleigh fading channels

In this paper, theoretical symbol error probability (SEP) expressions are derived for orthogonal space-time block code (OSTBC) diversity systems employing arbitrary rectangular M-QAM transmission over flat Rayleigh fading channels. Independent fading between diversity channels is assumed. Channel average powers may be distinctive, identical, or mixed with both. The rectangular M-QAM results are extended to square M-QAM, M-PAM, and binary antipodal signaling. All derived expressions are in elementary forms without complicated high-order transcendental functions and unevaluated integrals and, hence, are strictly exact and can be readily simulated by the computer. Moreover, it is shown that mixed Rayleigh fading results can be readily extended to various Nakagami-m fading results. A four-transmit-antenna system with a half-rate OSTBC for 16-QAM signaling is used to demonstrate that the theoretical result is in excellent agreement with the Monte Carlo simulated result. From simulation curves, it is shown that, under the independent channel fading condition, channels with identical powers have better error rate performance than channels with distinctive powers.     

衰落信道上空频分组码的性能分析

对于任意抽头数的多输入多输出(MIMO)频率选择性Nakagami衰落信道,利用矩生成函数(MGF)方法和高斯Q函数的指数近似表达式,推导采用矩形M进制正交幅度调制(MQAM)的空频分组编码(SFBC)正交频分复用(OFDM)系统的平均误符号率(SER)性能的精确和近似解析表达式。数值计算和仿真结果证明了理论分析的正确性和近似分析的准确性。     

Nakagami-m衰落信道下空时分组码的性能估计

基于等效单输入单输出SISO (Single-input Single-output) 模型,利用矩量母函数 (MGF) 分析法,空时分组码STBC (Space-Time Block Coding) 的误符号率是可以得到其准确闭式表达式的.对于独立同分布Nakagami-m衰落信道下的空时分组码的性能进行了研究,给出了采用M-PSK 和M-QAM调制方案的不同空时分组编码矩阵误符号率的闭式解以及基于闭式解的解析性能结果,通过蒙特卡洛仿真验证了闭式解的准确性.还从调制方案的角度对于几种新的空时分组码的性能进行了一些新的讨论.     

Optimal training for block transmissions over doubly selective wireless fading channels

High data rates give rise to frequency-selective propagation, whereas carrier frequency-offsets and mobility-induced Doppler shifts introduce time-selectivity in wireless links. To mitigate the resulting time- and frequency-selective (or doubly selective) channels, optimal training sequences have been designed only for special cases: pilot symbol assisted modulation (PSAM) for time-selective channels and pilot tone-assisted orthogonal frequency division multiplexing (OFDM) for frequency-selective channels. Relying on a basis expansion channel model, we design low-complexity optimal PSAM for block transmissions over doubly selective channels. The optimality in designing our PSAM parameters consists of maximizing a tight lower bound on the average channel capacity that is shown to be equivalent to the minimization of the minimum mean-square channel estimation error. Numerical results corroborate our theoretical designs.     

Outage probability of multihop transmission over Nakagami fading channels

We present a general analytical framework for the evaluation of the end-to-end outage probability of multihop wireless communication systems with nonregenerative relays over Nakagami fading channels. It is shown that the presented results can either be exact or tight lower bounds on the performance of these systems depending on the choice of the relay gain. More specifically, we obtain a closed-form expression for the moment generating function of the reciprocal of the end-to-end signal-to-noise ratio (SNR) and we then use this expression to calculate the outage probability via numerical inversion of the Laplace transform. Numerical examples show that regeneration is more crucial at low average SNR and for multihop systems with a large number of hops.     

Bit-interleaved coded modulation with iterative decoding using constellation shaping over Rayleigh fading channels

We propose to investigate the performance of bit-interleaved coded modulation with iterative decoding (BICM-ID) over Rayleigh fading channel by using constellation shaping (CS). The (CS) is implemented by inserting shaping block codes between mapping and channel coding functions, in order to generate non-equiprobable distribution of a 16-ary QAM signal constellation. Simulation results carried out on 2-bit/s/Hz 16-QAM BICM-ID indicate that is possible to obtain a gain of 1.2 dB at a BER of 10^-3 compared to the equiprobable 16-QAM BICM-ID schemes. It is also shown that, the error floor level can reduced by applying the signal space diversity technique.     

Still image transmission using ARQ over Rayleigh fading channels

The authors propose a new ARQ scheme suitable for image transmission over radio channels. The proposed scheme detects only serious degradation and so attains higher throughput performance than the conventional ARQ scheme     

On rate control of packet transmission over fading channels

In error controlled packet reception, a packet is received only if its error probability can be kept below a predetermined level. Error probability control is achieved by posing a minimum signal to noise ratio (SNR) threshold with corresponding packet internal coding scheme, which upper-bounds the packet data rate. We first consider packet transmission over a single-user wireless fading channel with additive Gaussian noise. We derive the optimal SNR threshold that maximizes the communication throughput. We show under a set of generous conditions that the optimal SNR threshold in the low-SNR regime is proportional to the transmit power; the ratio depends neither on the packet internal coding scheme nor on the pre-determined error probability level. The result is then extended to packet multicasting where common information is transmitted to a group of receivers over fading channels.     

A simple packet-transmission scheme for wireless data over fading channels

In this letter, we present a simplified scheduling scheme for packet transmission over a fading channel which is modeled as a finite-state block channel. We first address the optimal minimum power-transmission policy with constraints on both average delay and packet loss. The optimal policy requires a sophisticated table lookup for implementation. In order to alleviate this problem, we design a simplified transmission policy that is based on checking for three control parameters: a transmission-rate threshold; a channel-state threshold; and the transmission buffer size. Our results show that the minimum average power with the simplified scheme is very close to that achieved by the optimal policy. Further, modeling the simplified scheme via a single-server bulk-service queue, we derive approximations to the quality of service metrics, such as average power and delay, that allow for analytical insights into the policy design.     

On coding for block fading channels

This work considers the achievable performance for coded systems adapted to a multipath block-fading channel model. This is a particularly useful model for analyzing mobile-radio systems which employ techniques such as slow frequency-hopping under stringent time-delay or bandwidth constraints for slowly time-varying channels. In such systems, coded information is transmitted over a small number of fading channels in order to achieve diversity. Bounds on the achievable performance due to coding are derived using information-theoretic techniques. It is shown that high diversity can be achieved using relatively simple codes as long as very high spectral efficiency is not required. Examples of simple block codes and carefully chosen trellis codes are given which yield, in some cases, performances approaching the information-theoretic bounds     

Performance of coherent data transmission in frequency-selectiveRayleigh fading channels

The error probability of digital transmission through a frequency-selective channel with random multipath fading due to uncorrelated scatterers is calculated. The error probability is averaged with respect to the randomly varying delays, with a given delay power spectrum. Two coherent receivers, suboptimum without any knowledge of the channel and optimum with perfectly known channel, are compared. The results are applied to continuous-phase-modulation (CPM) signals