103 resultados para Binary Coding
Resumo:
This paper describes a speech coding technique that has been developed in order to provide a method of digitising speech at bit rates in the range 4. 8 to 8 kb/s, that is insensitive to the effects of acoustic background noise and bit errors on the digital link. The main aim has been to develop a coding scheme which provides speech quality and robustness against noise and errors that is similar to a 16000 b/s continuously variable slope delta (CVSD) coder, but which operates at half its data rate or less. A desirable aim was to keep the complexity of the coding scheme within the scope of what could reasonably be handled by current signal processing chips or by a single custom integrated circuit. Applications areas include mobile radio and small Satcomms terminals.
10-Gbit/s transmission over 300-m standard multimode fiber using multilevel coding and 2-channel WDM
Resumo:
A combination of multilevel coding schemes and simple two-channel wavelength division multiplexing (WDM) at 1300 and 1550 nm was used to transmit an aggregate of 10 Gbit/s over 300 m of multimode fiber that is typical of that employed in current Local Area Networks (LANs). It was shown that this technique could be a simple solution for achieving 10 Gigabit ethernet links over installed multimode fiber building backbones.
Resumo:
The book begins by detailing the fundamentals of advanced coding techniques such as Coding, Decoding, Design, and Optimization.
Resumo:
In this paper we consider a network that is trying to reach consensus over the occurrence of an event while communicating over Additive White Gaussian Noise (AWGN) channels. We characterize the impact of different link qualities and network connectivity on consensus performance by analyzing both the asymptotic and transient behaviors. More specifically, we derive a tight approximation for the second largest eigenvalue of the probability transition matrix. We furthermore characterize the dynamics of each individual node. © 2009 AACC.
Resumo:
We derive a random-coding upper bound on the average probability of error of joint source-channel coding that recovers Csiszár's error exponent when used with product distributions over the channel inputs. Our proof technique for the error probability analysis employs a code construction for which source messages are assigned to subsets and codewords are generated with a distribution that depends on the subset. © 2012 IEEE.