1991
DOI: 10.1007/3-540-54303-1_138
|View full text |Cite
|
Sign up to set email alerts
|

Coded modulation with convolutional codes over rings

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

1995
1995
2019
2019

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 1 publication
0
3
0
Order By: Relevance
“…Initial work on non-binary convolutional codes over rings, using phase-shift keying (PSK) modulation, dates back to [17], [18], where various convolutional code designs were presented for the AWGN channel. In order to make the codes robust against block-wise phase noise, an additional differential modulator is suggested in [18], without yet considering powerful turbo detection at the receiver.…”
Section: Introductionmentioning
confidence: 99%
“…Initial work on non-binary convolutional codes over rings, using phase-shift keying (PSK) modulation, dates back to [17], [18], where various convolutional code designs were presented for the AWGN channel. In order to make the codes robust against block-wise phase noise, an additional differential modulator is suggested in [18], without yet considering powerful turbo detection at the receiver.…”
Section: Introductionmentioning
confidence: 99%
“…When PSK modulations are considered, it seems to be natural to use channel codes over rings, preserving the linearity of the overall scheme. Convolutional codes over rings for AWGN channels in absence of phase noise were considered in [9], [10]. LDPC codes over rings for the coherent AWGN channel and PSK modulation were investigated in the context of bandwidth-efficient communications in [11] and it was shown that they may outperform typical techniques like binary bit-interleaved coded modulation.…”
Section: Introductionmentioning
confidence: 99%
“…It was noted that the construction of such LDPC codes must be taken with particular care. Zero divisors in the parity-check matrix may lead to poor minimum distances [9].…”
Section: Introductionmentioning
confidence: 99%