Pulse or digital communications – Repeaters – Testing
Patent
1983-04-18
1984-11-13
Safourek, Benedict V.
Pulse or digital communications
Repeaters
Testing
371 43, 375 39, H04L 512, H04L 110
Patent
active
044830122
ABSTRACT:
A technique for converting a sequence of binary digits into a sequence of signalling alphabets of a modulated carrier signal for data transmission. By introducing additional redundant signalling alphabets and differentially coding incoming data in a state-dependent sequential manner, enlarged minimum Euclidean distance between possible sequences of signaling alphabets is achieved while phase ambiguity of the expanded set of signalling alphabets is removed. This results in a reduced error probability when maximum likelihood decoding is applied in the receiver.
REFERENCES:
patent: 4077021 (1978-02-01), Csajka et al.
patent: 4114710 (1978-09-01), Katoh et al.
patent: 4208739 (1980-06-01), Lu et al.
patent: 4346472 (1982-08-01), Ohkashi et al.
"The Viterbi Algorithm", Proc. of IEEE, vol. 61, No. 3, Mar. 1971, by G. D. Forney, pp. 268-278.
"Jointly Adaptive Equalization and Carrier Recovery in Two-Dimensional Digital Communication Systems", BSTJ, vol. 55, No. 3, Mar. 1976, By D. D. Falconer, pp. 317-334.
"Channel Coding with Multilevel/Phase Signals", IEEE Trans. on Information Theory, vol. IT-28, No. 1, Jan. 1982, by G. Ungerboeck, pp. 55-67.
AT&T Information Systems
Freedman B. H.
Safourek Benedict V.
LandOfFree
Differentially convolutional channel coding with expanded set of does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Differentially convolutional channel coding with expanded set of, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Differentially convolutional channel coding with expanded set of will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2364847