系统工程与电子技术
繫統工程與電子技術
계통공정여전자기술
SYSTEMS ENGINEERING AND ELECTRONICS
2015年
7期
1663-1669
,共7页
张新贺%吴金隆%门宏志%金明录
張新賀%吳金隆%門宏誌%金明錄
장신하%오금륭%문굉지%금명록
广义空间位移键控%二进制二次规划%全局最优性条件%检测算法
廣義空間位移鍵控%二進製二次規劃%全跼最優性條件%檢測算法
엄의공간위이건공%이진제이차규화%전국최우성조건%검측산법
generalized space shift keying (GSSK)%binary quadratic programming%global optimality condi-tions%detection algorithm
广义空间位移键控(generalized space shift keying,GSSK)技术作为大天线技术和绿色通信技术相融合的优选方案受到了业界的广泛兴趣,其特点是在每一时刻只激活几根天线发送已知信号,利用激活天线的序号来传递信息。基于最大似然(maximum likelihood,ML)准则的 GSSK 检测器,当天线数较多时,其计算量太大,给实际应用带来困难,为此人们热衷于研究简化的次优检测算法。给出了一种基于二进制二次规划全局最优性条件的 GSSK 系统的检测算法。该算法首先利用最优判决准则判断发送信息,然后根据已判断出的发送信息来确定发送天线的组合,进而得到发送的二进制比特流。仿真结果表明,所提出的新算法在性能上优于已有的正交匹配追踪(orthogonal matching pursuit,OMP)、凸超集松弛(convex superset relaxation,CSR)等次优检测算法,复杂度又低于 ML 算法,在性能和复杂度之间得到较好的折中。
廣義空間位移鍵控(generalized space shift keying,GSSK)技術作為大天線技術和綠色通信技術相融閤的優選方案受到瞭業界的廣汎興趣,其特點是在每一時刻隻激活幾根天線髮送已知信號,利用激活天線的序號來傳遞信息。基于最大似然(maximum likelihood,ML)準則的 GSSK 檢測器,噹天線數較多時,其計算量太大,給實際應用帶來睏難,為此人們熱衷于研究簡化的次優檢測算法。給齣瞭一種基于二進製二次規劃全跼最優性條件的 GSSK 繫統的檢測算法。該算法首先利用最優判決準則判斷髮送信息,然後根據已判斷齣的髮送信息來確定髮送天線的組閤,進而得到髮送的二進製比特流。倣真結果錶明,所提齣的新算法在性能上優于已有的正交匹配追蹤(orthogonal matching pursuit,OMP)、凸超集鬆弛(convex superset relaxation,CSR)等次優檢測算法,複雜度又低于 ML 算法,在性能和複雜度之間得到較好的摺中。
엄의공간위이건공(generalized space shift keying,GSSK)기술작위대천선기술화록색통신기술상융합적우선방안수도료업계적엄범흥취,기특점시재매일시각지격활궤근천선발송이지신호,이용격활천선적서호래전체신식。기우최대사연(maximum likelihood,ML)준칙적 GSSK 검측기,당천선수교다시,기계산량태대,급실제응용대래곤난,위차인문열충우연구간화적차우검측산법。급출료일충기우이진제이차규화전국최우성조건적 GSSK 계통적검측산법。해산법수선이용최우판결준칙판단발송신식,연후근거이판단출적발송신식래학정발송천선적조합,진이득도발송적이진제비특류。방진결과표명,소제출적신산법재성능상우우이유적정교필배추종(orthogonal matching pursuit,OMP)、철초집송이(convex superset relaxation,CSR)등차우검측산법,복잡도우저우 ML 산법,재성능화복잡도지간득도교호적절중。
Generalized space shift keying (GSSK),a preferred scheme in the combination of the large-an-tenna technology and the green communication technology,has received a wide range of interests.The main fea-tures of GSSK are that only a few antennas are activated at any time instant and antenna indices are exploited to convey information.The computational complexity of the maximum likelihood (ML)detector is extremely high due to the large transmit-antenna which has been the limitation in practical application.Thus,simplified subop-timal detection algorithms have been widely studied.A novel GSSK detection algorithm based on global optimal-ity conditions for binary quadratic programming is proposed.The proposed algorithm uses the optimal decision criterion to judge the transmit information.Subsequently the algorithm can determine the combination of trans-mit antennas based on the previous transmit information.Thus,the transmit binary bit stream is estimated. The simulation results show that the performance of the proposed algorithm,which exhibits lower computation-al complexity,is better than orthogonal matching pursuit (OMP)and convex superset relaxation (CSR)subop-timal detection algorithms.The proposed method achieves a better tradeoff between the performance and com-plexity.