Results 251 to 260 of about 681,054 (287)
Some of the next articles are maybe not open access.
Sliding block implementation of block codes (Corresp.)
IEEE Transactions on Information Theory, 1979A sliding block encoding scheme easily derivable from block encoding is presented. It is shown to perform arbitrarily close to the rate distortion function when the source is stationary and memoryless.
openaire +1 more source
Enhancement of block-coded speech
ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005This paper describes a very effective method for reducing framing noise associated with block-by-block speech coding algorithms. It is a post-coding speech enhancement procedure designed specifically to combat this type of noise. The procedure is based on a fully adaptive comb filter which is adapted in synchrony with the coding algorithm's frame ...
Dale E. Veeneman, Baruch Mazor
openaire +1 more source
2007 IEEE International Conference on Communications, 2007
In this paper, we investigate block-coded QAM constructed by multilevel coding for the noncoherent generalized likelihood ratio test (GLRT) detector. For the AWGN channel, we derive a new GLRT detector and the corresponding distance. The minimum noncoherent distance of block-coded QAM is derived and two construction of noncoherent block-coded QAM (NBC ...
Ruey-Yi Wei +3 more
openaire +1 more source
In this paper, we investigate block-coded QAM constructed by multilevel coding for the noncoherent generalized likelihood ratio test (GLRT) detector. For the AWGN channel, we derive a new GLRT detector and the corresponding distance. The minimum noncoherent distance of block-coded QAM is derived and two construction of noncoherent block-coded QAM (NBC ...
Ruey-Yi Wei +3 more
openaire +1 more source
IEEE Transactions on Information Theory, 1977
Sliding block codes are an intriguing alternative to the block codes used in the development of classical information theory. The fundamental analytical problem associated with the use of a sliding block code (SBC) for source encoding with respect to a fidelity criterion is that of determining the entropy of the coder output.
Toby Berger, Joseph Ka-Yin Lau
openaire +1 more source
Sliding block codes are an intriguing alternative to the block codes used in the development of classical information theory. The fundamental analytical problem associated with the use of a sliding block code (SBC) for source encoding with respect to a fidelity criterion is that of determining the entropy of the coder output.
Toby Berger, Joseph Ka-Yin Lau
openaire +1 more source
Block codes for statistical synchronization
IEEE Transactions on Information Theory, 1970The performance of a class of block codes with unbounded synchronization delay, though finite average synchronization delay, is analyzed. Basically the synchronizer inspects the code symbol stream for the first occurrence of one of a set of sequences that appear in only one timing position relative to true sync.
Robert A. Scholtz, R. M. Storwick
openaire +1 more source
On the trellis structure of block codes
Proceedings of 1994 IEEE International Symposium on Information Theory, 1995Summary: The problem of minimizing the vertex count at a given time index in the trellis for a general (nonlinear) code is shown to be NP-complete. Examples are provided that show that 1) the minimal trellis for a nonlinear code may not be observable, i.e., some codewords may be represented by more than one path through the trellis and 2) minimizing ...
Frank R. Kschischang, Vladislav Sorokine
openaire +2 more sources
Coding in the Block-Erasure Channel
IEEE Transactions on Information Theory, 2006In this correspondence, we study an M-ary block-erasure channel with B blocks, where with probability epsi a block of L coded symbols is erased. The behavior of the error probability of coded systems over such channels is studied, and we show that, if the code is diversity-wise maximum-distance separable, its word error probability is equal to the ...
openaire +1 more source
Noncoherent block coded modulation
2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003., 2004For coherent detection, block coded modulation with multistage decoding is a bandwidth efficient coded modulation system. In this paper, a novel block coded modulation system for noncoherent detection called noncoherent block coded modulation (NBCM) is proposed. We present a theorem for the distance property of the NBCM.
openaire +1 more source
IEEE Transactions on Information Theory, 1975
The traditional Shannon theory focuses almost exclusively on block coding techniques, that is, source and channel codes that consist of mapping blocks of nonoverlapping data into blocks of encoded data. Such codes (1) have undesirable probabilistic properties such as loss of stationarity and ergodicity, (2) do not include several practical ...
openaire +2 more sources
The traditional Shannon theory focuses almost exclusively on block coding techniques, that is, source and channel codes that consist of mapping blocks of nonoverlapping data into blocks of encoded data. Such codes (1) have undesirable probabilistic properties such as loss of stationarity and ergodicity, (2) do not include several practical ...
openaire +2 more sources
Block-orthogonal multivariate codes
Proceedings of the IEEE Information Theory Workshop, 2003Orthogonal space-time block codes do not maximally exploit the available frequency diversity in broadband fading multisensor channels. We propose block-orthogonal designs (which can be derived from existing orthogonal designs) to address this problem by considering symbol-vectors (i.e., data blocks) rather than symbols as transmission units.
openaire +1 more source