1 |
On the performance bound of turbo code.January 1999 (has links)
by Ng Siu Wah. / Thesis submitted in: August 1998. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1999. / Includes bibliographical references (leaves 49-[52]). / Abstract also in Chinese. / Chapter 1 --- Introduction and motivations --- p.1 / Chapter 1.1 --- Overview of Coding Technology --- p.2 / Chapter 1.2 --- Recent Breakthrough - Turbo Code --- p.3 / Chapter 1.3 --- Organization of the Thesis --- p.4 / Chapter 2 --- Basics of Turbo Codes --- p.5 / Chapter 2.1 --- A Brief Introduction of Turbo Codes --- p.6 / Chapter 2.1.1 --- Constituent Encoders with interleaver --- p.6 / Chapter 2.1.2 --- Iterative Decoder --- p.8 / Chapter 2.2 --- Additional remarks on Turbo Codes --- p.12 / Chapter 2.2.1 --- RSC encoders --- p.12 / Chapter 2.2.2 --- Interleaver --- p.14 / Chapter 2.3 --- Performance Evaluation of Turbo Codes --- p.15 / Chapter 2.3.1 --- Union Bound --- p.15 / Chapter 2.3.2 --- Weight Enumerating Function --- p.16 / Chapter 2.3.3 --- Uniform Interleaver --- p.17 / Chapter 3 --- An Improved Performance Bound for Turbo Codes --- p.20 / Chapter 3.1 --- Motivations --- p.21 / Chapter 3.2 --- Duman-Salehi's bound for Turbo Code --- p.22 / Chapter 3.2.1 --- Notations and definitions --- p.22 / Chapter 3.2.2 --- Word Error Probability --- p.23 / Chapter 3.3 --- Improved bounds for Turbo Code --- p.26 / Chapter 3.3.1 --- Preliminaries --- p.26 / Chapter 3.3.2 --- Generalization of Duman-Salehi's Bounds --- p.28 / Chapter 3.3.3 --- An Improved Bound on Word Error Probability --- p.30 / Chapter 3.3.4 --- An Improved Bound on Bit Error Probability --- p.34 / Chapter 3.4 --- Results and Discussions --- p.37 / Chapter 3.4.1 --- Assumptions --- p.37 / Chapter 3.4.2 --- Numerical results --- p.37 / Chapter 3.4.3 --- Distance spectra --- p.40 / Chapter 4 --- Concluding Remarks --- p.48 / Bibliography --- p.49
|
2 |
Design of efficient constant weight codesTallini, Luca 14 November 1996 (has links)
In a constant weight code, each code word contains a constant number of 1's.
If this number is equal to half the length of the code word then the code is called
balanced. These codes find many applications in computer and communication systems
noise reduction in VLSI systems, fault masking in bus lines of VLSI systems,
rejection of the low frequency components in digital communication systems, delay
insensitive communications in asynchronous systems, data transmission in fiber optics,
data storage in optical discs and magnetic tapes, fault tolerant synchronous
circuits, etc. This thesis presents new efficient design methods for constant weight
codes suitable to these applications. The proposed codes require low redundancy
but at the same time have fast and simple encoding/decoding algorithms. / Graduation date: 1997
|
3 |
Adaptive transform coding of speechSloan, David G. January 1979 (has links)
No description available.
|
4 |
Variable length coding for correlated information sourcesBailey, David Wayne. January 1975 (has links)
No description available.
|
5 |
Iterative decoding of turbo codes and other concatenated codes /Barbulescu, Adrien Sorin Unknown Date (has links)
Thesis (PhD)--University of South Australia, 1996.
|
6 |
Iterative decoding of turbo codes and other concatenated codes /Barbulescu, Adrien Sorin Unknown Date (has links)
Thesis (PhD)--University of South Australia, 1996.
|
7 |
Variable length coding for correlated information sourcesBailey, David Wayne. January 1975 (has links)
No description available.
|
8 |
Adaptive transform coding of speechSloan, David G. January 1979 (has links)
No description available.
|
9 |
Supports of subcodes and t-designsAndreou, Alexis January 2000 (has links)
No description available.
|
10 |
Code generation for a long instruction word architectureGray, Susan Margaret January 1991 (has links)
No description available.
|
Page generated in 0.0319 seconds