在2004年的論文中，所提出一的個多籬柵編碼么正空時調變架構，它將 的么正空時調變信號區塊，指派到一個籬柵分支來傳送。並且針對k-fold 笛卡爾乘積的空時調變信號集合，設計一個集合分割方法。在本篇論文中，我們提出一個由產生矩陣所定義的多重籬柵編碼么正空時調變的傳輸架構，是利用輸入資料位元、記憶體及產生矩陣所組成的編碼器，並嘗試尋求各種產生矩陣，從中選擇能得到最大的非同調距離乘積之產生矩陣。此架構所搜尋的碼與傳統的多重籬柵編碼么正調變架構比較，可得到較佳的錯誤率效能。 In 2004, a multiple-trellis-coded unitary space-time modulation（MTC-USTM） was proposed, where unitary space-time signal blocks are assigned to single branch in the trellis.They have evolved a partitioning scheme for the k-fold Cartesian product of the UST signal set for MTC-USTM. In this paper, we propose a new scheme for multiple-trellis-coded unitary space-time modulation defined by a generator matrix; the scheme is the use of input data bits, memory, and generator matrix composed of the encoder. We can choose the generator matrix to get the maximum noncoherent product distance. The searched codes for this scheme can achieve superior error performance than MTC-USTM.
