Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,951,058 papers from all fields of science
Search
Sign In
Create Free Account
Trellis quantization
Known as:
Trellis
, Trellis quantisation
Trellis quantization is an algorithm that can improve data compression in DCT-based encoding methods. It is used to optimize residual DCT…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Data compression
Discrete cosine transform
JPEG 2000
Lossy compression
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1997
Highly Cited
1997
Symbol-by-symbol MAP demodulation of CPM and PSK signals on Rayleigh flat-fading channels
M. Gertsman
,
J. Lodge
IEEE Transactions on Communications
1997
Corpus ID: 15892320
Demodulation using the symbol-by-symbol maximum a posteriori probability (MAP) algorithm is presented. The algorithm is derived…
Expand
Highly Cited
1995
Highly Cited
1995
Maximum likelihood decoding of uncoded and coded PSK signal sequences transmitted over Rayleigh flat-fading channels
G. Vitetta
,
Desmond P. Taylor
IEEE Transactions on Communications
1995
Corpus ID: 39152586
The problem of maximum likelihood (ML) detection for uncoded and coded M-PSK signals on Rayleigh fading channels is investigated…
Expand
Highly Cited
1994
Highly Cited
1994
On entropy-constrained trellis coded quantization
M. Marcellin
IEEE Transactions on Communications
1994
Corpus ID: 30710829
An entropy-constrained trellis coded quantization (TCQ) scheme is presented for encoding memoryless sources. A simple 8-state…
Expand
Highly Cited
1990
Highly Cited
1990
The performance of trellis-coded MDPSK with multiple symbol detection
D. Divsalar
,
M. Simon
,
M. Shahshahani
IEEE Transactions on Communications
1990
Corpus ID: 37500910
The idea of using a multiple (more than two) symbol observation interval to improve error probability performance is applied to…
Expand
Highly Cited
1989
Highly Cited
1989
Bandwidth efficient coding for fading channels: code construction and performance analysis
C. Schlegel
,
D. Costello
IEEE Journal on Selected Areas in Communications
1989
Corpus ID: 41563470
The authors apply a general method of bounding the event error probability of TCM (trellis-coded modulation) schemes to fading…
Expand
Highly Cited
1988
Highly Cited
1988
The design of trellis coded MPSK for fading channels: set partitioning for optimum code design
D. Divsalar
,
M. Simon
IEEE Transactions on Communications
1988
Corpus ID: 5198398
A previous work on criteria for designing trellis-coded MPSK modulation to achieve minimum error probability performance on the…
Expand
Highly Cited
1988
Highly Cited
1988
Multiple trellis coded modulation (MTCM)
D. Divsalar
,
M. Simon
IEEE Transactions on Communications
1988
Corpus ID: 15307531
The authors demonstrate a trellis coded modulation technique referred to as multiple trellis coded modulation (MTCM) wherein more…
Expand
Highly Cited
1987
Highly Cited
1987
On the performance evaluation of trellis codes
E. Zehavi
,
J. Wolf
IEEE Transactions on Information Theory
1987
Corpus ID: 18646326
Generating function techniques for analyzing the error event and the bit-error probabilities for trellis codes are considered…
Expand
Highly Cited
1986
Highly Cited
1986
Coded Phase/Frequency Modulation
R. Padovani
,
J. Wolf
IEEE Transactions on Communications
1986
Corpus ID: 12786403
Channel coding combined with expanded signal sets has been shown [1] to improve error performance over uncoded modulation without…
Expand
Highly Cited
1978
Highly Cited
1978
A bandwidth-efficient class of signal-space codes
John B. Anderson
,
Desmond P. Taylor
IEEE Transactions on Information Theory
1978
Corpus ID: 41699915
A new class of codes in signal space is presented, and their error and spectral properties are investigated. A constant-amplitude…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE