Patent US5259003A successfully refreshed from Google Patents.
US5259003A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of encoding two digital data signals
Assignee: Atmel Corp
•
Filing: 1991-11-08
•
Granted: 1993-11-02
•
Expires: 2011-11-08
Abstract
Abstract A method to encode two digital data signals is disclosed. Each of the digital signals is characterized by a bit stream. An N bit block from the first signal is mapped to a unique M bit third signal where M is greater than N. Further, the number of "0's" in the M bit third signal is less than M/2. The M bit third signal is transmitted in the event a bit from the second signal is 0, whereas the complement of the M bit third signal is transmitted in the event a bit from the second signal is 1.
Inventors
- 👤 Toby Berger
- 👤 Keith Jarett
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 23:16
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/31; H03M5/00; H03M5/02; H03M5/04; H03M5/14; H03M5/145; H04; H04L; H04L25/00; H04L25/38; H04L25/40; H04L25/49; H04L25/4906; H04L25/4908; H04M; H04M1/00; H04M1/72; H04M1/725; H04M1/72502
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
132 words
A method of encoding two digital data signals: a first signal and a second signal, for transmission over a noisy channel, wherein each signal is characterized by a bit stream, said method comprising the steps of: mapping N bits of the first signal to a M bit (M>N) third signal wherein the number of "1"s is the M bit third signal is less than M/2 and wherein said M bit third signal has a complement; and transmitting said M bit third signal mapped from the N bits of the first signal, in the event a bit from the second signal is "0", and transmitting the complement of said M bit third signal mapped from the N bits of the first signal in the event a bit from the second signal is "1".
Claim 2
Independent Claim
132 words
A method of encoding two digital data signals: a first signal and a second signal, for transmission over a noisy channel, wherein each signal is characterized by a bit stream, said method comprising the steps of: mapping N bits of the first signal to a M bit (M>N) third signal wherein the number of "1"s is the M bit third signal is less than M/2 and wherein said M bit third signal has a complement; and transmitting said M bit third signal mapped from the N bits of the first signal, in the event a bit from the second signal is "0", and transmitting the complement of said M bit third signal mapped from the N bits of the first signal in the event a bit from the second signal is "1".
Claim 3
Dependent Claim
24 words
The method of claim 1 further comprising the steps of: encoding said M bit third signal with an error correction code, prior to transmission.
Claim 4
Dependent Claim
38 words
The method of claim 2 wherein said transmitting step further comprising: transmitting a plurality of concatenated M bit third signals, with each contiguous M bit third signal mapped from a contiguous N bit portion of the first signal.
Claim 5
Dependent Claim
26 words
The method of claim 3 further comprising the step of: encoding said plurality of M bit third signals with an error correction code, prior to transmission.
Claim 6
Independent Claim
96 words
A method of decoding a digital data signal, characterized by a bit stream, into a first digital signal and a second digital signal, wherein said decoding step comprises: receiving M bits of said digital data signal; outputting a "0" as said second digital signal in the event the number of "1"s in the M bits is less than M/2; and said "1" as a second digital signal in the event the number of "1"s in the M bits is greater than M/2; and mapping said received M bits to N bits as said first digital signal.
Claim 7
Independent Claim
96 words
A method of decoding a digital data signal, characterized by a bit stream, into a first digital signal and a second digital signal, wherein said decoding step comprises: receiving M bits of said digital data signal; outputting a "0" as said second digital signal in the event the number of "1"s in the M bits is less than M/2; and said "1" as a second digital signal in the event the number of "1"s in the M bits is greater than M/2; and mapping said received M bits to N bits as said first digital signal.
Claim 8
Dependent Claim
30 words
The method of claim 5 wherein said mapping step further outputs an error signal in the event the received M bits are unable to be mapped to the N bits.
Claim 9
Independent Claim
200 words
A method of transmitting and receiving two digital data signals: a first signal and a second signal over a noisy channel, wherein each signal is characterized by a bit stream, said method comprising the steps of: mapping N bits of the first signal to a M bit (M>N) third signal wherein the number of "1"s in the M bit third signal is less than M/2 and wherein said M bit third signal has a complement; transmitting over the channel the M bit third signal mapped from the N bits of the first signal, in the event a bit from the second signal is "0" and transmitting over the channel the complement of the M bit third signal mapped from the N bits of the first signal, in the event a bit from the second signal is "1"; receiving M bits from the channel; outputting a "0" as the second signal in the event the number of "1"s in the M bits is less than M/2, and a "1" as the second signal in the event the number of "1"s in the M bits is greater than M/2; and mapping said received M bits to N bits as said first signal.
Claim 10
Independent Claim
200 words
A method of transmitting and receiving two digital data signals: a first signal and a second signal over a noisy channel, wherein each signal is characterized by a bit stream, said method comprising the steps of: mapping N bits of the first signal to a M bit (M>N) third signal wherein the number of "1"s in the M bit third signal is less than M/2 and wherein said M bit third signal has a complement; transmitting over the channel the M bit third signal mapped from the N bits of the first signal, in the event a bit from the second signal is "0" and transmitting over the channel the complement of the M bit third signal mapped from the N bits of the first signal, in the event a bit from the second signal is "1"; receiving M bits from the channel; outputting a "0" as the second signal in the event the number of "1"s in the M bits is less than M/2, and a "1" as the second signal in the event the number of "1"s in the M bits is greater than M/2; and mapping said received M bits to N bits as said first signal.
Claim 11
Dependent Claim
30 words
The method of claim 7 wherein said mapping step further outputs an error signal in the event the received M bits are unable to be mapped to the N bits.
Claim 12
Independent Claim
161 words
A method of operating a digital cordless phone having a base unit and a remote unit, said method for communicating wirelessly between the base unit and the remote unit, said base unit transmitting a digital control signal and a digital data signal, over a channel, wherein each signal is characterized by a bit stream, said method comprising the steps of: mapping N bits of the digital data signal to a M bit (M>N) transmission signal wherein the number of "1"s in the M bit transmission signal is less than M/2 and wherein said M bit transmission signal has a complement; and transmitting the M bit transmission signal mapped from the N bits of the digital data signal, in the event a bit from the digital control signals is "0" and transmitting the complement of the M bit transmission signal mapped from the N bits of the digital data signal, in the event a bit from the digital control signal is "1".
Claim 13
Independent Claim
161 words
A method of operating a digital cordless phone having a base unit and a remote unit, said method for communicating wirelessly between the base unit and the remote unit, said base unit transmitting a digital control signal and a digital data signal, over a channel, wherein each signal is characterized by a bit stream, said method comprising the steps of: mapping N bits of the digital data signal to a M bit (M>N) transmission signal wherein the number of "1"s in the M bit transmission signal is less than M/2 and wherein said M bit transmission signal has a complement; and transmitting the M bit transmission signal mapped from the N bits of the digital data signal, in the event a bit from the digital control signals is "0" and transmitting the complement of the M bit transmission signal mapped from the N bits of the digital data signal, in the event a bit from the digital control signal is "1".
Claim 14
Dependent Claim
24 words
The method of claim 9 further comprising the step of: encoding said M bit transmission signal with an error correction code, prior to transmission.
Claim 15
Dependent Claim
39 words
The method of claim 10 wherein said transmitting step further comprising: transmitting a plurality of concatenated M bit transmission signals, with each contiguous M bit transmission signal mapped from a contiguous N bit portion of the digital data signal.
Claim 16
Dependent Claim
26 words
The method of claim 11 further comprising the steps of: encoding said plurality of M bit transmission signals with an error correction code, prior to transmission.
Claim 17
Dependent Claim
103 words
The method of claim 9 wherein said remote unit decodes a received digital data signal, characterized by a bit stream, into a first digital signal and a second digital signal, wherein said decoding step comprising: receiving M bits of said digital data signal; outputting a "0" as said second digital signal in the event the number of "1"s in the M bits is less than M/2; and said "1" as a second digital signal in the event the number of "1"s in the M bits is greater than M/2; and mapping said received M bits to N bits as said first digital signal.
Claim 18
Dependent Claim
30 words
The method of claim 13 wherein said mapping step further outputs an error signal in the event the received M bits are unable to be mapped to the N bits.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-11-01 | 1997-05-03 | 1997-11-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-11-01 | 2001-05-03 | 2001-11-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-11-01 | 2005-05-03 | 2005-11-02 | $7700.00 | Window Closed / Lapsed |