基于多中继导频频分复用的协同通信系统信道估计算法

本文针对频率选择性衰落环境下结合正交频分复用技术的放大转发多中继协同通信系统,提出了基于导频频分复用的频域信道估计算法,包括最小二乘（LS）估计算法和线性最小均方误差（LMMSE）估计算法。理论分析和仿真结果表明,该算法不仅成功分辨了多中继协同通信系统的所有频域信道衰落系数,避免了各中继节点转发的导频符号在目的节点上的混叠干扰,而且减少了频域信道估计所需的导频符号数量和时隙周期长度,提高了协同通信系统的传输效率和频谱利用率,同时显著提高了信道估计的精度,降低了算法的复杂度,具有较高的实用价值。      

Novel quantization‐based spectrum sensing scheme under imperfect reporting channel and false reports

In this paper, a novel sensing scheme, uniform quantization for cooperative sensing (UniQCS), that employs a uniform quantizer is proposed. UniQCS is based on energy detection and uses weight vector for global decision function. It performs better than hard decision algorithms such as majority and k‐out‐of‐n in terms of probability of detection and false alarm at the cost of a marginal increase in overhead bits under imperfect reporting channel and false reports. The probability of detection is maximized for a given probability of false alarm constraint by the proposed method. For detailed analysis, the UniQCS is compared with equal gain combiner scheme, which performs far better than hard decision algorithms, via highest bandwidth requirement. The proposed algorithm performs close to equal gain combiner. Moreover, the robustness of UniQCS to sensing error is analyzed when some nodes always report false decisions to the fusion center and the reporting channel is imperfect. For probability of false alarm equal to 0.01, performance gain of UniQCS is at least 45% compared with the other methods when there are two false reporting nodes. UniQCS performance gain is at least 15% compared with other methods for probability of reporting channel error equal to 0.001. Copyright © 2012 John Wiley & Sons, Ltd.     

Impact of co‐channel interference on performance of dual‐hop wireless ad hoc networks over α−μ fading channels

In this work, we investigate the performance of a dual‐hop cooperative network over α?μ fading channels with the presence of co‐channel interference (CCI) at both the relay and destination nodes. Amplify‐and‐forward (AF) relaying is considered in the relay node. The upper bound of the signal‐to‐interference‐plus‐noise ratio (SINR) of the dual‐hop relay link is used to determine the system performance. The probability density function (PDF) and the cumulative distribution function (CDF) of the upper bound of the SINR are analyzed. The system performance is determined in terms of the outage and error probabilities. Numerical results are used to present the performance analysis of the system.     

分布式空频编码协同通信系统中基于导频辅助的频域信道估计算法

针对频率选择性衰落信道下的分布式空频编码协同通信系统,提出了基于导频辅助的各种频域信道估计算法,包括最小二乘、线性最小均方误差、低阶近似线性最小均方误差算法,并给出了相应的均方误差性能表达式.理论分析和仿真结果表明本文提出的信道估计算法在协同通信系统中具有很高的实用性和精确度.     

Outage and ergodic sum‐rate performance of cooperative MIMO‐NOMA with imperfect CSI and SIC

In this paper, we examine a half‐duplex cooperative multiple‐input multiple‐output non‐orthogonal multiple access system with imperfect channel state information (CSI) and successive interference cancelation. The base station (BS) and mobile users with multi‐antenna communicate by the assistance of a CSI based or fixed gain amplify‐and‐forward (AF) relay with a single antenna. The diversity schemes, transmit antenna selection, and maximal ratio combining are applied at the BS and mobile users, respectively. We study the system performance in terms of outage probability (OP) and ergodic sum‐rate. Accordingly, the exact OP expressions are first derived jointly for the CSI based and fixed gain AF relay cases in Nakagami‐m fading channels. Next, the corresponding lower and upper bound expressions of the OP are obtained. The high signal‐to‐noise ratio analyses are also carried out to demonstrate the error floor value resulted in the practical case and achievable diversity order and array gain in the ideal case. Moreover, the lower and upper bounds of the ergodic sum‐rate expressions are derived together for the CSI based and fixed gain AF relay cases. Finally, the Monte‐Carlo simulations are used to verify the correctness of the analytical results.     

OFDM系统导频信道估计算法的性能研究

研究基于块状导频的最小平方（LS）信道估计、线性最小均方误差（LMMSE）和低秩LMMSE信道估计算法,并进行了算法仿真,得出不同信道估计算法下正交频分复用（OFDM）系统误比特率（BER）和信噪比（SNR）之间的变化关系,以及在不同导频符号间隔下的误比特率曲线图。仿真结果表明：LMMSE、低秩LMMSE和LS算法的性能依次变差,且导频符号间隔对误比特率性能影响较大。     

Optimized cooperative spectrum sensing network analysis in nonfading and fading environments

The proposed cooperative spectrum sensing (CSS) network is equipped with multiple antennas and an improved energy detector (IED) scheme at each cognitive radio (CR). Each CR in the network receives the information about the primary user (PU) in the form of binary decisions at multiple antennas. Diversity technique called selection combining (SC) scheme is used at multiple antennas to select the maximum value of sensing information present at multiple antennas. Finally, sensing information will be passed to the fusion center (FC) through reporting channel, and the final decision about PU is made at FC using fusion rules. Initially, we have derived the novel missed detection probability expressions for AWGN channel, Rayleigh, and Rician fading environments. Later, the closed form of optimized expressions for proposed CSS network parameters are derived to achieve an optimal performance. The closed form of optimized expressions such as number of CR users (N_opt ), normalize threshold value (λ_n,opt ), and an arbitrary power of the received signal (p_opt ) are derived under various fading environments. The performance is evaluated using complementary receiver operating characteristics (CROC) and total error rate curves. The MATLAB‐based simulations are evaluated with the strong support of theoretical expressions. Finally, various simulation parameters such as sensing channel SNR, the error rate in reporting channel, threshold value, and number of antennas at each CR are considered in the simulation to show the effect on the performance of proposed CSS network.     

Detection performance of cooperative spectrum sensing with hard decision fusion in fading channels

In this paper, we investigate the detection performance of cooperative spectrum sensing (CSS) using energy detector in several fading scenarios. The fading environments comprise relatively less-studied Hoyt and Weibull channels in addition to the conventional Rayleigh, Rician, Nakagami-m and log-normal shadowing channels. We have presented an analytical framework for evaluating different probabilities related to spectrum sensing, i.e. missed detection, false alarm and total error due to both of them, for all the fading/shadowing models mentioned. The major theoretical contribution is, however, the derivation of closed-form expressions for probability of detection. Based on our developed framework, we present performance results of CSS under various hard decision fusion strategies such as OR rule, AND rule and Majority rule. Effects of sensing channel signal-to-noise ratio, detection threshold, fusion rules, number of cooperating cognitive radios (CRs) and fading/shadowing parameters on the sensing performance have been illustrated. The performance improvement achieved with CSS over a single CR-based sensing is depicted in terms of total error probability. Further, an optimal threshold that minimises total error probability has been indicated for all the fading/shadowing channels.     

Different sensing durations‐based cooperative spectrum sensing in cognitive radio systems

In order to provide more accurate detection of the primary user's activity in cognitive radio (CR) systems, cooperative spectrum sensing is proposed. The transmit diversity can also be employed by cooperative spectrum sensing to improve the performance of decision reporting. Hence, in the reporting channels between the cognitive users and the base station (BS), space time block code (STBC) scheme is considered in each cluster with time division multiple access (TMDA) method. In this paper, to improve the time efficiency in the case that one cluster makes sensing report, whereas the others do nothing but wait for their orders, we set each cluster with different sensing durations and the clusters will not stop the spectrum sensing until their results are reported. Furthermore, we also adopt the flexible sensing durations to decrease unnecessary energy consumption based on the clusters’ sensing sensitivities. Simulation results and analysis show the better detection performance and time efficiency of the proposed scheme. Copyright © 2012 John Wiley & Sons, Ltd.     

Intelligent threshold selection in fading environment of cognitive radio network: Advances in throughput and total error probability

One of the main challenges of spectrum sensing (SS) in the cognitive radio network (CRN) is selection of threshold for captivating the sensing decision, and such an issue becomes more challenging especially at low signal‐to‐noise ratio (SNR) because it affects the sensing performance and throughput of cognitive user (CU). However, the sensing decision of individual CU may not be accurate due to fading effects in the sensing environment, and significant improvement is accomplished with the cooperation of users. Therefore, in this paper, we have investigated the performance of energy detector SS (EDSS) technique in the CRN under fading environment with cooperative and noncooperative SS scenario. Further, we have introduced the concept of critical SNR ( γ _c ) to select the appropriate threshold and based on which the algorithms are proposed to enhance the throughput and reduce the total error (sensing error) probability of CU at different SNR (γ). From the results, we have accomplished that at the low SNR region (γ ≤ γ _c ), throughput is maximum with constant false‐alarm rate (CFAR) threshold selection approach in the cooperative scenario while in the high SNR region (γ >   γ _c ), its value is maximum with minimizing the error probability (MEP) threshold selection approach in the noncooperative scenario. Moreover, the sensing error is reduced with cooperation, and threshold selection with MEP approach outperforms CFAR approach for γ ≤ γ _c . Further, the proposed approach outperforms the other approaches in terms of throughput and sensing error (total error) probability in the Rayleigh and Nakagami‐m fading environments.     

An enhanced two‐phase SVM algorithm for cooperative spectrum sensing in cognitive radio networks

Cognitive radio (CR) networks have emerged recently to address the problem of spectrum scarcity. As reliable spectrum sensing (SS) is vital in low signal‐to‐noise ratio (SNR) for CR networks, we propose a novel method of enhancing support vector machines (SVM) classifier named as 2‐Phase SVM for the task of SS in a cooperative sensing structure. In this study, the vectors containing energy levels of primary users (PU) are considered as feature vectors and are fed into the classifier during training and test phase. First, the classifier is trained; afterward, the test feature vectors are labeled as channel available class or channel unavailable class in an online fashion by using 2‐Phase SVM, which is applied during two phases compared with the conventional SVM algorithm. The performance of suggested cooperative SS method is evaluated by receiver operating characteristic (ROC) curve and the functionality of our proposed algorithm is qualified in terms of misclassification error rate in addition to misclassification risk. The results reveal that 2‐Phase SVM outperforms previous methods since it not only increases the classification accuracy and reduces the misclassification risk but also enhances the detection probability.     

An intelligent cooperative sensing strategy with low overhead for cognitive radios

As is well known, cooperative sensing can remarkably improve the sensing accuracy by exploiting the spatial diversity of different secondary users. However, a large number of cooperative secondary users reporting their local decisions would induce great detection delay and traffic burden, which degrades the performance of secondary spectrum access. This paper proposes an intelligent cooperative sensing (ICS) strategy with selective reporting and sequential detection to enhance the sensing reliability as well as reduce the sensing overhead for cognitive radios. The tradeoff in the sensing time allocation is studied for ICS and then two novel fusion rules are developed to efficiently obtain the optimum sensing time allocation with different objectives. The performance of ICS is analyzed in terms of miss detection probability and average sensing time, where their closed‐form expressions are derived over Rayleigh fading channels. Simulation results reveal that ICS achieves higher sensing reliability with less sensing overhead than the traditional strategy. It is also shown that the miss detection probability and average sensing time of ICS can be minimized by optimizing the sensing time allocation. Copyright © 2013 John Wiley & Sons, Ltd.     

Double‐threshold cooperative detection for cognitive radio based on weighing

In cognitive radio (CR), the single‐threshold cooperative detection is sensitive to the noise power. In this paper, a double‐threshold cooperative detection scheme based on weighed combination is proposed to improve the global detected performance of the cooperative detection. The double thresholds that are decided by the restriction probability are adopted to divide the energy statistics observed by CRs into three subareas, and the detected performance of the CRs locating in the confusion area is fortified through the weighed data fusion by the coordinator. The CRs in the other two areas can make local binary decisions because of their exact sensing performance and then forward their 1‐bit decisions to the coordinator that will combine all the received decisions to give the final decision on the presence of the primary user. In this paper, both the periodic single‐band and wideband cooperative detections are investigated, and the probabilities of spectrum utilization by these two patterns are respectively analyzed. The simulation shows that the detection probability of the proposed scheme is better than that of the single‐threshold cooperative detection with decision fusion but slightly worse than that of the single‐threshold cooperative detection with data fusion. However, the average number of the bits sent to the coordinator by the proposed algorithm is less than that by the data fusion, and it may increase by the decreasing of the restriction probability. The simulation also shows that the periodic wideband sensing can obtain higher spectrum utilization than the periodic single‐band sensing. Copyright © 2012 John Wiley & Sons, Ltd.     

Comparative performance analysis of cooperative and multi dual‐hop relay networks using MGF approach

In this paper, we analyzed and compared the performance of cooperative diversity systems such as cooperative and multi dual‐hop networks with non‐regenerative relay nodes. The contributions of this study are twofolds. Firstly, analytical expressions of outage probability P_out and average symbol error rate ASER are derived using moment generating function (MGF) analysis of the received SNR with the assumption that the channel experiences Weibull fading and the best relay selection is used. Then, using the analytical results, comparative performance evaluation of cooperative and multi dual‐hop relay networks is done for varying number of relay nodes and different receive diversity schemes such as maximal ratio combining (MRC) and selection combining (SC). The results show that the cooperative relay network has better performance than a multi dual‐hop relay network in terms of P_out and ASER. The results also show that the multi dual‐hop network can achieve the same performance as the cooperative network with the requirement that it needs the deployment of three times more relay nodes.     

Turbo equalization of doubly selective channels

In this paper, turbo equalization for transmission over doubly selective channels is proposed. The maximum a posteriori probability (MAP) algorithm is used for channel detection as well as for channel decoding. The detection/decoding constituents can exchange soft information in an iterative manner resulting in the so‐called turbo equalization. The time‐varying multi‐path fading channel is modeled using the basis expansion model (BEM). In this BEM, the time‐varying channel is viewed as a bank of time‐invariant finite impulse response filters, and the time variation is captured by means of time‐varying complex exponential basis functions. Therefore, the time‐varying transition tables that characterize the time‐varying channel can also follow a similar BEM. The complexity of the MAP channel detector is rather prohibitive for practical applications. This motivates the search for lower‐complexity soft‐output channel detectors. For this purpose, soft‐output linear minimum‐mean square error (LMMSE)‐based channel detectors are proposed for single carrier as well as for multi‐carrier systems. With the use of Gaussian approximation, expressions for the a posteriori and extrinsic log‐likelihood ratios have been derived. The performance of the proposed turbo equalization schemes are evaluated using numerical simulations. Copyright © 2012 John Wiley & Sons, Ltd.     

Cognitive amplify‐and‐forward relay networks with beamforming under primary user power constraint over Nakagami‐m fading channels

In this paper, we analyze the performance of cognitive amplify‐and‐forward (AF) relay networks with beamforming under the peak interference power constraint of the primary user (PU). We focus on the scenario that beamforming is applied at the multi‐antenna secondary transmitter and receiver. Also, the secondary relay network operates in channel state information‐assisted AF mode, and the signals undergo independent Nakagami‐m fading. In particular, closed‐form expressions for the outage probability and symbol error rate (SER) of the considered network over Nakagami‐m fading are presented. More importantly, asymptotic closed‐form expressions for the outage probability and SER are derived. These tractable closed‐form expressions for the network performance readily enable us to evaluate and examine the impact of network parameters on the system performance. Specifically, the impact of the number of antennas, the fading severity parameters, the channel mean powers, and the peak interference power is addressed. The asymptotic analysis manifests that the peak interference power constraint imposed on the secondary relay network has no effect on the diversity gain. However, the coding gain is affected by the fading parameters of the links from the primary receiver to the secondary relay network. Copyright © 2012 John Wiley & Sons, Ltd.     

Interference management schemes for multi‐user cooperative wireless networks

Cooperative communication is a promising technique for future wireless networks. It can be used in improving communication reliability and enhancing spectrum efficiency by using the broadcast nature of radio communication and exploiting cooperative diversity. However, its performance gain degrades in the presence of co‐channel interference, which makes it essential to propose interference mitigation schemes. In this paper, we introduce three cooperative communication schemes with interference management for multi‐user cooperative wireless networks. The first scheme (best relay selection) is used as a performance benchmark because it completely avoids the interference problem by using the Frequency‐Division Multiple Access technique. The second scheme (best available relay selection) maximizes the received signal‐to‐noise ratio while keeping the interference levels below a certain threshold, and the third scheme (General Order Relay and User Selection) is based on iterative resource allocation algorithm. We derive exact closed‐form expressions of average bit error probability, outage probability, and average consumed power for the proposed schemes. Simulations are used to validate the analytical results. The results confirm the advantage of the proposed cooperation schemes in enhancing the system performance and improving the interference management. Copyright © 2015 John Wiley & Sons, Ltd.     

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.     

OFDM系统的导频信道估计方法的设计与性能分析

OFDM作为一种多载波的调制方式,在新一代移动通信中得到了非常广泛的应用。信道估计作为其中一种关键技术对系统性能有着十分重要的影响,因此设计一种具有可靠的性能同时又具有比较低的复杂度的估计方法就显得非常重要。本文基于这一目的采用了基于导频的信道估计方法,将LS算法,LMMSE算法,SVD-LMMSE算法应用于信道估计中,在具体的信道模型下对几种算法的性能进行了仿真实验,得到了在不同信噪比的情况下的误比特率变化曲线,并比较了3种算法的性能。     

Optimization of 2‐stage cooperative spectrum for cognitive radio networks using multi‐antenna energy detectors

Cooperative spectrum sensing, a kind of spectrum sensing scheme in cognitive radio (CR), uses multiple CR relays. To increase performance, this study uses multi‐antenna CR relays and beam‐forming reception. The required bandwidth for reporting channels in cooperative spectrum sensing is crucial. Two‐stage cooperative spectrum sensing is proposed to increase performance without increasing the required bandwidth. The cooperative spectrum sensing is also optimized to allow the CR networks to facilitate the best decision‐making. This study determines the detection performance when beam‐forming reception is used. Numerical simulations are used to validate the effectiveness of the method. It is shown that beam‐forming reception outperforms square‐law combining (SLC) for low SNR values. This study proposes a 2‐stage cooperative spectrum sensing method, which uses multi‐antenna CR relays and beam‐forming reception. The cooperative spectrum sensing is also optimized to allow the CR networks to facilitate the best decision‐making. Numerical simulations are used to validate the effectiveness of the method.