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

Precoded ternary data transmission

Assignee: AT&T Inc
•
Filing: 1969-06-24
•
Granted: 1972-07-25
•
Expires: 1989-06-24
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A digital data transmission rate of three bits per cycle of bandwidth is achieved in precoded partial-response band-limited communication channels by partitioning binary digits into groups of three two-level digits and translating these binary groups of three into pairs of three-level digits prior to transmission. Correct pairwise association of received signals is accomplished by reserving a three-level digit pair of monitoring purposes. This reserved pair can validly occur only at a transition between allowable pairs. By monitoring the presence of the reserved pair, correct pairwise association of ternary digits is assured and binary digits are properly decoded without having to provide a special framing signal.

Inventors

  • 👤 Robert D Howson

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-22 22:34
CPC Classifications
H; H04; H04L; H04L25/00; H04L25/38; H04L25/40; H04L25/49; H04L25/497; H04L7/00; H04L7/04

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 220 words
Apparatus for communicating a binary data signal over a transmission channel of bandwidth W at an effective binary bit rate that is a nonintegral multiple of the channel symbol rate, comprising means for mapping each possible first block of binary digits taken m at a time into second blocks of n preassigned N-level digits such that 2m is less than Nn and there exists at least one unassigned N-level block, means for precoding N-level digits from said mapping means in accordance with the inverse of the impulse response of said channel such that precoded N-level digits can be decoded from single samples of the received signal, means for exciting said channel with precoded digits from said precoding means at a signaling rate of 2W symbols per second such that channel signals occupy (2N-1) levels, means for reconstructing said N-level digits from said channel signals, means for monitoring N-level digits from said reconstructing means for the presence of said unassigned N-level block therein and producing a framing control signal, means responsive to said framing control signal for partitioning reconstructed N-level digits into n-length blocks such that said unassigned block does not occur within partitioned blocks to be decoded, and means under the control of said partitioning means for translating partitioned blocks of N-level digits into a serial train of binary digits.
Claim 2
Dependent Claim 220 words
Apparatus for communicating a binary data signal over a transmission channel of bandwidth W at an effective binary bit rate that is a nonintegral multiple of the channel symbol rate, comprising means for mapping each possible first block of binary digits taken m at a time into second blocks of n preassigned N-level digits such that 2m is less than Nn and there exists at least one unassigned N-level block, means for precoding N-level digits from said mapping means in accordance with the inverse of the impulse response of said channel such that precoded N-level digits can be decoded from single samples of the received signal, means for exciting said channel with precoded digits from said precoding means at a signaling rate of 2W symbols per second such that channel signals occupy (2N-1) levels, means for reconstructing said N-level digits from said channel signals, means for monitoring N-level digits from said reconstructing means for the presence of said unassigned N-level block therein and producing a framing control signal, means responsive to said framing control signal for partitioning reconstructed N-level digits into n-length blocks such that said unassigned block does not occur within partitioned blocks to be decoded, and means under the control of said partitioning means for translating partitioned blocks of N-level digits into a serial train of binary digits.
Claim 3
Dependent Claim 25 words
The apparatus of claim 1 in which m and N equal 3 and n equals 2 and there is only one unassigned three-level signal block.
Claim 4
Dependent Claim 181 words
Apparatus for communicating a binary data signal train to achieve an effective signaling rate of three bits per second per Hertz of bandwidth comprising means for mapping first blocks Of serial binary data taken three digits at a time into preassigned second blocks of three-level digits taken two digits at a time, there being one unassigned three-level digit pair which can occur only between properly mapped second blocks, means for exciting a communication channel of limited bandwidth with said second blocks of digits at a symbol rate equal to twice the bandwidth of said channel, means at a receiver connected to said channel for recording said three-level digits, means for monitoring pairs of three-level digits from said recovering means for the presence of said unassigned digit pair and generating a framing signal therefrom, means responsive to said framing signal for partitioning recovered three-level digits into pairs such that said unassigned pair occurs only as the last and first digit respectively of consecutive partitioned blocks, and means for decoding three-level digit pairs from said partitioning means into a serial binary data train.
Claim 5
Dependent Claim 181 words
Apparatus for communicating a binary data signal train to achieve an effective signaling rate of three bits per second per Hertz of bandwidth comprising means for mapping first blocks Of serial binary data taken three digits at a time into preassigned second blocks of three-level digits taken two digits at a time, there being one unassigned three-level digit pair which can occur only between properly mapped second blocks, means for exciting a communication channel of limited bandwidth with said second blocks of digits at a symbol rate equal to twice the bandwidth of said channel, means at a receiver connected to said channel for recording said three-level digits, means for monitoring pairs of three-level digits from said recovering means for the presence of said unassigned digit pair and generating a framing signal therefrom, means responsive to said framing signal for partitioning recovered three-level digits into pairs such that said unassigned pair occurs only as the last and first digit respectively of consecutive partitioned blocks, and means for decoding three-level digit pairs from said partitioning means into a serial binary data train.
Claim 6
Dependent Claim 29 words
Apparatus as defined in claim 3 in which said three-level digits are precoded before exciting said channel in accordance with the inverse of the impulse response of said channel.
Claim 7
Dependent Claim 17 words
Apparatus as defined in claim 3 in which said three-level digits are coded in two-rail binary form.
Claim 8
Dependent Claim 113 words
Apparatus as defined in claim 3 in which said partitioning means comprises a timing-wave source having a square-wave output at half the channel symbol rate, means jointly responsive to said timing-wave source and said framing signal for generating a first control output when said framing signal occurs during the first half-cycle of said timing wave and a second control output when said framing signal occurs during said second half-cycle thereof, a reversible counter controlled by first and second control outputs of said generating means, an excess of said second over said first control outputs yielding an overflow signal, and means responsive to said overflow signal for reversing the phase of said timing-wave output.
Claim 9
Independent Claim 167 words
The method of communicating a binary data signal train in a precoded multilevel format to achieve an effective signaling rate of three bits per cycle of bandwidth of a communications channel comprising the steps of performing a serial to parallel conversion of serial binary data bits taken three at a time into first blocks, mapping said first blocks of binary data into second blocks of paired ternary digits, there being one nonallowed ternary pair which can only occur between valid second blocks, applying the ternary digits of said second blocks to said communications channel to form precoded multilevel signals at two-thirds the binary signaling rate, recovering at a receiver said ternary digits by a modulo-three reduction of said multilevel signals, monitoring pairs of recovered ternary digits for the occurrence of said nonallowed ternary pair, partitioning responsive to the occurrence of said nonallowed ternary pair said recovered ternary digits into valid second blocks, and decoding properly partitioned second blocks of ternary digits into first blocks of binary digits.
Claim 10
Independent Claim 167 words
The method of communicating a binary data signal train in a precoded multilevel format to achieve an effective signaling rate of three bits per cycle of bandwidth of a communications channel comprising the steps of performing a serial to parallel conversion of serial binary data bits taken three at a time into first blocks, mapping said first blocks of binary data into second blocks of paired ternary digits, there being one nonallowed ternary pair which can only occur between valid second blocks, applying the ternary digits of said second blocks to said communications channel to form precoded multilevel signals at two-thirds the binary signaling rate, recovering at a receiver said ternary digits by a modulo-three reduction of said multilevel signals, monitoring pairs of recovered ternary digits for the occurrence of said nonallowed ternary pair, partitioning responsive to the occurrence of said nonallowed ternary pair said recovered ternary digits into valid second blocks, and decoding properly partitioned second blocks of ternary digits into first blocks of binary digits.

References Cited (Backward Citations)

US3175157A Cited
US3518662A Cited
US3492578A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1975-07-25 1976-01-24 1976-07-25 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1979-07-25 1980-01-24 1980-07-25 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1983-07-25 1984-01-24 1984-07-25 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag