1995
DOI: 10.1109/26.403770
|View full text |Cite
|
Sign up to set email alerts
|

Noncoherent demodulation techniques for trellis coded M-DPSK signals

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

1997
1997
2018
2018

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 13 publications
0
5
0
Order By: Relevance
“…Additional simulations with other delay profiles and vehicle speeds are necessary for a more complete evaluation of these algorithms. Further work in several areas may lead to improved overall system performance; for example, multiple symbol differential detection [16] or even coherent modulation should in general yield better performance at a price of additional complexity. Our results above are given for systems without a first adjacent interference canceler, but they can be interpreted as results with a nonideal canceler with residual interference.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Additional simulations with other delay profiles and vehicle speeds are necessary for a more complete evaluation of these algorithms. Further work in several areas may lead to improved overall system performance; for example, multiple symbol differential detection [16] or even coherent modulation should in general yield better performance at a price of additional complexity. Our results above are given for systems without a first adjacent interference canceler, but they can be interpreted as results with a nonideal canceler with residual interference.…”
Section: Discussionmentioning
confidence: 99%
“…For simplicity, we consider differential demodulation based on only two adjacent received symbols because this case allows us to employ the Viterbi algorithm for decoding the CPPC code. Multiple-symbol differential detection methods [16] can offer coding gains of up to 3 dB over this approach, but are considerably more complex. Also shown in Fig.…”
Section: Differential Encodingmentioning
confidence: 99%
“…Then the k th received symbol r k is expressed as rk=hαsk+nk, where h denotes a channel impulse response, which is a zero‐mean circularly symmetric complex Gaussian random variable with normalized power, and black n k is the zero mean complex additive white Gaussian noise (AWGN) whose variance per dimension is N 0 /2. Note that h is invariant to time because we only assume slow or static channel where channel is almost static over several frames . This assumption is commonly applicable for short‐range and low‐data rate communication systems, such as WBAN or IoT applications, where both transmitter and receiver are fixed or slowly move.…”
Section: Decoding Criteria Of Repeated Dpsk Symbolmentioning
confidence: 99%
“…Note that h is invariant to time because we only assume slow or static channel where channel is almost static over several frames. 22 This assumption is commonly applicable for short-range and low-data rate *Note that when R is 1, Figure 1 is simply the typical DPSK modulator without repetition.…”
Section: Decoding Criteria Of Repeated Dpsk Symbolmentioning
confidence: 99%
“…In order to reduce the gap between scalar quantization and RVQ, we also consider encoding of each beam using trellis coded quantization (TCQ), which is analogous to trellis coded modulation [9], [10]. Using the Viterbi algorithm to search the codebook, the TCQ scheme entails only linear complexity in the number of feedback bits per coherent block.…”
Section: Introductionmentioning
confidence: 99%