A Study on Joint Source-Channel Coded Modulation
碩士 === 國立交通大學 === 電信工程研究所 === 105 === In this thesis, the code construction algorithm that searches for an optimal or near-optimal joint source-channel code in [2] is further generalized. The new construction algorithm targets for an optimal joint design between source-channel coding and modulation,...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/q58fvv |
| Summary: | 碩士 === 國立交通大學 === 電信工程研究所 === 105 === In this thesis, the code construction algorithm that searches for an optimal or near-optimal joint source-channel code in [2] is further generalized. The new construction algorithm targets for an optimal joint design between source-channel coding and modulation, which is refereed to as joint source-channel coded modulation (JSCCM). Subject to a fixed free Euclidean distance constraint, a priority-first search algorithm is applied over a search tree for finding an optimal JSCCM with the minimum average codeword length (measured in source letters per modulation symbol). On the other hand, the sequence maximum a posteriori (MAP) decoder for joint source-channel codes is also generalized for the MAP demodulation of JSCCMs under the premise that the receiver knows both the number of transmitted codewords and the number of transmitted modulation symbols in a transmission block.
Simulation results show that a joint design between source-channel coding and modulation can achieve a better performance than a design that separates source-channel coding and modulation, in particular at high SNRs.
|
|---|