| DC 欄位 |
值 |
語言 |
| DC.contributor | 通訊工程學系 | zh_TW |
| DC.creator | 許家榮 | zh_TW |
| DC.creator | Chia-Jung Hsu | en_US |
| dc.date.accessioned | 2016-7-21T07:39:07Z | |
| dc.date.available | 2016-7-21T07:39:07Z | |
| dc.date.issued | 2016 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:444/thesis/view_etd.asp?URN=103523026 | |
| dc.contributor.department | 通訊工程學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 相差編碼是一個在傳送端的傳統技術，它可以讓接收端做簡單的非同調檢測。另一方面，籬柵編碼調變是一種提供可靠數據傳輸的頻寬效益技術。在本論文中，我們在通道同調時間N為3個符號的情況下，考慮籬柵編碼調變加上相差編碼的設計。我們先做集合分割，再根據所得的各層最小距離做碼搜尋，並分析搜尋到的籬柵碼之最小非同調距離。會與通道同調時間N為2所搜尋到的籬柵碼比較，我們所搜尋到的籬柵碼皆有較大的最小非同調距離以及較佳之錯誤率模擬。除此之外，我們也修正同調距離的計算方式，所搜尋的籬柵碼在較多狀態個數時，會優於原本的籬柵編碼。 | zh_TW |
| dc.description.abstract | Differential encoding (DE) is a classical technique at the transmitter that allows simple noncoherent detection at the receiver. On the other hand, trellis-coded modulation is a bandwidth efficient technique which offers reliable data transmission. In this paper, we consider TCM with DE for channel phase coherence over N = 3 symbols.
First we do partitioning. Based on the set partitioning, trellis codes are searched and their minimum distances are analyzed. They are compared with the codes searched for N = 2. For both minimum distance and simulation results, the obtained new codes outperform code for N=2.
Besides, we propose a new coherent distance calculation method for trellis code searches. For large number of trellis states, Both minimum distance and simulation results outperform original codes. | en_US |
| DC.subject | 碼搜尋 | zh_TW |
| DC.subject | 籬柵編碼調變 | zh_TW |
| DC.subject | Code Searches | en_US |
| DC.subject | Trellis-Coded Modulation | en_US |
| DC.title | 同調與非同調籬柵編碼調變之碼搜尋 | zh_TW |
| dc.language.iso | zh-TW | zh-TW |
| DC.title | Code Searches for Coherent and Noncoherent Trellis-Coded Modulation | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |