Adaptive precoding and power allocation in distributed antenna systems with limited feedback

This paper introduces the limited feedback precoding into the distributed antenna system and proposes to adapt the predetermined orthogonal space time block codes to the available channel state information at the transmitter. The optimal representation of precoding information, namely the precoder, with least bits therefore becomes the key problem. Inspired by the characteristics of the distributed antenna system, we focus our work on the precoder construction, adaptable in response to the large and small scale fading, such that the symbol error probability is significantly reduced over that of a fixed, non‐adaptive, independent and identically distributed precoder codebook design. Furthermore, a suboptimal power‐loading strategy is presented by minimizing the derived tight upper bound on the average pairwise error probability of the precoded orthogonal space time block codes, which approaches the optimal performance asymptotically without additional channel knowledge other than the available feedback information. We prove that the proposed precoded orthogonal space time transmission scheme can achieve full diversity order. In particular, the robustness of our proposed transmission scheme to channel estimation error and feedback delay is respectively investigated in some detail, and numerical results show that it obviously improves the link reliability and obtains substantial gains even with few bits of feedback in comparison with conventional antenna selection scheme. Copyright © 2013 John Wiley & Sons, Ltd.     

基于不完美CSIT的MIMO系统线性预编码传输方案

使用一个基于统计信息的CSIT模型:动态CSIT模型(dynamic CSIT model).首先根据最小化平均误码率Pe的设计准则,建立凸优化问题,通过变量代换,使用标准的凸优化算法推导出最优的线性预编码器.在此基础上,提出一种正交STBC和线性预编码相结合的传输方案.仿真结果显示,该方案可获得良好的性能增益和强健的鲁棒性.     

On the comparisons of system performance and capacity of asynchronous STBC MC‐CDMA multirate access schemes

Three multirate access schemes, multicode, variable spreading gain (VSG), and spectral overlaid multiple‐symbol‐rate (MSR), for asynchronous space‐time block coded (STBC) multicarrier code division multiple access (MC‐CDMA) systems are proposed. The three possible spectral overlaid configurations for MSR systems are also investigated. The expressions to evaluate the multiple access interferences, bit error rate (BER) performances, and system capacities of a antenna STBC MC‐CDMA using the three multirate access schemes are obtained. Transmit power allocation is adjusted according to the service rates and the number of active users in each service class to maintain the link quality and to improve the system capacity. Our numerical results show that systems with multicode access scheme using orthogonal Gold spreading codes and with VSG access scheme have similar system performance and capacity, and both perform in general better than systems with MSR access scheme of any spectrum configurations. In case when non‐orthogonal Gold codes are used, multicode access scheme shows degradation in the system capacity as compared to VSG, due to the presence of larger self‐interference (SI) among the codes used by each user. The achievable capacities for the three spectral overlaid configurations of MSR multirate systems are also compared. Copyright © 2007 John Wiley & Sons, Ltd.     

Unified Optimal Power Allocation Strategy for MIMO Candidates in 3GPP HSDPA

We compare the achievable throughput of time division multiple access (TDMA) multiple‐input multiple‐output (MIMO) schemes illustrated in the 3rd Generation Partnership Project (3GPP) MIMO technical report, versus the sum‐rate capacity of space‐time multiple access (STMA). These schemes have been proposed to improve the 3GPP high speed downlink packet access (HSDPA) channel by employing multiple antennas at both the base station and mobile stations. Our comparisons are performed in multi‐user environments and are conducted using TDMA such as Qualcomm's High Data Rate and HSDPA, which is a simpler technique than STMA. Furthermore, we present the unified optimal power allocation strategy for HSDPA MIMO schemes by exploiting the similarity of multiple antenna systems and multi‐user channel problems.     

Adaptive Channel‐Matched Extended Alamouti Space‐Time Code Exploiting Partial Feedback

Since the publication of Alamouti's famous space‐time block code, various quasi‐orthogonal space‐time block codes (QSTBC) for multi‐input multi‐output (MIMO) fading channels for more than two transmit antennas have been proposed. It has been shown that these codes cannot achieve full diversity at full rate. In this paper, we present a simple feedback scheme for rich scattering (flat Rayleigh fading) MIMO channels that improves the coding gain and diversity of a QSTBC for 2ⁿ (n = 3, 4,…) transmit antennas. The relevant channel state information is sent back from the receiver to the transmitter quantized to one or two bits per code block. In this way, signal transmission with an improved coding gain and diversity near to the maximum diversity order is achieved. Such high diversity can be exploited with either a maximum‐likelihood receiver or low‐complexity zero‐forcing receiver.     

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.     

Enhancing secrecy rates in a wiretap channel

Reliable communication imposes an upper limit on the achievable rate, namely the Shannon capacity. Wyner's wiretap coding ensures a security constraint and reliability, but results in a decrease of achievable rate. To mitigate the loss in secrecy rate, we propose a coding scheme in which we use sufficiently old messages as key and prove that multiple messages are secure with respect to all the information possessed by the eavesdropper. We also show that we can achieve security in the strong sense. Next, we study a fading wiretap channel with full channel state information of the eavesdropper's channel and use our coding/decoding scheme to achieve a secrecy capacity close to the Shannon capacity of the main channel (in the ergodic sense). Finally, we study a case where the transmitter does not have instantaneous information of the channel state of the eavesdropper, but only its distribution.     

Optimal precoder design for non‐regenerative multiple‐input multiple‐output cognitive relay systems with perfect and imperfect channel state information

This paper studies optimal precoder design for non‐regenerative multiple‐input multiple‐output (MIMO) cognitive relay systems, where the secondary user (SU) and relay station (RS) share the same spectrum with the primary user (PU). We aim to maximize the system capacity subject to the transmit power constraints at the SU transmitter (SU‐Tx) and RS, and the interference power constraint at the PU. We jointly optimize precoders for the SU‐Tx and RS with perfect and imperfect channel state information (CSI) between the SU‐Tx/RS and PU, where our design approach is based on the alternate optimization method. With perfect CSI, we derive the optimal structures of the RS and SU‐Tx precoding matrices and develop the gradient projection algorithm to find numerical solution of the RS precoder. Under imperfect CSI, we derive equivalent conditions for the interference power constraints and convert the robust SU‐Tx precoder optimization into the form of semi‐definite programming. For the robust RS precoder optimization, we relax the interference power constraint related with the RS precoder to be convex by using an upper bound and apply the gradient projection algorithm to deal with it. Simulation results demonstrate the effectiveness of the proposed schemes. Copyright © 2013 John Wiley & Sons, Ltd.     

Cooperative power allocation with partial channel information in multi‐cell multi‐user dual‐hop MIMO relay systems

This paper considers cooperative power allocation with the use of partial channel state information (CSI) in a multi‐user dual‐hop relay system with multiple antennas. The end‐to‐end capacity can be improved by dynamically allocating the transmit power of the base station and relay according to co‐channel interference caused by the adjacent relays. The proposed scheme allocates the transmit power in association with the eigenvalues and angle difference between the eigenvectors of transmit correlation matrices of the desired and interference channel. It is shown by means of upper‐bound analysis that the end‐to‐end capacity of the proposed scheme can be maximized in highly correlated channel environments when the principal eigenvectors of transmit correlation matrices of the desired and interference channel are orthogonal to each other. It is also shown that the proposed scheme is robust to the channel estimation error. Finally, the performance of the proposed scheme is verified by the computer simulation. Copyright © 2010 John Wiley & Sons, Ltd.     

Sum-rate maximization in MIMO NOMA system with imperfect CSI

In order to solve the problem of maximizing the sum rate under the constraints of transmission power limitation and users’ rates requirements,precoder and receiver were devised by combining multiple-input multiple-output (MIMO) and non-orthogonal multiple access (NOMA) based on imperfect channel state information (CSI).To take advantage of successive interference cancellation (SIC) techniques to eliminate interference from weak user’s signal,each data stream of the strong user needed to decode the corresponding weak user’s signal.Since the problem formed was non-convex,it was converted into the problem with the difference of two convex functions (D.C.) by using semi-positive definite programming and first-order Taylor expansion,and a penalty function was used to solve the constraint of the rank of the precoding covariance matrix.The simulation results show that compared with the orthogonal multiple access technology,the proposed D.C.algorithm can improve system sum rate.     

Precoding of space-time block coded signals for joint transmit-receive correlated MIMO channels

A memoryless linear precoder is designed for orthogonal space-time block codes (OSTBC) for improved performance over block-fading flat correlated Rayleigh fading multiple-input multiple-output (MIMO) channels. Original features of the proposed technique include 1) the precoder can handle both transmit and receive correlation, and 2) the precoder handles any arbitrary joint correlation structure, including the so-called Kronecker (non-Kronecker) correlation models. The precoder is designed to minimize a symbol error-based metric as function of the joint slowly-varying channel correlation coefficients, which are supposed to be known to the transmitter. Several useful properties of the optimal precoder are given, evidencing the impact of receive correlation on transmitter optimization in certain situations. An iterative fast-converging numerical optimization algorithm is proposed. Monte Carlo simulations over fading channels are used to validate our claims.     

A novel relay selection algorithm using ant colony optimization with artificial noise for secrecy enhancement in cooperative networks

Cooperative communication is one of the fastest growing research areas of today. It can efficiently mitigate the effect of shadowing and fading with the help of relays and proper relay selection technique. In this paper, a novel relay selection scheme combined with artificial noise (AN) is devised to enhance the secrecy of cooperative networks with amplify‐and‐forward scheme, over Rayleigh fading channels in the presence of a passive eavesdropper. The probability of path selection of ant colony optimization algorithm is used for selecting the best relay with high end‐to‐end signal‐to‐noise ratio. The probability of choosing a path depends on the significance of channel gain (G) and fading coefficients (h). The proposed algorithm finds the best relay in the following wireless scenarios: when (i) both channel gain and fading coefficients are significant; (ii) only fading coefficients are significant; and (iii) only channel gain is significant. Because the direct links between source and destination and source and eavesdropper are considered, AN along with the information is sent by both the source and the selected relay. The performance is evaluated based on secrecy rate (R_s); for the relays randomly placed between the source and destination and for different eavesdropper's location. The results show that the proposed relay selection scheme achieves better secrecy for different wireless scenarios compared with traditional schemes. With the help of AN, the secrecy rate can be made positive even when the eavesdropper lies near to source.     

Power allocation scheme based on sum capacity maximization for signal‐to‐leakage‐and‐noise ratio precoded multiuser multiple‐input single‐output downlink

This paper proposes a power allocation scheme to maximize the sum capacity of all users for signal‐to‐leakage‐and‐noise ratio (SLNR) precoded multiuser multiple‐input single‐output downlink. The designed scheme tries to explore the effect of the power allocation for the SLNR precoded multiuser multiple‐input single‐output system on sum capacity performance. This power allocation problem can be formulated as an optimization problem. With high signal‐to‐interference‐plus‐noise ratio assumption, it can be converted into a convex optimization problem through the geometric programming and hence can be solved efficiently. Because the assumption of high signal‐to‐interference‐plus‐noise ratio cannot be always satisfied in practice, we design a globally optimal solution algorithm based on a combination of branch and bound framework and convex relaxation techniques. Theoretically, the proposed scheme can provide optimal power allocation in sum capacity maximization. Then, we further propose a judgement‐decision algorithm to achieve a trade‐off between the optimality and computational complexity. The simulation results also show that, with the proposed scheme, the sum capacity of all the users can be improved compared with three existing power allocation schemes. Meanwhile, some meaningful conclusions about the effect of the further power allocation based on the SLNR precoding have been also acquired. The performance improvement of the maximum sum capacity power allocation scheme relates to the transmit antenna number and embodies different variation trends in allusion to the different equipped transmit antenna number as the signal‐to‐noise ratio (SNR) changes.Copyright © 2013 John Wiley & Sons, Ltd.     

Resource allocation in orthogonal frequency division multiple access‐based cognitive radio systems with minimum rate constraints

In this paper, resource allocation problem in orthogonal frequency division multiple access‐based cognitive radio (CR) systems to maintain minimum transmission rate constraints of CR users (CRUs) with the specified interference thresholds is investigated. Firstly, a single primary user (PU) CR system is considered, and a suboptimal resource allocation algorithm to maximize the sum transmission rate of all CRUs is proposed. Secondly, the single‐PU scenario is extended to multiple‐PU case, and an asymptotically optimal resource allocation algorithm is proposed using dual methods subject to constraints on both interference thresholds of PUs and total transmit power of all CRUs. Analysis and numerical results show that, in contrast to classical resource allocation algorithms, the proposed algorithm can achieve higher transmission rate and guarantee each CRU's minimum transmission rate in both scenarios. Copyright © 2012 John Wiley & Sons, Ltd.     

直接序列扩频分组映射码索引调制

针对直接序列扩频码索引调制发射端使用大量伪随机(PN)码的问题,提出了一种使用较少PN码的分组映射码索引调制方案.该方案在发射端并行设置多个调制子块独立进行幅相调制,同时集中选取各调制子块间同相、正交支路扩频所需的PN码,经索引值大小排序后依次扩频各调制子块中调制符号的同相、正交分量.分析和仿真结果表明,相同频谱效率条件下所提方案比直接序列扩频码索引调制方案使用的PN码个数更少,并在加性噪声信道下,信噪比高于10 dB时,保持着约1 dB的误比特率性能优势,并远优于空间调制在最优检测算法下的误比特率性能.     

Cross‐layer 1 and 5 user grouping/power allocation/subcarrier allocations for downlink OFDMA/NOMA video communications

Wang et al proposed cross‐layer resource allocation for orthogonal frequency division multiple access (OFDMA) video transmission systems. Unlike Wang et al, we add non‐orthogonal multiple access (NOMA) to the downlink OFDMA video transmission system and propose power allocation for users on each subcarrier (cluster) to minimize sum of video mean square error (MSE) to increase the peak signal‐to‐noise ratio (PSNR), the video quality. For OFDMA/NOMA video communication systems, we propose cross‐layer user clustering to reassign the subcarriers based on sum video distortion minimization and derive the optimal power allocation among NOMA users on the same subcarrier to minimize the sum video distortion. Numerical results show that the proposed scheme outperforms the previous OFDMA cross‐layer scheme by Wang et al by 2.2 to 4.5 dB in PSNR and previous OFDMA NOMA physical layer scheme by Ali et al by 2 to 4.4 dB in PSNR, when SNR = 15 dB, and the number of users is 6 to 12.     

Power allocation for downlink multiuser hybrid NOMA‐OMA systems: An auction game approach

Nonorthogonal multiple access (NOMA) is viewed as one of the key enabling candidate for the fifth‐generation systems. The effectiveness of such networks heavily relies on the power allocation. This paper addresses the problem of power allocation in a downlink multiuser hybrid NOMA‐orthogonal multiple access (OMA) network, where NOMA is integrated into OMA. Users with strong channel conditions are paired up with the users having weak channel conditions based on a random mechanism. Further, user pairs compete in an auction game for the transmit power being sold by the base station. Bids are placed iteratively by each user pair such that it maximizes their own utility. The existence of a unique Nash equilibrium has been proved theoretically. Simulation results show that the proposed scheme achieves higher average sum rate of users in comparison with that of the existing algorithms.     

Pre‐filtering technique for MAI cancellation in MC‐CDMA systems

Multicarrier code division multiple access (MC‐CDMA), is a promising multiplexing technique for future communication systems. In this study, we employ the well‐known Walsh‐Hadamard spreading codes for synchronous downlink transmission of MC‐CDMA systems. The spreading codes allow that the frequency diversity to be efficiently exploited. However, multipath propagation may cause orthogonality among users is distorted, and this distortion produces multiple access interference (MAI). To eliminate this effect, we propose a pre‐filtering‐based MC‐CDMA system which uses a pre‐filtering technique at the transmitter and an equal gain combining (EGC) scheme at the receivers, respectively. Our proposed pre‐filtering technique transforms the transmitted signals so that the MAI can be eliminated, and the EGC scheme weights the signals received from all subcarriers so that channel distortions can be compensated. Furthermore, the proposed technique can calculate the transmitted power over all subcarriers to satisfy the required quality of service of each user and archive MAI‐free. In this paper, performance in terms of bit error rate is analyzed; in comparison with the EGC, orthogonal restoring combining, and maximal ratio combining schemes at receiver, respectively. Copyright © 2011 John Wiley & Sons, Ltd.     

和速率约束下衰落高斯MIMO广播信道的和功率优化

 本文研究了在系统和速率一定的条件下有着高斯噪声的衰落MIMO广播信道和功率最小化问题.该问题通常存在于无线通信系统动态资源分配中,是和功率约束下衰落MIMO下行链路和速率最大化的互补问题.首先利用MIMO MAC和MIMO BC的对偶性,将问题描述和转化为凸最优化问题,在此基础上,利用子梯度法和二分法,设计了相应的快速迭代的多用户注水算法,用于计算基站的发射功率.理论分析和数值仿真结果表明,该算法全局有效地收敛于最小的和功率.     

Nelder‐Mead–based power optimization for secrecy enhancement in amplify‐and‐forward cooperative relay networks

Cooperative communication based on relaying nodes has been considered as a promising technique to increase the physical layer security (PLS) performance in wireless communications. In this paper, an optimal power allocation (OPA) scheme based on Nelder‐Mead (NM) algorithm is proposed for improving the secrecy rate of amplify‐and‐forward (AF) cooperative relay networks employing cooperative jamming (CJ) scheme. The proposed hybrid jamming scheme allows the source and selected relay to transmit the jamming signal along with the information to confound the eavesdropper. The path selection probability of ant colony optimization (ACO) algorithm is used for selecting the relay for transmission. The performance based on secrecy rate is evaluated for “n” trusted relays distributed dispersedly between the source and destination. Gradient‐based optimization and three‐dimensional exhaustive search methods are used as benchmark schemes for comparison of the proposed power optimization algorithm. The secrecy performance is also compared with conventional AF scheme and CJ scheme without power optimization (EPA). The impact of single and multiple relays on secrecy performance is also evaluated. Numerical results reveal that, compared with the gradient method and exhaustive search algorithm, the proposed power allocation strategy achieves optimal performance. Also, the derived OPA results show a significantly higher secrecy rate than the EPA strategy for both CJ and AF schemes.