運用改良式重複樹狀搜尋策略的低複雜度軟性輸出球狀解碼器

針對 MIMO 技術的各種解碼器早己提出，但是對於如何達到好的複雜度-效能平衡，目前仍然是個挑戰。在此篇碩士論文中，我們提出了改良式的重複樹狀搜索的低複雜度軟性輸出球狀解碼器，並以模擬來說明其具有好的複雜度-效能平衡，並且是可由硬體來實現的。接著我們更進一步的將此改良式的重複樹狀搜索的低複雜度軟性輸出球狀解碼器應用於干擾調變未知下的干擾消除。模擬結果顯示相較於傳統的廣義概度比例測試法，我們所提的方法可以在耗費較少的資源和較低的複雜度下達到同樣好的調變偵測率和區塊錯誤率。

關鍵字

球狀解碼器

並列摘要

Various detectors for multiple-in-multiple-out (MIMO) technologies have been proposed, yet to achieve a good complexity-performance tradeoff still remains a challenge problem. In this thesis, we proposed a low complexity soft-output sphere decoding, called modified repeated tree search (RTS), that can achieve good complexity-performance tradeoff and is suitable for hardware implementation. We further apply the modified RTS for interference cancellation with unknown interference modulation. Simulation results show that a good modulation classification rate and block error rate (BLER) can be achieved with lesser complexity and resources consumed when it is compared with the traditional general likelihood ratio test (GLRT).

並列關鍵字

sphere decoding ； interference cancellation ； modulation classification

參考文獻

[1] S.-L. Shieh, R.-D. Chiu, S.-L. Feng and P.-N. Chen, “Low-complexity soft-output sphere decoding with modified repeated tree search strategy,” IEEE Comm. Letter,

[2] C. P. Schnorr and M. Euchner, “Lattice basis reduction: Improved practical algorithms and solving subset sum problems,” Math. Programming, vol. 66, no. 2, pp.

181-191, September 1994.

[3] U. Fincke and M. Pohst, “Improved methods for calculating vectors of short length in a lattice, including a complexity analysis.” Mathematics of Computation, vol. 44,

[4] R. Wang and G. Giannakis, “Approaching MIMO channel capacity with reduced complexity soft sphere decoding,” in Proc. of IEEE Wireless Communications and Networking Conf. (WCNC), vol. 3, March 2004, pp. 1620-1625.

國際替代計量

運用改良式重複樹狀搜尋策略的低複雜度軟性輸出球狀解碼器

全文下載

主題瀏覽