Browsing by Subject "channel codes"
Now showing 1 - 2 of 2
Results Per Page
Sort Options
Item Half-Product Codes(2014-12-11) Emmadi, Santosh KumarA class of codes, half-product codes, derived from product codes, is characterized. These codes have the implementation advantages of product codes and possess a special structural property which leads them to have larger (at least 3/2 times more) minimum distance than product codes. With the same length and rate, they have better scaling in the error floor than product codes. They also have a larger minimum stopping-set size under iterative decoding which provides better scaling. The main results of this thesis are summarized as follows: 1. Encoding and decoding methods of half-product codes are described. 2. The minimum distance of these codes is derived, and proved to be at least 3 2 times larger than that of the product codes for the same rate and block length. 3. The performance of iterative decoding in the error floor region is analyzed by enumerating the minimum stopping-set patterns for these codes. The results are compared with product codes. Simulations are also performed to compare the half-product codes with product codes. We conclude that half-product codes scale better in the error floor than product codes in the region where the minimum stopping-sets dominate the error floor, and that they have same threshold as product codes when rate is same and code length is increased to infinity.Item New bounding techniques for channel codes over quasi-static fading channels(2005-04-01) Hu, JingyuThis thesis is intended to provide several new bounding techniques for channel codes over quasi-static fading channels (QSFC). This type of channel has drawn more and more attention recently with the demanding need for higher capacity and more reliable wireless communication systems. Although there have been some published results on analyzing the performance of channel codes over QSFCs, most of them produced quite loose performance upper bounds. In this thesis, the general Gallager bounding approach which provides convergent upper bounds of coded systems over QSFCs is addressed first. It is shown that previous Gallager bounds employing trivial low SNR bounds tended to be quite loose. Then improved low instantaneous SNR bounds are derived for two classes of convolutional codes including turbo codes. Consequently, they are combined with the classical Union-Chernoff bound to produce new performance upper bounds for simple convolutional and turbo codes over single-input single-output (SISO) QSFCs. The new bound provides a much improved alternative to characterizing the performance of channel codes over QSFCs over the existing ones. Next the new bounding approach is extended to cases of serially concatenated space-time block codes, which show equivalence with SISO QSFCs. Tighter performance bounds are derived for this coding scheme for two specific cases: first a convolutional code, and later a turbo code. Finally, the more challenging cases of multiple-input multiple-output (MIMO) QSFCs are investigated. Several performance upper bounds are derived for the bit error probability of different cases of space-time trellis codes (STTC) over QSFCs using a new and tight low SNR bound. Also included in this work is an algorithm for computing the unusual information eigenvalue spectrum of STTCs.