Search
Skip to Search Results- 2Channel estimation
- 2Error-correcting codes
- 2Insertion/deletion channels
- 1Analog-to-information conversion
- 1Annotated raptor codes
- 1Asynchronization
-
Fall 2012
In this dissertation we present new methods for designing efficient Raptor codes in finite and practical block lengths. First we propose an extension of Raptor codes which keeps all the desirable properties, including the linear complexity of encoding and decoding per information bit, and...
-
Spring 2013
One of the most stunning results of information theory is the channel coding theorem addressing the maximum rate of reliable communication over a noisy channel, known as channel capacity. In this thesis, we consider two problems emerging from the classic channel coding theorem. First, we study...
-
Fall 2012
For successful correction of errors in a digital communication system, information about the channel, such as timing, noise power, fading gain, etc., should normally be available at the receiver. To this end, most receivers use channel parameter estimation and timing recovery modules. However,...
-
Spring 2013
In recent years compressive sampling (CS) has appeared in the signal processing literature as a legitimate contender for processing of sparse signals. Natural signals such as speech, image and video are compressible. In most signal processing systems dealing with these signals the signal is first...