Kwong Cheuk Fai. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (leaves 72-74). / Abstracts in English and Chinese. / Acknowledgements --- p.i / Abstract --- p.ii / Table of Contents --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Quantization --- p.2 / Chapter 1.2 --- Trellis-Coded Quantization --- p.3 / Chapter 1.3 --- Thesis Organization --- p.4 / Chapter 2 --- Trellis-Coded Modulation --- p.6 / Chapter 2.1 --- Convolutional Codes --- p.7 / Chapter 2.1.1 --- Generator Polynomials and Generator Matrix --- p.9 / Chapter 2.1.2 --- Circuit Diagram --- p.10 / Chapter 2.1.3 --- State Transition Diagram --- p.11 / Chapter 2.1.4 --- Trellis Diagram --- p.12 / Chapter 2.2 --- Trellis-Coded Modulation --- p.13 / Chapter 2.2.1 --- Uncoded Transmission verses TCM --- p.14 / Chapter 2.2.2 --- Trellis Representation --- p.17 / Chapter 2.2.3 --- Ungerboeck Codes --- p.18 / Chapter 2.2.4 --- Set Partitioning --- p.19 / Chapter 2.2.5 --- Decoding for TCM --- p.22 / Chapter 3 --- Trellis-Coded Quantization --- p.26 / Chapter 3.1 --- Scalar Trellis-Coded Quantization --- p.26 / Chapter 3.2 --- Trellis-Coded Vector Quantization --- p.31 / Chapter 3.2.1 --- Set Partitioning in TCVQ --- p.33 / Chapter 3.2.2 --- Codebook Optimization --- p.34 / Chapter 3.2.3 --- Numerical Data and Discussions --- p.35 / Chapter 4 --- Trellis-Coded Quantization with Unequal Distortion --- p.38 / Chapter 4.1 --- Design Procedures --- p.40 / Chapter 4.2 --- Fine and Coarse Codebooks --- p.41 / Chapter 4.3 --- Set Partitioning --- p.44 / Chapter 4.4 --- Codebook Optimization --- p.45 / Chapter 4.5 --- Decoding for Unequal Distortion TCVQ --- p.46 / Chapter 5 --- Unequal Distortion TCVQ on Memoryless Gaussian Source --- p.47 / Chapter 5.1 --- Memoryless Gaussian Source --- p.49 / Chapter 5.2 --- Set Partitioning of Codewords of Memoryless Gaussian Source --- p.49 / Chapter 5.3 --- Numerical Results and Discussions --- p.51 / Chapter 6 --- Unequal Distortion TCVQ on Markov Gaussian Source --- p.57 / Chapter 6.1 --- Markov Gaussian Source --- p.57 / Chapter 6.2 --- Set Partitioning of Codewords of Markov Gaussian Source --- p.58 / Chapter 6.3 --- Numerical Results and Discussions --- p.59 / Chapter 7 --- Conclusions --- p.70 / Bibliography --- p.72

Ho Man-Shing. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (leaves 65-66). / Abstracts in English and Chinese. / Acknowledgement --- p.i / Abstract --- p.ii / List of Abbreviation --- p.iii / Chapter 1. --- Introduction --- p.1 / Chapter 1.1 --- Digital Communication System --- p.3 / Chapter 1.2 --- Thesis Organization --- p.4 / Chapter 2. --- Error-Correcting Codes --- p.6 / Chapter 2.1 --- Convolutional Codes --- p.7 / Chapter 2.1.1 --- Generator Polynomials --- p.8 / Chapter 2.1.2 --- Generator Matrix --- p.9 / Chapter 2.1.3 --- Circuit Diagram --- p.10 / Chapter 2.1.4 --- State-transition Diagram --- p.11 / Chapter 2.1.4 --- Trellis Diagram --- p.12 / Chapter 2.1.5 --- Distance property --- p.13 / Chapter 2.2 --- Rate-Compatible Punctured Convolutional Codes --- p.14 / Chapter 2.3 --- Trellis-Coded Modulation --- p.17 / Chapter 2.3.1 --- General Model of TCM --- p.18 / Chapter 2.3.2 --- Trellis Representation --- p.20 / Chapter 2.3.3 --- Set Partitioning --- p.21 / Chapter 2.3.4 --- Code Modulation --- p.23 / Chapter 2.4 --- Decoding Algorithm --- p.25 / Chapter 2.4.1 --- Viterbi Algorithm --- p.27 / Chapter 2.4.2 --- List Viterbi Algorithm --- p.30 / Chapter 3. --- Unequal-Error-Protection for Embedded Image Coder --- p.33 / Chapter 3.1 --- SPIHT Coder --- p.35 / Chapter 3.1.1 --- Progressive Image Transmission --- p.36 / Chapter 3.1.2 --- Set Partitioning Sorting Algorithm --- p.37 / Chapter 3.1.3 --- Spatial Orientation Trees --- p.38 / Chapter 3.2 --- System Description --- p.39 / Chapter 3.3 --- Code Allocation --- p.41 / Chapter 3.4 --- System Complexity --- p.42 / Chapter 3.5 --- Simulation Result --- p.43 / Chapter 4. --- Unequal-Error-Protection Provided by Trellis-Coded Modulation --- p.51 / Chapter 4.1 --- System Description --- p.52 / Chapter 4.2 --- Unequal Constellation --- p.53 / Chapter 4.3 --- Free Distance --- p.55 / Chapter 4.4 --- Simulation Results --- p.59 / Chapter 5. --- Conclusion --- p.63 / Bibliography --- p.65

The two main goals of this research are to study the implementation aspects of space-time turbo trellis codes (ST Turbo TC) and to develop efficient simulation methods for space-time and turbo coded systems using the importance sampling (IS) technique. The design of ST Turbo TC for improving the bandwidth efficiency and the reliability of wireless communication networks, which is based on the turbo structure, has been proposed in the literature. To achieve memory savings and reduce the decoding delay, this thesis proposes a simplified ST Turbo TC decoder using a sliding window (SW) technique. Different window sizes are employed and investigated. Through computer simulation, the optimum window sizes are determined for various system configurations. The effect of finite word length representation on the performance of ST Turbo TC is then studied. Simulation results show that ST Turbo TC is feasible for finite word length representation without significant degradation in the frame error rate performance. The optimum word length configurations are defined for all quantities external and internal to the ST Turbo TC decoder. For complex communication systems such as space-time codes and turbo codes, computer simulation is in fact the useful approach to obtain the estimated performance. To overcome the lengthy run-time requirements of the conventional Monte-Carlo (MC) method, this thesis introduces importance sampling simulation methods that accurately estimate the performances of turbo codes and space-time codes including orthogonal space-time block codes (OSTBC) and concatenated OSTBC. It is demonstrated that the proposed methods require much smaller sample sizes to achieve the same accuracy required by a conventional MC estimator. / Doctor of Philosophy (PhD)

Recent attempts to increase the capacity of the compact disc (CD) and digital versatile disc (DVD) have explored the use of multilevel recording instead of binary recording. Systems that achieve an increase in capacity of about three times that of conventional CD have been proposed for production. Marks in these systems are multilevel and fixed-length as opposed to binary and variable length in CD and DVD. The main objective of this work is to evaluate the performance of multilevel ($M$-ary) runlength-limited (RLL) coded sequences in optical data storage. First, the waterfilling capacity of a multilevel optical recording channel ($M$-ary ORC) is derived and evaluated. This provides insight into the achievable user bit densities, as well as a theoretical limit against which simulated systems can be compared. Then, we evaluate the performance of RLL codes on the $M$-ary ORC. A new channel model that includes the runlength constraint in the transmitted signal is used. We compare the performance of specific RLL codes, namely $M$-ary permutation codes, to that of real systems using multilevel fixed-length marks for recording and the theoretical limits. The Viterbi detector is used to estimate the original recorded symbols from the readout signal. Then, error correction is used to reduce the symbol error probability. We use a combined ECC/RLL code for phrase encoding. We evaluate the use of trellis coded modulation (TCM) for amplitude encoding. The detection of the readout signal is also studied. A post-processing algorithm for the Viterbi detector is introduced, which ensures that the detected word satisfies the code constraints. Specifying the codes and detector for the $M$-ary ORC gives a complete system whose performance can be compared to that of the recently developed systems found in the literature and the theoretical limits calculated in this research.

The continuous phase frequency shift keying (CPFSK) is a modulation method with memory. The memory results from the phase continuity of the transmitted carrier phase from one signal interval to the next. For a specific form of phase, CPFSK becomes a special case of a general class of continuous phase modulation (CPM) signals. In this thesis, we extend the decomposition model of single-h CPM to the multi-h CPM decomposition model. Based on this decomposition model approach the multi-h CPFSK schemes are evaluated by searching the desired multi-h phase codes at a given number of states. Moreover, the trellis coded multi-h CPFSK schemes, which are the combination of the (binary) convolutional codes with the multi-h CPFSK schemes, are searching by optimization procedure via the matched encoding method. To further improve the performance, in terms of the coding gain, the ring convolutional codes are applied to the continuous phase encoder (CPE) of the proposed multi-h CPFSK schemes. Due to the fact that the code structure of the ring convolutional codes is similar to the CPE, this will result in having simple and efficient combination of the convolutional codes with the multi-h CPFSK signaling schemes.

Thesis (Ph. D.)--University of Canterbury, 2007. / Typescript (photocopy). "March 2007." Includes bibliographical references (p. 161-167). Also available via the World Wide Web.

Thesis (M.E.)--University of Canterbury, 2008. / Typescript (photocopy). Includes bibliographical references (leaves 90-108). Also available via the World Wide Web.

Thesis (M. App. Sc.)--Carleton University, 2004. / Includes bibliographical references (p. 82-85). Also available in electronic format on the Internet.

Thesis (Ph.D.)--University of Western Sydney, 2007. / A thesis submitted to the University of Western Sydney, College of Health and Science, School of Engineering in fulfilment of the requirements for the degree of Doctor of Philosophy in Engineering. Includes bibliographical references.

Adaptive modulation is widely employed to improve spectral e ciency. To date, square signal constellations have been used for adaptive modulation. In this disser- tation, triangular constellations are considered for this purpose. Triangle quadrature amplitude modulation (TQAM) for both power-of-two and non-power-of-two mod- ulation orders is examined. A technique for TQAM mapping is presented which is better than existing approaches. A new type of TQAM called semi-regular TQAM (S-TQAM) is introduced. Bit error rate expressions for TQAM are derived, and the detection complexity of S-TQAM is compared with that of regular TQAM (R-TQAM) and irregular TQAM (I-TQAM). The performance of S-TQAM over additive white Gaussian noise and Rayleigh fading channels is compared with that of R-TQAM and I-TQAM. The construction of ternary convolutional codes (TCCs) for ternary phase shift keying (TPSK) modulation is considered. Tables of non-recursive non-systematic TCCs with maximum free distance are given for rates 1=2, 1=3 and 1=4. The conver- sion from binary data to ternary symbols is investigated. The performance of TCCs with binary to ternary conversion using TPSK is compared with the best BCCs using binary phase shift keying (BPSK). / Graduate