← Back to Patent Explorer
US4523323A Expired / Lapsed US ⏱️ 0.0 years remaining

Digital signal communication system for multi-level modulation including unique encoder and decoder

Assignee: NEC Corp
•
Filing: 1983-02-11
•
Granted: 1985-06-11
•
Expires: 2003-02-11
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A digital signal communication system has a transmitter for differentially converting first digital signals of n trains (n is an integer of 3 or larger) into a second digital signal of n trains comprising a plurality of words. Responsive to the second digital signals, a modulated signal is provided with 2 n (=N) modulation levels, which are transmitted. A receiver responds to the modulated signals, and demodulates them to provide signals of n trains corresponding to the second digital signals. This demodulated signal is differentially converted to provide n trains of signals corresponding to the first digital signals. The Hamming distance between two words of said second digital signals corresponding to the adjacent two modulation levels is either 1 or 2 and the numbers of the Hamming distances of 1 and 2 equal N/2, respectively.

Inventors

  • 👤 Masahiro Nakajima
  • 👤 Hiromi Hashimoto

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 10:46
CPC Classifications
H; H04; H04L; H04L27/00; H04L27/18

Claims Analysis

Total Claims: 14
Claim 1
Independent Claim 175 words
A digital signal communication system comprising transmitter means having first means for differentially converting first digital signals of n trains (n is an integer of 3 or larger) into second digital signals of n trains comprising a plurality of words, second means responsive to said second digital signals for providing a modulated signal with 2 n (=N) modulation levels, third means for transmitting said modulated signal, receiver means having fourth means for receiving said modulated signal, fifth means for demodulating the output from said fourth means to provide third digital signals of n trains corresponding to said second digital signals, and sixth means for differentially converting said third digital signals of n trains to provide fourth digital signals of n trains corresponding to said first digital signals, the second and third means being characterized in that the Hamming distance between two words of said second and third digital signals corresponding to two adjacent modulation levels is either 1 or 2 and each of the Hamming distance of 1 and of 2 is equal to N/2.
Claim 2
Dependent Claim 175 words
A digital signal communication system comprising transmitter means having first means for differentially converting first digital signals of n trains (n is an integer of 3 or larger) into second digital signals of n trains comprising a plurality of words, second means responsive to said second digital signals for providing a modulated signal with 2 n (=N) modulation levels, third means for transmitting said modulated signal, receiver means having fourth means for receiving said modulated signal, fifth means for demodulating the output from said fourth means to provide third digital signals of n trains corresponding to said second digital signals, and sixth means for differentially converting said third digital signals of n trains to provide fourth digital signals of n trains corresponding to said first digital signals, the second and third means being characterized in that the Hamming distance between two words of said second and third digital signals corresponding to two adjacent modulation levels is either 1 or 2 and each of the Hamming distance of 1 and of 2 is equal to N/2.
Claim 3
Dependent Claim 90 words
A process for transmitting information comprising the steps of: (a) accepting incoming information data in a form of a bit stream of binary words; (b) converting said information data of step (a) into a unique encoding having a bit stream of binary words separated by Hamming distances which are equally divided between "1" and "2", each word comprising bits equal to or greater than "3"; (c) transmitting said uniquely encoded signals to a distant location; and (d) reconverting said uniquely encoded signals into a information data at said distant location.
Claim 4
Dependent Claim 90 words
A process for transmitting information comprising the steps of: (a) accepting incoming information data in a form of a bit stream of binary words; (b) converting said information data of step (a) into a unique encoding having a bit stream of binary words separated by Hamming distances which are equally divided between "1" and "2", each word comprising bits equal to or greater than "3"; (c) transmitting said uniquely encoded signals to a distant location; and (d) reconverting said uniquely encoded signals into a information data at said distant location.
Claim 5
Dependent Claim 82 words
The process of claim 2 wherein said unique encoding of steps (b) and (d) is described by the following Table: ______________________________________ X.sub.2 X.sub.1 X.sub.0 ______________________________________ P.sub.0 0 0 0 P.sub.1 0 0 1 P.sub.2 0 1 0 P.sub.3 0 1 1 P.sub.4 1 1 0 P.sub.5 1 1 1 P.sub.6 1 0 0 P.sub.7 1 0 1 ______________________________________ wherein X 0 . . . X 2 are binary bits and P 0 . . . P 7 are eight distinctive phase angles.
Claim 6
Dependent Claim 47 words
The process of claim 3 wherein step (c) comprises the added step of modulating the unique code into eight distinctive phase angles identified by the notations P 0 . . . P 7 where each of said eight phases is separated from its neighboring phases by 45°.
Claim 7
Dependent Claim 131 words
The process of claim 2 wherein said unique encoding of steps (b) and (d) is described by the following Table: ______________________________________ X.sub.3 X.sub.2 X.sub.1 X.sub.0 ______________________________________ P.sub.0 0 0 0 0 P.sub.1 0 0 1 0 P.sub.2 0 0 0 1 P.sub.3 0 1 0 0 P.sub.4 0 1 0 1 P.sub.5 0 0 1 1 P.sub.6 0 1 1 1 P.sub.7 0 1 1 0 P.sub.8 1 1 1 1 P.sub.9 1 1 1 0 P.sub.10 1 0 1 1 P.sub.11 1 1 0 1 P.sub.12 1 1 0 0 P.sub.13 1 0 0 1 P.sub.14 1 0 1 0 P.sub.15 1 0 0 0 ______________________________________ wherein X 0 . . . X 3 are binary bits and P 0 . . . P 15 are sixteen distinctive phase angles.
Claim 8
Dependent Claim 47 words
The process of claim 5 wherein step (c) comprises the added step of modulating the unique code into sixteen distinctive phase angles identified by the notations P 0 . . . P 15 where each of said sixteen phases is separated from its neighboring phases by 22.5°.
Claim 9
Dependent Claim 86 words
A process for transmitting information comprising the steps of: (a) converting incoming information data having a bit stream of binary words into unique binary words separated by Hamming distances which are divided equally between "1" and "2", each word comprising bits equal to or greater than 3; (b) converting unique binary words into differentially encoded binary words; (c) transmitting said differentially encoded binary words to a distant location; and (d) reconverting said differentially encoded binary words into unique binary words and then into said information data.
Claim 10
Dependent Claim 86 words
A process for transmitting information comprising the steps of: (a) converting incoming information data having a bit stream of binary words into unique binary words separated by Hamming distances which are divided equally between "1" and "2", each word comprising bits equal to or greater than 3; (b) converting unique binary words into differentially encoded binary words; (c) transmitting said differentially encoded binary words to a distant location; and (d) reconverting said differentially encoded binary words into unique binary words and then into said information data.
Claim 11
Dependent Claim 115 words
A process for transmitting information comprising the steps of: (a) converting incoming information data having a bit stream of binary words into unique encoded binary words separated by Hamming distances which are equally divided between "1" and "2", each word comprising n bits equal to or greater than 3; (b) assigning said uniquely encoded binary words to 2 n (=N) distinctive phase angles where each of said 2 n distinctive phase angles is separated from its neighboring phases by 360°/N, t provide a modulation signal; (c) transmitting said modulation signal to a distant location; and (d) reconverting said modulation signal into uniquely encoded binary words at said distant location and then into said information data.
Claim 12
Dependent Claim 115 words
A process for transmitting information comprising the steps of: (a) converting incoming information data having a bit stream of binary words into unique encoded binary words separated by Hamming distances which are equally divided between "1" and "2", each word comprising n bits equal to or greater than 3; (b) assigning said uniquely encoded binary words to 2 n (=N) distinctive phase angles where each of said 2 n distinctive phase angles is separated from its neighboring phases by 360°/N, t provide a modulation signal; (c) transmitting said modulation signal to a distant location; and (d) reconverting said modulation signal into uniquely encoded binary words at said distant location and then into said information data.
Claim 13
Dependent Claim 145 words
A process for transmitting information comprising the steps of: (a) converting first signals having a bit stream of binary words into second signals having unique binary words separated by Hamming distances between "1" and "2", each word comprising n bits equal to or greater than 3; (b) differentially converting said second signals into third signals; (c) converting said third signals into modulation signals having 2 n (=N) distinctive phase angles where each of said 2 2 distinctive phase angles is separated from its neighboring phases by 360°/N; (d) transmitting said modulation signal to a distant location; (e) reconverting said modulation signal into fourth signals corresponding to said third signals at said distant location; (f) differentially reconverting said fourth signals into fifth signals corresponding to said second signals at said distant location; and (g) reconverting said fifth signals into sixth signals corresponding to said first signals.
Claim 14
Dependent Claim 145 words
A process for transmitting information comprising the steps of: (a) converting first signals having a bit stream of binary words into second signals having unique binary words separated by Hamming distances between "1" and "2", each word comprising n bits equal to or greater than 3; (b) differentially converting said second signals into third signals; (c) converting said third signals into modulation signals having 2 n (=N) distinctive phase angles where each of said 2 2 distinctive phase angles is separated from its neighboring phases by 360°/N; (d) transmitting said modulation signal to a distant location; (e) reconverting said modulation signal into fourth signals corresponding to said third signals at said distant location; (f) differentially reconverting said fourth signals into fifth signals corresponding to said second signals at said distant location; and (g) reconverting said fifth signals into sixth signals corresponding to said first signals.

References Cited (Backward Citations)

US3311878A Cited
US3818442A Cited
US3831145A Cited
US4101934A Cited
US4199809A Cited
US4211996A Cited
US4335458A Cited
US4276647A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1988-06-10 1988-12-10 1989-06-11 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1992-06-10 1992-12-10 1993-06-11 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1996-06-10 1996-12-10 1997-06-11 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag