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

Abstract

針對 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).