基于协方差反馈和空时分组码预编码的自适应QAM调制

基于多天线相关信道协方差反馈,提出一种低复杂度自适应正交幅度调制(QAM)机制以提高系统发送速率。根据最小误比特率(BER)准则,建立了最优空时分组码(STBC)预编码方案。并在保证系统可靠性要求下,针对不同的信道衰落条件选取合适的QAM星座图级别。结果表明所建议机制具有低实现复杂度、低反馈带宽开销和高数据流通率等优点。     

Power control for delay constrained multi‐channel communications using outdated CSI

In this paper, we study the power allocation scheme for a single user, multi‐channel system, e.g., orthogonal frequency‐division multiplexing (OFDM) systems, under time‐variant wireless fading channels. We assume the receiver feeds back perfectly estimated channel state information (CSI) to the transmitter after a processing delay. The objective of the power allocation is to maximize throughput subject to quality‐of‐service (QoS) constraint. The QoS measure of our consideration is a triplet of data rate, delay, and delay bound violation probability. A two‐step sub‐optimal power allocation scheme is proposed to address the impact of outdated CSI. In the first step, the total transmission power that can be used within one block is determined according to the summation of the channel gains of all the channels. In the second step, the total transmission power is allocated among all the channels. The proposed power control scheme is less sensitive to the feedback delay. Compared to the optimal power allocation scheme designed for the perfect CSI scenario, it has lower computational complexity while achieving comparable capacity. Copyright © 2010 John Wiley & Sons, Ltd.     

Distributed closed-loop spatial multiplexing for uplink multiuser systems

Focusing on the uplink, where mobile users (each with a single transmit antenna) communicate with a base station with multiple antennas, we treat multiple users as antennas to enable spatial multiplexing across users. Introducing distributed closed-loop spatial multiplexing with threshold-based user selection, we propose two uplink channel-assigning strategies with limited feedback. We prove that the proposed system also outperforms the standard greedy scheme with respect to the degree of fairness, measured by the variance of the time averaged throughput. For uplink multi-antenna systems, we show that the proposed scheduling is a better choice than the greedy scheme in terms of the average BER, feedback complexity, and fairness. The numerical results corroborate our findings.     

Power allocation for multi-antenna systems with space-time block coding in the presence of estimation error and delayed feedback

Based on imperfect channel state information with channel estimation error at the receiver and delayed feedback at the transmitter, a suboptimal power allocation (PA) scheme to minimize bit error rate (BER) under a power constraint is developed for beamforming multi-antenna systems with space-time block coding. The proposed scheme is based on a so-called compressed signal-to-noise ratio criterion, where a single compressed factor is utilized, and it can be used to generalize some existing schemes by setting the compressed factor to different forms. A closed-form compressed factor is derived to minimize the BER, and the resultant close-form expression of power allocation is attained. This closed-form expression is computational efficient and can obtain the BER performance close to the existing optimal approach which requires numerical search. Simulation results show that the proposed scheme can provide BER lower than the equal power allocation scheme. However, due to the impact of both estimation error and delayed feedback, it has performance degradation when compared to the PA scheme with estimation error or delayed feedback only.     

自适应Turbo-QAM编码调制及其在 平坦Nakagami衰落信道的吞吐量性能

本文提出了一种通用的自适应编码调制系统吞吐量性能分析方法.基于各固定编码调制方式的误码率(BER)性能,使每种编码调制方案对应于一个信道平均信噪比(SNR)范围,再应用拉格朗日函数法得到使自适应编码调制系统吞吐量性能最大的信噪比转换门限,可得到系统的平均吞吐量性能.数值分析结果表明,相对于自适应M进制正交幅度调制(MQAM),自适应Turbo编码MQAM系统吞吐量性能有显著提高,并且该性能受瞬时误码率要求的影响较小.Nakagami信道中,在相同平均信道信噪比条件下,随着m的增大,系统吞吐量性能提高缓慢.     

Distributed beamforming in wireless relay networks with quantized feedback

This paper is on quantized beamforming in wireless amplify-and-forward (AF) relay networks. We use the generalized Lloyd algorithm (GLA) to design the quantizer of the feedback information and specifically to optimize the bit error rate (BER) performance of the system. Achievable bounds for different performance measures are derived. First, we analytically show that a simple feedback scheme based on relay selection can achieve full diversity. Unlike the previous diversity analysis on the relay selection scheme, our analysis is not aided by any approximations or modified forwarding schemes. Then, for highrate feedback, we find an upper bound on the average signalto- noise ratio (SNR) loss. Using this result, we demonstrate that both the average SNR loss and the capacity loss decay at least exponentially with the number of feedback bits. In addition, we provide approximate upper and lower bounds on the BER, which can be calculated numerically.We observe that our designs can achieve both full diversity as well as high array gain with only a moderate number of feedback bits. Simulations also show that our approximate BER is a reliable estimation on the actual BER. We also generalize our analytical results to asynchronous networks, where perfect carrier level synchronization is not available among the relays.     

Threshold-Based Substream Selection for Closed-Loop Spatial Multiplexing

We propose a low-complexity closed-loop spatial multiplexing method with limited feedback over multi-input-multi-output (MIMO) fading channels. The transmit adaptation is simply performed by selecting transmit antennas (or substreams) by comparing their signal-to-noise ratios to a given threshold with a fixed nonadaptive constellation and fixed transmit power per substream. We analyze the performance of the proposed system by deriving closed-form expressions for spectral efficiency, average transmit power, and bit error rate (BER). Depending on practical system design constraints, the threshold is chosen to maximize the spectral efficiency (or minimize the average BER) subject to average transmit power and average BER (or spectral efficiency) constraints, respectively. We present numerical and Monte Carlo simulation results that validate our analysis. Compared to open-loop spatial multiplexing and other approaches that select the best antenna subset in spatial multiplexing, the numerical results illustrate that the proposed technique obtains significant power gains for the same BER and spectral efficiency. We also provide numerical results that show improvement over rate-adaptive orthogonal space-time block coding, which requires highly complex constellation adaptation. We analyze the impact of feedback delay using analytical and Monte Carlo approaches. The proposed approach is arguably the simplest possible adaptive spatial multiplexing system from an implementation point of view. However, our approach and analysis can be extended to other systems using multiple constellations and power levels.     

Optimum mode-switching-assisted constant-power single- and multicarrier adaptive modulation

A set of optimum mode-switching levels is derived for a generic constant-power adaptive-modulation scheme based on a closed-form expression of the average bit error ratio (BER) and the average bits-per-symbol (BPS) throughput of the adaptive-modulation scheme. This results in a constant BER, variable-throughput arrangement. The corresponding BPS throughput performance and the achievable signal-to-noise ratio (SNR) gain are investigated for the optimum mode-switching assisted constant-power adaptive-modulation schemes employing various diversity schemes, including maximal ratio combining (MRC) receive-antenna diversity, a two-dimensional RAKE receiver, as well as transmit-diversity aided space-time (ST) coding, when communicating over various fading scenarios. The BPS throughput of our constant-power adaptive quadrature amplitude modulation (AQAM) scheme approaches the throughput of variable-power variable-rate AQAM within 1 dB. However, the achievable throughput gain of the adaptive-modulation scheme, in comparison to conventional fixed-mode modems, is substantially reduced as the diversity order of the receiver is increased. Hence, adaptive modulation constitutes a lower complexity alternative to multiple-transmitter and receiver-based systems when considering the range of techniques that can be used for mitigating the effects of the channel-quality fluctuations imposed by wireless channels.     

Relay Selection Algorithm with Simplified Precoding for MIMO Multiple Relay Channels

Considering an Amplify-and-Forward (AF) cooperative network with the help of multiple relay nodes, a relay selection algorithm with simplified precoder is proposed for the two-hop relay channels. This new algorithm based on the approximate received signal-noise rate (SNR), which chooses only one relay with the maximal received SNR gain to assist in transmission, can significantly reduce the required system consumption, achieve excellent bit-error-rate (BER) and average throughput, and maintain full diversity order. Simulation results demonstrate that the performance of the proposed scheme with a low complexity approaches to the optimal iteration method. And for practical situation with distance attenuation factor, the performance gain of our scheme is also in evident.     

Spreading and power allocation for multiple antenna transmission using decorrelating receivers

We propose a new scheme for multiple antenna transmission in the context of spread-spectrum signaling. The new scheme consists of using shifted Gold sequences to modulate independent information on the multiple antennas. We show that this strategy of using multiphase spreading (MPS) on different antennas greatly improves the throughput over currently known spread-spectrum multiple-antenna methods. We also find the optimal power allocation strategy among multiple transmit antennas for a fixed rate of channel state information, which might be provided via a feedback link, at the transmitter. We demonstrate the differences in optimal power distribution for maximizing capacity and minimizing probability of outage. When the transmission from the two antennas uses orthogonal spreading, we find that optimizing the power does not give much gain over the equal power transmission. However, when the transmissions are not orthogonal as in the case of MPS, then allocating power to maximize throughput gives considerable gain over equal power transmission. We also consider the effect of imperfections in the feedback channel on the optimal power allocation and show that our power allocation scheme is robust to feedback errors.     

Delay constrained throughput optimisation with imperfect CSI using discrete adaptive power

Link adaptation is an effective tool to overcome fading effects in wireless links. However, time-varying adaptive transmission rate leads to queueing delay, and moreover, in practise, imperfect channel state information (CSI) is available for the transmitter to adapt its transmission rate and power. This article aims to consider practical constraints to enhance the link adaptation scheme. We reformulate and optimise buffer delay constrained throughput of a wireless link based on outdated noisy CSI. Discrete power adaptation is proposed, in which a limited number of feedback bits (just the index of transmission power level) is required, while the performance is improved compared to the constant power and is close to continuous adaptive power. A unified scheme is set-up, where constant, discrete or continuous adaptive power transmission is utilised considering average or instantaneous bit error rate constraints based on imperfect CSI. The effectiveness of our designs is evaluated by numerical evaluations.     

Performance of Two‐User Two‐Way Amplify‐and‐Forward Relaying Systems with Scheduling

In this paper, we study scheduling schemes for two‐user two‐way wireless relaying systems. Two transmission modes are considered: point‐to‐point direct transmission and two‐way amplify‐and‐forward relaying. An optimal scheduling scheme that opportunistically selects the best transmission mode for each user is proposed to minimize the sum bit error rate (BER). The performance lower bound of the optimal scheduling scheme is analyzed, and closed‐form expression of the lower‐bound BER is derived. However, for optimal scheduling, the scheduler requires the knowledge of channel state information (CSI) of all links. To reduce the feedback information of CSI, we also propose a suboptimal scheduling scheme that selects the transmission mode using only the CSI of two direct links. Simulation results show that there are 4 dB to 8 dB gains for the proposed optimal and suboptimal schemes over the fixed direct transmission and fixed two‐way relayed transmission scheme. The performance gap between the optimal and suboptimal scheduling schemes is small, which implies a good trade‐off between implementation complexity and system performance.     

Protocol configuration and verification of an adaptive errorcontrol scheme over analog cellular networks

A high-speed and error-free voiceband data communication method using a hybrid automatic repeat request (ARQ) protocol over an analog cellular system is described. The present method adopts an adaptive error control scheme. This error control scheme automatically selects the optimal error correction code according to circuit bit error rate (BER), so as to match it to the frequently changing mobile radio propagation path conditions. This method adopts multiframe rejection as a retransmission scheme for a high throughput efficiency on the burst error circuit. Actual field evaluation was made by mounting this protocol on a CCITT V.22 bis modem with a data transmission speed of 2400 b/s and a modulation method using 16 carrier states over the Advanced Mobile Phone Service (AMPS) in Atlanta, GA, verifying that data communications can be achieved with an average throughput efficiency of 70% over a radio channel having a BER up to 10^-2     

Power allocation in cognitive radio networks with cooperative spectrum sensing

This paper studies power allocation among cooperative nodes (CNs) and secondary user (SU) under the assumption that only mean channel gains are available. We aim to find the power allocation that maximizes the SU average throughput under the constraints of the total power and individual transmission power for CN. We also consider the requirement on cooperative spectrum sensing with target miss-detection probability. Due to the high computational complexity of the optimal solution, we derive a near-optimal solution with low complexity while satisfying the requirements on transmission power and miss-detection probability. Moreover, the closed-form expression of approximation of power ratio is presented. Finally, numerical results verify our analysis and show that the proposed scheme achieves significant performance gain over others, and closes to the optimal solution.     

Performance analysis of variable rate: symbol-by-symbol adaptivebit interleaved coded modulation for Rayleigh fading channels

A challenging problem for a high-speed data service over wireless is to protect data over the error-prone fading channel in an effective way (high-bandwidth efficiency). We propose a bandwidth-efficient error correction scheme, namely variable rate adaptive bit interleaved coded modulation (ABICM), for the wireless mobile channel. The code rate and modulation level are varied according to the current channel state to exploit the time-varying nature of the wireless channel. Design challenges to achieve symbol-by-symbol adaptation are addressed. In particular, we address the criteria for choosing the family of component codes for the ABICM system. We propose a multilevel puncturing scheme that solves the problem of symbol-by-symbol adaptive puncturing and interleaving. The equivalent distance spectrum for variable rate symbol-by-symbol adaptive codes is introduced and analytical bounds on adaptive codes are derived that enable us to determine the optimal adaptation thresholds. Two operation modes, namely constant throughput and constant bit error rate (BER) controls, are proposed. It is found that there are significant gains relative to fixed-rate coding in terms of signal-to-noise ratio (SNR) and throughput. It is also found that the ABICM scheme is essentially not degraded when used with small interleaving depths. This makes the ABICM very suitable for real-time applications     

An adaptive modulation scheme for simultaneous voice and datatransmission over fading channels

We propose a new adaptive modulation technique for simultaneous voice and data transmission over fading channels and study its performance. The proposed scheme takes advantage of the time-varying nature of fading to dynamically allocate the transmitted power between the inphase (I) and quadrature (Q) channels. It uses fixed-rate binary phase shift keying (BPSK) modulation on the Q channel for voice, and variable-rate M-ary amplitude modulation (M-AM) on the I channel for data. For favorable channel conditions, most of the power is allocated to high rate data transmission on the I channel. The remaining power is used to support the variable-power voice transmission on the Q channel. As the channel degrades, the modulation gradually reduces its data throughput and reallocates most of its available power to ensure a continuous and satisfactory voice transmission. The scheme is intended to provide a high average spectral efficiency for data communications while meeting the stringent delay requirements imposed by voice. We present closed-form expressions as well as numerical and simulation results for the outage probability, average allocated power, achievable spectral efficiency, and average bit error rate (BER) for both voice and data transmission over Nakagami-m fading channels. We also discuss the features and advantages of the proposed scheme. For example, in Rayleigh fading with an average signal-to-noise ratio (SNR) of 20 dB, our scheme is able to transmit about 2 bits/s/Hz of data at an average BER of 10 ^-5 while sending about 1 bit/s/Hz of voice at an average BER of 10^-2     

Reduced-feedback linear precoding with stable performance for the time-varying MIMO broadcast channel

This work explores the performance of a multiple-input multiple-output broadcast channel where both the transmitter and receivers have outdated channel knowledge due to node motion or other time-variations in the communication channel. A performance analysis based on measured channel responses reveals significant throughput degradation for optimal linear and nonlinear precoding strategies unless the channel state information (CSI) is frequently fed back to the transmitter. The paper then develops a linear beamforming precoding strategy based on channel distribution information in the form of a full spatial correlation matrix for each user. This algorithm is shown to provide highly stable communication, with a throughput that is higher than that for optimal precoders operating on outdated CSI, in a time-variant environment, indicating that this approach can operate with significantly reduced feedback frequency. Furthermore, the paper demonstrates the use of the well-known Kronecker and Weichselberger models to parameterize the full correlation matrix to enable further reduction in the amount of feedback data required for implementation of the new beamforming technique.     

有限反馈预编码优化中基于性能准则的码字选择

多输入多输出(MIMO)空分复用系统中,采用有限比特反馈方式设计最优预编码矩阵,使用较少的反馈开销,可以有效地提高系统性能。对于有限反馈预编码设计方案,提出了一种基于Qos准则的码字选择方法,以最优化系统MSE性能和BER性能为目标选择最佳码字。仿真结果表明,与已有的码字选择方式相比,本文提出的方法更加直接,对于各种码本具有通用性,而且进一步改善了有限比特反馈预编码的性能,系统BER值降低了1.5 dB。     

Power adaptation for BPSK signaling with average and peak power constraints in Rayleigh fading channels

We consider power adaptation strategies for binary phase-shift keying signals in Rayleigh fading channels under the assumption that channel state information is provided at both the transmitter and the receiver. We first derive a closed-form expression for the optimal power adaptation that minimizes average bit-error rate (BER) subject to average and peak transmission power constraints. Then, we analyze the average BER for channel inversion power adaptation with the same constraints. Our results show that the performance difference between the optimal power adaptation and the channel inversion becomes negligibly small as available average transmission power increases and/or peak-to-average power ratio decreases. We also find that an optimal peak-to-average power ratio exists that minimizes the average BER in the channel inversion scheme.     

Transmit power allocation for a downlink two-user interference channel

We develop the optimal transmit power allocation scheme that maximizes the total throughput for a downlink two-user interference channel. The derived optimal scheme allocates the total power to one user in better channel state, as in the greedy scheme, when the degree of interference between users exceeds a certain threshold. When it is less than the threshold, on the contrary, the transmit power is divided into two users, as in the water-filling scheme. Numerical results are presented to verify the optimality of the derived scheme and to show throughput gains over the greedy and water-filling schemes.