Gbit/second lossless data compression hardware

This thesis investigates how to improve the performance of lossless data compression hardware as a tool to reduce the cost per bit stored in a computer system or transmitted over a communication network. Lossless data compression allows the exact reconstruction of the original data after decompression. Its deployment in some high-bandwidth applications has been hampered due to performance limitations in the compressing hardware that needs to match the performance of the original system to avoid becoming a bottleneck. Advancing the area of lossless data compression hardware, hence, offers a valid motivation with the potential of doubling the performance of the system that incorporates it with minimum investment. This work starts by presenting an analysis of current compression methods with the objective of identifying the factors that limit performance and also the factors that increase it. [Continues.

Design of tch-type sequences for communications

This thesis deals with the design of a class of cyclic codes inspired by TCH codewords. Since TCH codes are linked to finite fields the fundamental concepts and facts about abstract algebra, namely group theory and number theory, constitute the first part of the thesis. By exploring group geometric properties and identifying an equivalence between some operations on codes and the symmetries of the dihedral group we were able to simplify the generation of codewords thus saving on the necessary number of computations. Moreover, we also presented an algebraic method to obtain binary generalized TCH codewords of length N = 2k, k = 1,2, . . . , 16. By exploring Zech logarithm’s properties as well as a group theoretic isomorphism we developed a method that is both faster and less complex than what was proposed before. In addition, it is valid for all relevant cases relating the codeword length N and not only those resulting from N = p

A software-defined receiver for laser communications using a GPU

This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018Cataloged from PDF version of thesis.Includes bibliographical references (pages 43-46).Laser commiunication systems provide a high data rate, power efficient communication solution for small satellites and deep space missions. One challenge that limits the widespread use of laser communication systems is the lack of accessible, low-complexity receiver electronics and software implementations. Graphics Processing Units (GPUs) can reduce the complexity in receiver design since GPUs require less specialized knowledge and can enable faster development times than Field Programmnable Cate Array (FPGA) implementations, while still retaining comparable data throughputs via parallelization. This thesis explores the use of a Graphics Processing Unit (GPU) as the sole computational unit for the signal processing algorithms involved in laser conmnunications.by Joseph Matthew Kusters.M. Eng.M.Eng. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Scienc

Multidimensional Optimized Optical Modulation Formats

This chapter overviews the relatively large body of work (experimental and theoretical) on modulation formats for optical coherent links. It first gives basic definitions and performance metrics for modulation formats that are common in the literature. Then, the chapter discusses optimization of modulation formats in coded systems. It distinguishes between three cases, depending on the type of decoder employed, which pose quite different requirements on the choice of modulation format. The three cases are soft-decision decoding, hard-decision decoding, and iterative decoding, which loosely correspond to weak, medium, and strong coding, respectively. The chapter also discusses the realizations of the transmitter and transmission link properties and the receiver algorithms, including DSP and decoding. It further explains how to simply determine the transmitted symbol from the received 4D vector, without resorting to a full search of the Euclidean distances to all points in the whole constellation

Distance Bounding Protocols on TH-UWB Link and their Analysis over Noisy Channels

Relay attacks represent nowadays a critical threat to authentication protocols. They cab be thwarted by deploying distance bounding protocols on an UWB radio. Exploiting the characteristics of time-hopping UWB radios to enhance distance bounding protocols leads to two design strategies. The first one is based on a secret time-hopping code while the mapping code is public. The second strategy exploits a secret mapping code with a public time-hopping code. The merits of each strategy are established over noise-free and noist channels as well as for different radio parameters

MOCZ for Blind Short-Packet Communication: Practical Aspects

We investigate practical aspects of a recently introduced blind (noncoherent) communication scheme, called modulation on conjugate-reciprocal zeros (MOCZ). MOCZ is suitable for a reliable transmission of sporadic and short-packets at ultra-low latency and high spectral efficiency via unknown multipath channels, which are assumed to be static over the receive duration of one packet. The information is modulated on the zeros of the transmitted discrete-time baseband signal’s z− transform. Because of ubiquitous impairments between the transmitter and receiver clocks, a carrier frequency offset occurs after down-conversion to the baseband. This results in a common rotation of the zeros. To identify fractional rotations of the base angle in the zero-pattern, we propose an oversampled direct zero-testing decoder to identify the most likely one. Integer rotations correspond to cyclic shifts of the binary message, which we determine by cyclically permutable codes (CPC). Additionally, the embedding of CPCs into cyclic codes, enables additive error-correction which reduces the bit-error-rate tremendously. Furthermore, we exploit the trident structure in the signal’s autocorrelation for an energy based detector to estimate timing offsets and the effective channel delay spread. We finally demonstrate how this joint data and channel estimation can be largely improved by receive antenna diversity at low SNR