Patent US5123019A successfully refreshed from Google Patents.
US5123019A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for processing binary code words
Assignee: Siemens AG
•
Filing: 1990-01-26
•
Granted: 1992-06-16
•
Expires: 2010-01-26
Abstract
Abstract In a method for processing incoming code words that are accompanied by parity bits and that, in the course of being transmitted, undergo a digital attenuation and/or a code conversion for generating further code words that are to be transmitted, the code words and the parity bits are subjected to parity tests for indicating whether parity errors exist prior to the performance of the digital attenuation and/or code conversion. Then, for each of the further code words a further parity bit is generated that is also to be transmitted, but that is inverted, if the parity test of a corresponding code word has shown that a parity error exists.
Inventors
- 👤 Gerd Boecker
- 👤 Rostislav Kaderka
- 👤 Rudolf Krumenacker
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 11:39
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; H; H03; H03M; H03M13/00; H03M13/03; H03M13/05; H03M13/09; H03M13/098; G06F11/14
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
225 words
A method used for transmitting digital data from a first location to a second location, said method employed for processing incoming first code words to be processed that are accompanied by first parity bits and that, in the course of being transmitted, undergo a digital conversion for generating second code words that are to be transmitted to said second location, said method comprising the steps of: applying said first code words and said first parity bits to a parity generator to parity test said applied words and bits for indicating whether parity errors exist prior to the performance of said digital conversion, storing second code words in a first memory where there is stored a second code word for each first code word and reading out said second stored code word and applying said second stored word to a parity generator to provide for each of said second code words a second parity bit that is to be transmitted together with each of said second code words, and inverting said second parity bit after the performance of said digital conversion and before the transmission to said second location, if said parity test of a corresponding first code word has shown that a parity error exists, and transmitting said second code word to said second location with said second parity bit after the step of inverting.
Claim 2
Independent Claim
225 words
A method used for transmitting digital data from a first location to a second location, said method employed for processing incoming first code words to be processed that are accompanied by first parity bits and that, in the course of being transmitted, undergo a digital conversion for generating second code words that are to be transmitted to said second location, said method comprising the steps of: applying said first code words and said first parity bits to a parity generator to parity test said applied words and bits for indicating whether parity errors exist prior to the performance of said digital conversion, storing second code words in a first memory where there is stored a second code word for each first code word and reading out said second stored code word and applying said second stored word to a parity generator to provide for each of said second code words a second parity bit that is to be transmitted together with each of said second code words, and inverting said second parity bit after the performance of said digital conversion and before the transmission to said second location, if said parity test of a corresponding first code word has shown that a parity error exists, and transmitting said second code word to said second location with said second parity bit after the step of inverting.
Claim 3
Dependent Claim
68 words
A method according to claim 1, wherein said memory is a read-only memory, which is addressed by said first code words and which stores said second code words, wherein result bits are generated as results of said parity tests, and wherein each of said second parity bits is combined with a result bit of a parity test of a corresponding first code word before said step of transmitting.
Claim 4
Dependent Claim
41 words
A method according to claim 2, where said parity test is performed on a parity of said bits having a binary value of one and wherein said combination of said second parity bits and said result bits is an EXCLUSIVE-OR function.
Claim 5
Dependent Claim
26 words
A method according to claim 3, wherein said second parity bits are generated after said second code words are read out from said first read-only memory.
Claim 6
Dependent Claim
38 words
A method according to claim 3, wherein said second parity bits are stored in a second read-only memory, which is read out simultaneously with said first read-only memory under the same addresses as the respective first code words.
Claim 7
Dependent Claim
106 words
A method according to claim 3, wherein each of said second code words is stored in said first read only memory without its most significant bit, which is the sign bit for determining the sign, wherein said sign bits are used as sign bits of said second code words, wherein said first read-only memory comprises second parity bits for the remaining portions of said second code words, and wherein a second parity bit is inverted if said parity test of a corresponding first code word has shown that a parity error exists or if said sign bit has a binary value whose parity is being tested.
Claim 8
Dependent Claim
82 words
A method according to claim 6, wherein parity of the 1 bits is being tested, wherein said sign bits of said first code words and said result bits of said parity tests are combined according to an EXCLUSIVE-OR function, and wherein the result of said EXCLUSIVE-OR function is likewise combined with said second parity bits for the remaining portions of said second code words according to an EXCLUSIVE-OR function for providing a new binary value of second parity bits to be transmitted.
Claim 9
Dependent Claim
26 words
A method according to claim 2, wherein said second parity bits are provided after said second code words are read out from said first read-only memory.
Claim 10
Dependent Claim
38 words
A method according to claim 2, wherein said second parity bits are stored in a second read-only memory, which is read out simultaneously with said first read-only memory under the same addresses as the respective first code words.
Claim 11
Dependent Claim
111 words
A method according to claim 2, wherein each of said second code words is stored in said first read only memory without its most significant bit, which is the sign bit for determining the sign, wherein aid sign bits are used as sign bits of said second code words, wherein said first read-only memory stores second parity bits for the remaining portions of said second code words, and wherein a second parity bit is inverted if said parity test of a corresponding first code word has shown that a parity error exists or if said sign bit of said second code word has a binary value whose parity is being tested.
Claim 12
Dependent Claim
77 words
A method according to claim 10, wherein parity of the 1 bits is being tested, wherein said sign bits and said result bits of said parity tests are combined according to an EXCLUSIVE-OR function, and wherein the result of said EXCLUSIVE-OR function is likewise combined with said second parity bits for the remaining portions of said second code words according to an EXCLUSIVE-OR function for providing a new binary value of second parity bits to be transmitted.
Claim 13
Dependent Claim
17 words
The method according to claim 1, wherein said digital conversion includes a digital attenuation and/or code conversion.
References Cited (Backward Citations)
US4051355A
Cited
US4103823A
Cited
US4155070A
Cited
US4291408A
Cited
US4355393A
Cited
US4271521A
Cited
US4429391A
Cited
US4580265A
Cited
US4730320A
Cited
US4700358A
Cited
US4774712A
Cited
US4876686A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-06-16 | 1995-12-16 | 1996-06-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-06-16 | 1999-12-16 | 2000-06-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-06-16 | 2003-12-16 | 2004-06-16 | $7700.00 | Window Closed / Lapsed |