基于Jacobi迭代的大規(guī)模MIMO系統(tǒng)低復雜度軟檢測算法
發(fā)布時間:2019-07-06 08:37
【摘要】:基于Jacobi迭代提出一種低復雜度信號檢測算法,在算法實現中避免了矩陣求逆運算.數學推導證明,該算法應用于MMSE檢測時是收斂的,與傳統(tǒng)的Neumann級數展開方法對比,能達到與其完全相同的檢測性能,并且在任意迭代次數下能將復雜度保持在O(K~2),而后者當級數展開項數大于等于3時復雜度上升為O(K~3).為了進一步將Jacobi迭代應用到軟判決中,提出了一種用于信道譯碼的LLR的近似計算方法.仿真結果表明,經過幾次迭代,Jacobi迭代算法收斂較快,并接近MMSE檢測性能.
[Abstract]:Based on Jacobi iteration, a low complexity signal detection algorithm is proposed, which avoids the inverse operation of matrix in the implementation of the algorithm. The mathematical derivation proves that the algorithm is convergent when applied to MMSE detection. Compared with the traditional Neumann series expansion method, the algorithm can achieve exactly the same detection performance, and can keep the complexity at O (K 鈮,
本文編號:2510901
[Abstract]:Based on Jacobi iteration, a low complexity signal detection algorithm is proposed, which avoids the inverse operation of matrix in the implementation of the algorithm. The mathematical derivation proves that the algorithm is convergent when applied to MMSE detection. Compared with the traditional Neumann series expansion method, the algorithm can achieve exactly the same detection performance, and can keep the complexity at O (K 鈮,
本文編號:2510901
本文鏈接:http://www.sikaile.net/kejilunwen/xinxigongchenglunwen/2510901.html