1991
DOI: 10.1109/26.87212
|View full text |Cite
|
Sign up to set email alerts
|

Suboptimum detection of trellis-coded CPM for transmission on bandwidth- and power-limited channels

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

1993
1993
2017
2017

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 24 publications
(4 citation statements)
references
References 13 publications
0
4
0
Order By: Relevance
“…It was shown in [20] that is time-invariant and can be synthesized as a differential encoder with arithmetic operations in the ring of integers modulo . That is, where is given by (6) where denotes modulo-addition. It was also shown in [20] that for , is a memoryless mapper that maps on to any one of the possible CPM signals from the CPM signal set .…”
Section: Cpm Modulator As Recursive Inner Codementioning
confidence: 99%
“…It was shown in [20] that is time-invariant and can be synthesized as a differential encoder with arithmetic operations in the ring of integers modulo . That is, where is given by (6) where denotes modulo-addition. It was also shown in [20] that for , is a memoryless mapper that maps on to any one of the possible CPM signals from the CPM signal set .…”
Section: Cpm Modulator As Recursive Inner Codementioning
confidence: 99%
“…This can be done either by the use of balanced modulating pulses, i.e. pulses fulfilling the condition: (7) or by ensuring that a running digital sum (RDS(W) of modulating data…”
Section: ( N -1 ) T < F < N Tmentioning
confidence: 99%
“…It is simple to prove that neither unipolar nor polar binary uncorrelated data can satisfy the condition (7). This can be only achieved by a premodulation encoding when a balanced line code is employed.…”
Section: ( N -1 ) T < F < N Tmentioning
confidence: 99%
See 1 more Smart Citation