1 |
A general-scene object-oriented image coder that uses stereo and motion informationPanis, Stathis January 1995 (has links)
No description available.
|
2 |
Transform vector quantisation of speech at low bit ratesMcCourt, Paul January 1995 (has links)
No description available.
|
3 |
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
|
4 |
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
|
5 |
Adaptive transform coding of speechSloan, David G. January 1979 (has links)
No description available.
|
6 |
Variable length coding for correlated information sourcesBailey, David Wayne. January 1975 (has links)
No description available.
|
7 |
Iterative decoding of turbo codes and other concatenated codes /Barbulescu, Adrien Sorin Unknown Date (has links)
Thesis (PhD)--University of South Australia, 1996.
|
8 |
Iterative decoding of turbo codes and other concatenated codes /Barbulescu, Adrien Sorin Unknown Date (has links)
Thesis (PhD)--University of South Australia, 1996.
|
9 |
Insights into RNase P RNA structure and function by a retro-evolution approachLi, Dan Unknown Date (has links) (PDF)
Marburg, Univ., Diss., 2009
|
10 |
Communication of Dependent Messages Over Compound ChannelsCheng, Zhong January 2015 (has links)
In the communication of multimedia content, certain dependency structure often exists among the source-coded messages by different source coding techniques, where by "dependency" we mean the dependent contributions of the messages to the overall reconstruction quality. Motivated by such notion of dependency, this thesis considers the problem of communicating dependent source-coded messages over compound channels, which include the attractive wireless channels and packet-loss channels. In this thesis we propose a novel framework to model arbitrary dependency structure among source-coded messages from the source-reconstruction perspectives, and formulate the problem of communicating such messages over compound channels as the problem of maximizing the average utility at the receiver. Over discrete memoryless channels (DMC), we derive the expression of maximal achievable utility, which appears to be governed by the channel coding theorem. Over degraded compound channels, we study analytically the maximal achievable utility by superposition codes. To achieve the maximal utility, the encoder chooses the best sub-chain in the utility graph and encodes it using the best superposition code. For the case of two source-coded messages, we show that the maximal utility achieved by superposition codes is the maximum among all coding schemes. Since in practice layered codes (LC) and multiple description codes (MDC) are two most attracted source coding schemes which induce different dependency structures among coded messages, we numerically evaluate the maximal achievable utility for sources coded with those two source coding schemes communicated over DMC and degraded compound channels respectively, and show the impact of communication delay and channel condition on their respective achievable utilities. In addition, for communicating a Gaussian N(0,1) independent identically distributed (i.i.d.) sequence over degraded compound channels, the joint source channel coding schemes are considered and the minimal achievable distortion is derived and compared for different combinations of source and channel codes. It is shown that the combination of LC and superposition codes outperforms other coding schemes. The comparative behaviour among those techniques is further demonstrated by the experimental results. Practically, we study the performances of various coding schemes for communicating two dependent messages over quasi-static Rayleigh fading channels, which include conventional channel codes, time sharing codes, and a low-density parity-check (LDPC) based coding scheme, termed Bi-LDPC codes. The success rates and the throughput of the considered coding schemes are compared. For communicating a Gaussian N(0,1) source sequence encoded by LC and MDC respectively over quasi-static Rayleigh fading channels, the average distortion is also compared among different channel coding schemes. It appears that Bi-LDPC codes, conventional channel codes encoding both messages, and time sharing type-2 (TS-2) codes, each has their advantage over different region of signal-to-noise ratio (SNR), compared with each other.
|
Page generated in 0.0603 seconds