CoChat
Sign Up
Cited by 821

8-PSK trellis codes for a Rayleigh channel

Zehavi, E.·1992·IEEE Transactions on Communications
DOI 10.1109/26.141453
Open this paper in CoChat — free account

Abstract

A suboptimal trellis coding approach based on the concept of combining a good convolutional code and bit interleavers is presented. The aim is to improve the reliability of digital radio communication over a fading channel. It is shown that over a Rayleigh channel and for a fixed code complexity the proposed system is superior to the baseline system. Its performance is analyzed using the generalized R/sub o/ and the upper bound on the bit error rate. The results suggest that on a Rayleigh channel, the standard trellis codes may not be the correct approach for improving the reliability of the communication channel. The discussion is restricted to a rate 2/3 coded system with 8-PSK modulation.>

Integrity signals

Registry

Crossref · 10.1109/26.141453

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The separation of source and channel coding for many practical channels and short block lengths, as well as separate coding and modulation, are known to be sub-optimal.

    “For example, the separation of source and channel coding for many practical channels and short block lengths (see [10] and references therein) as well as separate coding and modulation [11] are known to be sub-optimal.”

    From An Introduction to Deep Learning for the Physical Layer (2017) · cites this paper as [11]

Cited by

Sorted by citations

Authors
Zehavi, E.
Venue
IEEE Transactions on Communications
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Published
1992-05
Volume
40
Issue
5
Pages
873-884
ISSN
0090-6778
DOI
10.1109/26.141453
Cited by
821
References
0
Licence
ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html (vor)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review