用於WiMAX系統中以最大長方形為基礎之下行鏈路資料叢集分配演算法

Abstract

著名的行動通訊規格802.16e WIMAX 在近年來開始被採用。因為其有助高資料傳輸量和佈建的低成本，漸漸變成無線寬頻服務的主流方法。WiMAX使用OFDMA當作主要的傳輸方法。而從規格書上可知，一個資料突衝需要被規畫成一個矩形才能放在以時間和頻率所組成的下載訊框裡，但是如何設定矩形的形狀來減少浪費的空間並沒有詳細的介紹。近幾年不少人提出了許多突衝規畫的演算法。在本篇論文裡，我們介紹了一個高效率包裝的演算法，其能夠達到高傳輸資料量、減少未使用的槽、並且最小化其規畫時所需的額外資訊。我們將提出的演算法和eOCSA還有OBBP這些之前提出來的演算法做比較。由數據結果可知我們的演算法較佳。

The IEEE 802.16e standard known as Mobile WiMAX has recently been introduced. Because of the high data throughput and low cost deployment; it becomes one of the leading solutions for wireless broadband services. Mobile WiMAX makes use of Orthogonal Frequency-Division Multiple Access (OFDMA) digital modulation scheme as the transmission method. It is known from the standard that data burst in the downlink subframe needs to be mapped into a time and frequency domain with a rectangular shape, but how the data burst are placed in to minimize the wasted space so that more data can be sent is not detailed. Many burst mapping algorithms have been proposed by researchers in these late years. In this thesis, we present an efficient packing algorithm which achieves high throughput, reduces the number of unused slots, and minimizes the mapping information overhead. We compare the performance of our proposed algorithm with that of eOCSA and OBBP, high-performance packing algorithms recently presented by other researchers. Numerical results show that our proposed algorithm outperforms them.