针对空间调制(spatial modulation,SM)系统中最优检测算法,即最大似然(maximum likelihood,ML)算法存在的高复杂度问题,提出了基于QRD-M(QR-decomposition with M-algorithm,QRD-M)算法的空间调制信号检测算法。该算法运用M算法树搜索策...针对空间调制(spatial modulation,SM)系统中最优检测算法,即最大似然(maximum likelihood,ML)算法存在的高复杂度问题,提出了基于QRD-M(QR-decomposition with M-algorithm,QRD-M)算法的空间调制信号检测算法。该算法运用M算法树搜索策略,每层只计算最优的M个分支,其性能近似最优且运算量较低,有利于硬件实现。但随着发收天线数增多,传统QRD-M算法的检测性能会下降并需要较长的算法执行时间。因此,采用并行检测的思想,提出了PQRD-M(parallel QRD-M,PQRD-M)检测算法。该算法在各个分支上分别独立地进行搜索,提高了执行效率。对所提出的算法进行了复杂度分析,并在不同天线数目和不同保留节点数下对其误码性能进行了仿真,结果表明,相比于QRD-M算法,PQRD-M算法以增加一定的计算量为代价,能显著地改善空间调制信号检测性能,同时还能节约硬件资源。展开更多
空间调制(SM)系统中性能最优的最大似然(ML)检测算法复杂度很高,用基于信道矩阵QR分解的M算法(QRD-M)可以降低复杂度,但传统QRD-M算法检测时,每层都保留固定的M个节点,仍会造成额外的计算量。针对传统QRD-M算法中存在的问题,提出一种低...空间调制(SM)系统中性能最优的最大似然(ML)检测算法复杂度很高,用基于信道矩阵QR分解的M算法(QRD-M)可以降低复杂度,但传统QRD-M算法检测时,每层都保留固定的M个节点,仍会造成额外的计算量。针对传统QRD-M算法中存在的问题,提出一种低复杂度的动态M值QRD-M检测算法——LC-QRD-dM。LC-QRD-dM算法利用设计的阈值与累积分支度量值进行比较,每层自适应地选择不超过M的保留节点数,相对于传统QRD-M算法以牺牲少量性能为代价大大降低了复杂度。接着又针对该改进算法在信道衰落较深时会产生较大误码率的问题,进一步提出一种基于信道状态的动态M值QRD-M检测算法——CS-QRD-dM。CS-QRD-dM利用LC-QRD-dM的原理,在低信噪比(SNR)时,每层根据阈值选择不小于M的保留节点数;在高信噪比时,每层则选择不超过M的保留节点数。理论分析和仿真结果表明:相比传统QRD-M,CS-QRD-dM在低信噪比时有约1. 3 d B的信噪比增益(误码率为10-2),以增加少量复杂度为代价,显著地改善了检测性能;在高信噪比时,其检测性能及复杂度与LC-QRD-dM相同。展开更多
QR Decompositon with an M-algorithm(QRD-M) has good performance with low complexity,which is considered as a promising technique in Multiple-Input Multiple-Output(MIMO) detections.This paper presented a simplified QRD...QR Decompositon with an M-algorithm(QRD-M) has good performance with low complexity,which is considered as a promising technique in Multiple-Input Multiple-Output(MIMO) detections.This paper presented a simplified QRD-M algorithm for MIMO Orthogonal Frequency Division Multiplexing(MIMO-OFDM) systems.In the proposed scheme,each surviving path is expanded only to partial branches in order to carry out a limited tree search.The nodes are expanded on demand and sorted in a distributed manner,based on the novel expansion scheme which can pre-determine the children's ascending order by their local distances.Consequently,the proposed scheme can significantly decrease the complexity compared with conventional QRD-M algorithm.Hence,it is especially attractive to VLSI implementation of the high-throughput MIMO-OFDM systems.Simulation results prove that the proposed scheme can achieve a performance very close to the conventional QRD-M algorithm.展开更多
为了满足电力线通信(power line communication,PLC)对更大容量和更广覆盖范围的需求,多输入多输出(multiple-input multiple-output,MIMO)技术已逐渐应用于PLC中,实现了高速率的数据传输,但MIMO-PLC信道具有严重的多径效应和频率选择...为了满足电力线通信(power line communication,PLC)对更大容量和更广覆盖范围的需求,多输入多输出(multiple-input multiple-output,MIMO)技术已逐渐应用于PLC中,实现了高速率的数据传输,但MIMO-PLC信道具有严重的多径效应和频率选择性衰减的特性,而且不同子载波的信道质量差异性大,使现有的信号检测算法不能获得良好的性能。提出一种基于条件数阈值选择的检测算法,利用信道矩阵的条件数来衡量信道质量的好坏,设置最佳条件数阈值,在信道条件数小于或者等于阈值时,选择CLLL-MMSE-SQRD检测算法,而在信道条件数大于阈值时,选择QRD-M检测算法。通过仿真验证,该算法能够达到最优检测算法的性能,而且在16QAM调制方式下,该算法复杂度相比于QRD-M检测算法降低了44%,且随着调制阶数的增加复杂度降低更为明显。展开更多
In this paper, we propose the receiver structure for Multiple Input Multiple Output (MIMO) Interleaved Single Carrier-Frequency Division Multiple Access (SC-FDMA) where the Frequency Domain Equalization (FDE) is first...In this paper, we propose the receiver structure for Multiple Input Multiple Output (MIMO) Interleaved Single Carrier-Frequency Division Multiple Access (SC-FDMA) where the Frequency Domain Equalization (FDE) is firstly done for obtaining the tentative decision results and secondly using them the Inter-Symbol Interference (ISI) is cancelled by ISI canceller and then the Maximum Likelihood Detection (MLD) is used for separating the spatially multiplexed signals. Furthermore the output from MLD is fed back to ISI canceller repeatedly. In order to reduce the complexity, we replace the MLD by QR Decomposition with M-Algorithm (QRD-M) or Sphere Decoding (SD). Moreover, we add the soft output function to SD using Repeated Tree Search (RTS) algorithm to generate soft replica for ISI cancellation. We also refer to the Single Tree Search (STS) algorithm to further reduce the complexity of RTS. By examining the BER characteristics and the complexity reduction through computer simulations, we have verified the effectiveness of proposed receiver structure.展开更多
For the time-frequency overlapped signals, a low-complexity single-channel blind source separation （SBSS） algorithm is proposed in this paper. The algorithm does not only introduce the Gibbs sampling theory to separ...For the time-frequency overlapped signals, a low-complexity single-channel blind source separation （SBSS） algorithm is proposed in this paper. The algorithm does not only introduce the Gibbs sampling theory to separate the mixed signals, but also adopts the orthogonal triangle decomposition-M （QRD-M） to reduce the computational complexity. According to analysis and simulation results, we demonstrate that the separation performance of the proposed algorithm is similar to that of the per-survivor processing （PSP） algorithm, while its computational complexity is sharply reduced.展开更多
文摘空间调制(SM)系统中性能最优的最大似然(ML)检测算法复杂度很高,用基于信道矩阵QR分解的M算法(QRD-M)可以降低复杂度,但传统QRD-M算法检测时,每层都保留固定的M个节点,仍会造成额外的计算量。针对传统QRD-M算法中存在的问题,提出一种低复杂度的动态M值QRD-M检测算法——LC-QRD-dM。LC-QRD-dM算法利用设计的阈值与累积分支度量值进行比较,每层自适应地选择不超过M的保留节点数,相对于传统QRD-M算法以牺牲少量性能为代价大大降低了复杂度。接着又针对该改进算法在信道衰落较深时会产生较大误码率的问题,进一步提出一种基于信道状态的动态M值QRD-M检测算法——CS-QRD-dM。CS-QRD-dM利用LC-QRD-dM的原理,在低信噪比(SNR)时,每层根据阈值选择不小于M的保留节点数;在高信噪比时,每层则选择不超过M的保留节点数。理论分析和仿真结果表明:相比传统QRD-M,CS-QRD-dM在低信噪比时有约1. 3 d B的信噪比增益(误码率为10-2),以增加少量复杂度为代价,显著地改善了检测性能;在高信噪比时,其检测性能及复杂度与LC-QRD-dM相同。
基金Supported by the ‘Transformation of Scientific and Technological Achievements Project’ funded by the Department of Science and Technology of Jiangsu province,P.R. China (BA2006076)
文摘QR Decompositon with an M-algorithm(QRD-M) has good performance with low complexity,which is considered as a promising technique in Multiple-Input Multiple-Output(MIMO) detections.This paper presented a simplified QRD-M algorithm for MIMO Orthogonal Frequency Division Multiplexing(MIMO-OFDM) systems.In the proposed scheme,each surviving path is expanded only to partial branches in order to carry out a limited tree search.The nodes are expanded on demand and sorted in a distributed manner,based on the novel expansion scheme which can pre-determine the children's ascending order by their local distances.Consequently,the proposed scheme can significantly decrease the complexity compared with conventional QRD-M algorithm.Hence,it is especially attractive to VLSI implementation of the high-throughput MIMO-OFDM systems.Simulation results prove that the proposed scheme can achieve a performance very close to the conventional QRD-M algorithm.
文摘为了满足电力线通信(power line communication,PLC)对更大容量和更广覆盖范围的需求,多输入多输出(multiple-input multiple-output,MIMO)技术已逐渐应用于PLC中,实现了高速率的数据传输,但MIMO-PLC信道具有严重的多径效应和频率选择性衰减的特性,而且不同子载波的信道质量差异性大,使现有的信号检测算法不能获得良好的性能。提出一种基于条件数阈值选择的检测算法,利用信道矩阵的条件数来衡量信道质量的好坏,设置最佳条件数阈值,在信道条件数小于或者等于阈值时,选择CLLL-MMSE-SQRD检测算法,而在信道条件数大于阈值时,选择QRD-M检测算法。通过仿真验证,该算法能够达到最优检测算法的性能,而且在16QAM调制方式下,该算法复杂度相比于QRD-M检测算法降低了44%,且随着调制阶数的增加复杂度降低更为明显。
文摘In this paper, we propose the receiver structure for Multiple Input Multiple Output (MIMO) Interleaved Single Carrier-Frequency Division Multiple Access (SC-FDMA) where the Frequency Domain Equalization (FDE) is firstly done for obtaining the tentative decision results and secondly using them the Inter-Symbol Interference (ISI) is cancelled by ISI canceller and then the Maximum Likelihood Detection (MLD) is used for separating the spatially multiplexed signals. Furthermore the output from MLD is fed back to ISI canceller repeatedly. In order to reduce the complexity, we replace the MLD by QR Decomposition with M-Algorithm (QRD-M) or Sphere Decoding (SD). Moreover, we add the soft output function to SD using Repeated Tree Search (RTS) algorithm to generate soft replica for ISI cancellation. We also refer to the Single Tree Search (STS) algorithm to further reduce the complexity of RTS. By examining the BER characteristics and the complexity reduction through computer simulations, we have verified the effectiveness of proposed receiver structure.
基金supported by the National Natural Science Foundation of China (61501084)
文摘For the time-frequency overlapped signals, a low-complexity single-channel blind source separation （SBSS） algorithm is proposed in this paper. The algorithm does not only introduce the Gibbs sampling theory to separate the mixed signals, but also adopts the orthogonal triangle decomposition-M （QRD-M） to reduce the computational complexity. According to analysis and simulation results, we demonstrate that the separation performance of the proposed algorithm is similar to that of the per-survivor processing （PSP） algorithm, while its computational complexity is sharply reduced.
