|Institution:||University of Notre Dame|
|Keywords:||trellis pruning; TCM; working backwards; set-partition; BICM; coded cooperation|
|Full text PDF:||http://etd.nd.edu/ETD-db/theses/available/etd-07202011-183055/|
This thesis presents two new techniques that enable a pair of cooperating partners (source nodes) to convey their data to a common destination. Both techniques employ bandwidth-efficient coded modulation and integrate relaying into channel coding. The first technique is a form of bit-interleaved coded modulation (BICM) using low-density parity check (LDPC) codes. The signal labeling is based on set partitioning (SP), and is carried out in such a way that each partnerÃ¢â¬â¢s knowledge of the relayed data enables it to decode the other partnerÃ¢â¬â¢s data from a sparser subset of the original constellation, thereby enhancing the robustness of the partner-to-partner link. The second technique is a form of trellis coded modulation (TCM), in which Ã¢â¬ÅlocalÃ¢â¬Â and Ã¢â¬ÅrelayedÃ¢â¬Â data are multiplexed together prior to encoding. The receiving partner employs trellis-pruning (TP), i.e., its knowledge of the relayed data helps to Ã¢â¬ÅpruneÃ¢â¬Â the inappropriate edges from the code trellis, so the partner-to-partner link is enhanced. Moreover, the destination node also benefits from either SP (in the first technique) or TP (in the second technique) with high probability. Simulation results show that both of these approaches offer performance gain about 1.5 to 3 dB (at a frame error rate of 10^(-2)) over the conventional decode-and-forward time-sharing system in which local and relayed data are transmitted orthogonally.