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

by Lam Chi Wah. / Thesis submitted in: December 1997. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1998. / Includes bibliographical references (leaves 89-91). / Abstract also in Chinese. / Chapter Chapter 1 --- Introduction to Data Compression and Image Coding --- p.1 / Chapter 1.1 --- Introduction --- p.1 / Chapter 1.2 --- Fundamental Principle of Data Compression --- p.2 / Chapter 1.3 --- Some Data Compression Algorithms --- p.3 / Chapter 1.4 --- Image Coding Overview --- p.4 / Chapter 1.5 --- Image Transformation --- p.5 / Chapter 1.6 --- Quantization --- p.7 / Chapter 1.7 --- Lossless Coding --- p.8 / Chapter Chapter 2 --- Subband Coding and Wavelet Transform --- p.9 / Chapter 2.1 --- Subband Coding Principle --- p.9 / Chapter 2.2 --- Perfect Reconstruction --- p.11 / Chapter 2.3 --- Multi-Channel System --- p.13 / Chapter 2.4 --- Discrete Wavelet Transform --- p.13 / Chapter Chapter 3 --- Vector Quantization (VQ) --- p.16 / Chapter 3.1 --- Introduction --- p.16 / Chapter 3.2 --- Basic Vector Quantization Procedure --- p.17 / Chapter 3.3 --- Codebook Searching and the LBG Algorithm --- p.18 / Chapter 3.3.1 --- Codebook --- p.18 / Chapter 3.3.2 --- LBG Algorithm --- p.19 / Chapter 3.4 --- Problem of VQ and Variations of VQ --- p.21 / Chapter 3.4.1 --- Classified VQ (CVQ) --- p.22 / Chapter 3.4.2 --- Finite State VQ (FSVQ) --- p.23 / Chapter 3.5 --- Vector Quantization on Wavelet Coefficients --- p.24 / Chapter Chapter 4 --- Vector Wavelet Transform-Linear Predictor Coding --- p.26 / Chapter 4.1 --- Image Coding Using Wavelet Transform with Vector Quantization --- p.26 / Chapter 4.1.1 --- Future Standard --- p.26 / Chapter 4.1.2 --- Drawback of DCT --- p.27 / Chapter 4.1.3 --- "Wavelet Coding and VQ, the Future Trend" --- p.28 / Chapter 4.2 --- Mismatch between Scalar Transformation and VQ --- p.29 / Chapter 4.3 --- Vector Wavelet Transform (VWT) --- p.30 / Chapter 4.4 --- Example of Vector Wavelet Transform --- p.34 / Chapter 4.5 --- Vector Wavelet Transform - Linear Predictive Coding (VWT-LPC) --- p.36 / Chapter 4.6 --- An Example of VWT-LPC --- p.38 / Chapter Chapter 5 --- Vector Quantizaton with Inter-band Bit Allocation (IBBA) --- p.40 / Chapter 5.1 --- Bit Allocation Problem --- p.40 / Chapter 5.2 --- Bit Allocation for Wavelet Subband Vector Quantizer --- p.42 / Chapter 5.2.1 --- Multiple Codebooks --- p.42 / Chapter 5.2.2 --- Inter-band Bit Allocation (IBBA) --- p.42 / Chapter Chapter 6 --- Parental Finite State Vector Quantizers (PFSVQ) --- p.45 / Chapter 6.1 --- Introduction --- p.45 / Chapter 6.2 --- Parent-Child Relationship Between Subbands --- p.46 / Chapter 6.3 --- Wavelet Subband Vector Structures for VQ --- p.48 / Chapter 6.3.1 --- VQ on Separate Bands --- p.48 / Chapter 6.3.2 --- InterBand Information for Intraband Vectors --- p.49 / Chapter 6.3.3 --- Cross band Vector Methods --- p.50 / Chapter 6.4 --- Parental Finite State Vector Quantization Algorithms --- p.52 / Chapter 6.4.1 --- Scheme I: Parental Finite State VQ with Parent Index Equals Child Class Number --- p.52 / Chapter 6.4.2 --- Scheme II: Parental Finite State VQ with Parent Index Larger than Child Class Number --- p.55 / Chapter Chapter 7 --- Simulation Result --- p.58 / Chapter 7.1 --- Introduction --- p.58 / Chapter 7.2 --- Simulation Result of Vector Wavelet Transform (VWT) --- p.59 / Chapter 7.3 --- Simulation Result of Vector Wavelet Transform - Linear Predictive Coding (VWT-LPC) --- p.61 / Chapter 7.3.1 --- First Test --- p.61 / Chapter 7.3.2 --- Second Test --- p.61 / Chapter 7.3.3 --- Third Test --- p.61 / Chapter 7.4 --- Simulation Result of Vector Quantization Using Inter-band Bit Allocation (IBBA) --- p.62 / Chapter 7.5 --- Simulation Result of Parental Finite State Vector Quantizers (PFSVQ) --- p.63 / Chapter Chapter 8 --- Conclusion --- p.86 / REFERENCE --- p.89

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1979. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. / Vita. / Includes bibliographical references. / by Lawrence Howard Ozarow. / Ph.D.

Thesis (Sc.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1982. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING / Bibliography: leaves 166-174. / by Yao-Ming Chao. / Sc.D.

The aim of this work is to investigate an algebraic attack on block ciphers called Multiple Right Hand Sides (MRHS). MRHS models a block cipher as a system of n matrix equations Si := Aix = [Li], where each Li can be expressed as a set of its columns bi1, . . . , bisi . The set of solutions Ti of Si is dened as the union of the solutions of Aix = bij , and the set of solutions of the system S1, . . . , Sn is dened as the intersection of T1, . . . , Tn. Our main contribution is a hardware platform which implements a particular algorithm that solves MRHS systems (and hence block ciphers). The case is made that the platform performs several thousand orders of magnitude faster than software, it costs less than US$1,000,000, and that actual times of block cipher breakage can be calculated once it is known how the corresponding software behaves. Options in MRHS are also explored with a view to increase its efficiency. / by Kenneth Matheis. / Thesis (M.S.C.S.)--Florida Atlantic University, 2010. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2010. Mode of access: World Wide Web.

In this work, we consider the possibility and the effectiveness of implementing secure network coding and error-correcting network coding at the same time. Upon achieving this goal, information can be multicast securely to the sink nodes through a noisy network. Toward this end, we propose constructions of such codes and prove their optimality. After that, we extend the idea of generalized Hamming Weight [54] for the classical point-to-point communication channel to linear network coding. We also extend the idea of generalized Singleton bound to linear network coding. We further show that the generalized Hamming weight can completely characterize the security performance of linear code at the source node on a given linear network code. We then introduce the idea of Network Maximum Distance Separable code (NMDS code), which can be shown to play an important role in minimizing the information that an eavesdropper can obtain from the network. The problem of obtaining the optimal security performance is in fact equivalent to the problem of obtaining a Network Maximum Distance Separable code. / Network coding is one of the most important breakthroughs in information theory in recent years. The theory gives rise to a new concept regarding the role of nodes in a communication network. Unlike in existing networks where the nodes act as switches, in the paradigm of network coding, every node in the network can act as an encoder for the incoming information. With this new infrastructure, it is possible to utilize the full capacity of the network where it is impossible to do so without network coding. In the seminar paper by Ahlswede et al. [1] where network coding was introduced, the achievability of the maxflow bound for every single source multicast network by using network coding was also proved. By further exploring the possibility of linear network coding, Cai and Yeung introduced the idea of error-correcting network coding and secure network coding in [7] and [8] respectively. These papers launched another two important research areas in the field of network coding. / Ngai, Chi Kin. / Adviser: Yqung Wai Ho. / Source: Dissertation Abstracts International, Volume: 70-06, Section: B, page: 3696. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (leaves 122-128). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts in English and Chinese. / School code: 1307.

In the first part, decoder based error concealment methods are discussed. An adaptive partition size (APS) temporal error concealment method is developed for H.264. We propose to use Weighted Double-Sided External Boundary Matching Error (WDS-EBME) to jointly measure the inter-MB boundary discontinuity, inter-partition boundary discontinuity and intra-partition block artifacts in the corrupted MB. By minimizing the WDS-EBME value of each partition, the best motion vectors of each candidate partition mode can be estimated, overall WDS-EBME of the MB concealed by each partition mode can then be evaluated and the best partition mode for the corrupted Macroblocks (MB) will be determined as the one with the smallest overall WDS-EBME. We also propose a progressive concealment order for the 4x4 partition mode. / In this thesis, techniques for efficient error resilient video coding are investigated. Three parts of the work are discussed in this thesis. / The last part of the thesis concerns the joint encoder-decoder error control method. A joint temporal error control method is proposed for H.264. It combines RDO-based macroblock (MB) classification at the encoder and adaptive partition size error concealment at the decoder. The encoder classifies the MBs by evaluating the sensitivity of the MBs as the RD cost between the concealment error and the bits needed for the additional motion information. Additional motion information such as the original motion vector or motion vector index can be transmitted for the error sensitive MBs. The decoder utilizes the additional motion information if any of these MBs get lost. Non-sensitive MBs and blocks are concealed by the APS method. / The second part of this thesis investigates encoder based error control techniques. Firstly, a VLC/FLC data partitioning method is proposed for MPEG-4. It disables intra AC prediction and groups appropriate fixed length coded (FLC) syntaxes in a video packet (or slice) together to form a new partition. With intra AC prediction disabled, errors occurring in these FLC syntaxes will not cause spatial error propagation. It essentially classifies the syntaxes into two categories according to whether that syntax will cause spatial error propagation when an error occurs. Secondly, a redundant macroblock strategy is proposed for H.264. MB Differential Mean Square Error (DMSE) is employed to evaluate the error sensitivity of MBs. The most sensitive MBs are transmitted separately in additional slices while coarsely quantized copies of the MBs are placed in the original slice. When working with chessboard style Flexible Macroblock reordering (FMO) and fixed length slice mode (FMO-slicing), the scheme performs well against packet loss errors with acceptable overhead and it is highly compatible with original H.264 bitstream. Thirdly, a joint optimal bit allocation and rate control scheme is proposed for H.264 with redundant slice. The optimum ratio between each primary and redundant picture pair is analytically deduced. Rate function and distortion model for both representations are developed, and a simple close-form solution is provided to achieve joint optimum bit allocation. / Video communication and other web-based video applications become popular in recent years. However, the transmission of the compressed video bit stream often suffers from imperfection of the communication channel, like path loss, multipath fading, co-channel interference, congestion, etc. Error resilient video coding techniques need to be employed to mitigate the channel errors, which include error concealment in the decoder, forward error correction in the encoder and joint encoder-decoder error control techniques. / Li, Jie. / Adviser: Ngan King Ngi. / Source: Dissertation Abstracts International, Volume: 73-01, Section: B, page: . / Thesis (Ph.D.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 137-146). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [201-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese.

"Faster, higher, stronger"---the Olympic motto is being pursued and practised in the design of broadband wireless communication systems. Motivated by the huge demands for fast and reliable communications over wireless channels, broadband communication systems are required to provide faster (low-complexity) data processing, higher data throughput and stronger (lower error rate) performance. In practice, however, broadband communication systems must cope with critical performance-limiting challenges that include time- and frequency-selective fading channels, noise, inter-symbol interference (ISI), intercarrier interference (ICI) as well as power and bandwidth constraints. To address these challenges, this thesis investigates several physical layer aspects of broadband wireless communication systems. / Incorporating OFDM into multiple-input multiple-output (MIMO) system, MIMO-OFDM has been shown to provide larger channel capacity and greater diversity gain. However, current coding schemes for MIMO-OFDM are either space-time coded (STC) OFDM without the guarantee of full diversity gains or space-frequency coding (SFC) with a greater loss of data rate. Furthermore, most existing STC and SFC have focused on quasi-static fading which is not practical for broadband wireless communications. When multi-band OFDM (MB-OFDM) is applied to ultra-wide band (UWB) communications, a high diversity can be obtained, but in the expense of a much lower (close to half) data rate. To address the limitations of existing coding schemes for broadband wireless communication systems, this thesis: (i) proposes a space-time-frequency coding (STFC) that can achieve maximum diversity and maximum symbol rate transmission over MIMO block-fading channels; (ii) derives a high-rate full-diversity SFC from STFC tailored for frequency-selective fading channels; and (iii) proposes a high-rate high-diversity algebraic time-frequency coding (ATFC) for MB-OFDM system. / Orthogonal frequency division multiplexing (OFDM) is an effective technique to eliminate ISI in broadband wireless communications. This thesis studies the problem of training-based OFDM channel estimation and proposes a training method that minimizes the number of pilots employed to achieve a desired bit error rate (BER) performance. A clustered pilot pattern is further proposed to enhance the BER performance. Focusing on OFDM frequency synchronization, this thesis also proposes a clustered pilot tones placement and a novel pilot sequence design for carrier frequency offset (CFO) compensation. The analytical and simulation results show that the root mean square error (RMSE) of the CFO estimate can be greatly reduced. / Zhang Wei. / "July 2005." / Adviser: Pak-Chung Ching. / Source: Dissertation Abstracts International, Volume: 67-01, Section: B, page: 0461. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2005. / Includes bibliographical references (p. 126-143). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts in English and Chinese. / School code: 1307.

Tse Fu Wing. / "June 2000." / Thesis (Ph.D.)--Chinese University of Hong Kong, 2000. / Includes bibliographical references (p. 172-177). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web. / Abstracts in English and Chinese.