空時區塊編碼的空間調變（STBC-SM）不僅透過以發射天線索引來傳送額外的資料位元，還能提供發射端的多樣性增益。最近，有一種提升頻譜效率的新穎 STBC-SM技術，稱為不同累積區塊中的時間排列（TP-DAB）。甚且，TP-DAB延伸到空間排列的一種結合空間與時間排列的STBC-SM架構（STBC-SM-JSTP）也剛被提出，它在不犧牲錯誤效能的前提下能更進一步提升頻譜效率，然而，這兩種架構在接收端的解碼都太過複雜。在本篇論文中，我們提出用於TP-DAB和STBC-SM-JSTP的低複雜度解碼演算法，我們先提出了新的TP-DAB最大可能性檢測器，其計算複雜度遠低於以往所有TP-DAB檢測器。在此基礎上，我們進一步探討了TP-DAB的近似最大可能性檢測器，用來處理更多天線的情況，且其錯誤率與最大可能性檢測器的差距不大。接著針對STBC-SM-JSTP，也設計了新的低複雜度最大可能性檢測器，同樣能夠大幅降低解碼端的複雜度。;Space-time block-coded spatial modulation (STBC-SM) not only transmits additional data bits by selecting transmit antenna indices, but also provides transmit diversity gain. Recently, a novel STBC-SM technique known as temporal permutations in distinct accumulated blocks (TP-DAB) has been proposed to enhance spectral efficiency. Furthermore, an extended scheme of TP-DAB that incorporates spatial permutations, referred to as STBC-SM-JSTP, has also been introduced. This architecture further improves spectral efficiency without sacrificing error performance. However, both of these schemes suffer from high decoding complexity at the receiver. In this paper, we propose low-complexity decoding algorithms for TP-DAB and STBC-SM-JSTP. We first present a new maximum-likelihood (ML) detector for TP-DAB, whose computational complexity is significantly lower than that of all previously proposed TP-DAB detectors. Building on this, we further develop a near-ML detector for TP-DAB, which is designed to support systems with a larger number of transmit antennas, while maintaining error performance close to that of the ML detector. Finally, for the STBC-SM-JSTP architecture, we also design a new low-complexity ML detector, which similarly achieves substantial reduction in decoding complexity at the receiver.
