Patent US4649543A successfully refreshed from Google Patents.
US4649543A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Synchronization sequence decoder for a digital radiotelephone system
Assignee: Motorola Solutions Inc
•
Filing: 1985-08-30
•
Granted: 1987-03-10
•
Expires: 2005-08-30
Abstract
Abstract A decoding system and method is disclosed for a radiotelephone system carrying digital messages. A set of multibit high auto-correlation, low cross-correlation synchronization words and their ones complement inverses are employed for message synchronization and supervisory functions. System state communication is achieved by utilizing a sequence of normal synchronization words and their ones complement inverses. Reliability of the coding is achieved by detecting normal or inverse words as binary levels when fewer than a predetermined number of bit errors exist in the bit sequence. If the predetermined number of bit errors is exceeded, a selected binary one or zero is substituted. This selected sequence of binary levels is decoded and the Hamming distance between a masked decoded sequence and a masked selected sequence is calculated. If the Hamming distance calculated yields a number less than or equal to a number equal to the synchronization error correction capability of the coding function, the decoded sequence is accepted as correct. If the Hamming distance calculation yields a number greater than the error correction capability value, a new set of substituted binary levels is tried.
Inventors
- 👤 Stephen N. Levine
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 11:53
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/004; H04L1/0045; H04B; H04B7/00; H04B7/24; H04B7/26; H04B7/2643; H04L7/00; H04L7/04; H04L7/041; H04L7/042; H04L7/046; H04L7/10
Claims Analysis
Total Claims: 38
Claim 1
Independent Claim
143 words
A decoder for decoding system states conveyed in sequences of multi-bit normal words and inverse words used for synchronizing digital messages transmitted over a radio channel which may introduce bit errors into said words, said decoder comprising: means, responsive to the introduced bit errors, for detecting a normal word, an inverse word, and a word miss and for assigning a first binary level to said detected normal word, a second binary level to said detected inverse word, and a selected one of said binary levels to said word miss, thereby creating a selected sequence of binary levels; means for generating a decoded sequence of binary levels corresponding to one of the system states; and means for comparing said selected sequence and said decoded sequence and for indicating a correct system state decode when said selected and decoded sequences have a predetermined correlation therebetween.
Claim 2
Dependent Claim
143 words
A decoder for decoding system states conveyed in sequences of multi-bit normal words and inverse words used for synchronizing digital messages transmitted over a radio channel which may introduce bit errors into said words, said decoder comprising: means, responsive to the introduced bit errors, for detecting a normal word, an inverse word, and a word miss and for assigning a first binary level to said detected normal word, a second binary level to said detected inverse word, and a selected one of said binary levels to said word miss, thereby creating a selected sequence of binary levels; means for generating a decoded sequence of binary levels corresponding to one of the system states; and means for comparing said selected sequence and said decoded sequence and for indicating a correct system state decode when said selected and decoded sequences have a predetermined correlation therebetween.
Claim 3
Dependent Claim
44 words
A decoder in accordance with claim 1 wherein said means for comparing further comprises means for masking said selected binary levels in said selected sequence and corresponding binary levels in said decoded sequence, thereby creating a masked selected sequence and a masked decoded sequence.
Claim 4
Dependent Claim
30 words
A decoder in accordance with claim 2 wherein said means for comparing further comprises means for calculating the Hamming distance between said masked selected sequence and said masked decoded sequence.
Claim 5
Dependent Claim
28 words
A decoder in accordance with claim 3 wherein said means for comparing further comprises means for comparing said calculated Hamming distance to a synchronization error correction capability value.
Claim 6
Dependent Claim
42 words
A decoder in accordance with claim 4 further comprising means, responsive to said Hamming distance comparison to said synchronization error correction capability value, for changing said selected binary levels if said Hamming distance is greater than said synchronization error correction capability value.
Claim 7
Dependent Claim
26 words
A decoder in accordance with claim 1 wherein said means for selecting one of said binary levels further comprises means for randomly selecting a binary level.
Claim 8
Dependent Claim
29 words
A decoder in accordance with claim 1 wherein said means for selecting one of said binary levels further comprises means for selecting a binary level based on best-guess information.
Claim 9
Dependent Claim
29 words
A decoder in accordance with claim 1 further comprising means for counting the number of selections of a binary level made during the sequence of normal and inverse words.
Claim 10
Dependent Claim
35 words
A decoder in accordance with claim 8 further comprising means for indicating an incorrect system state decode when said count of the number of selections equals or exceeds the minimum distance of synchronization sequence code.
Claim 11
Independent Claim
230 words
A system for decoding control information contained in a sequence of normal and ones complement inverse synchronization words of a data message which may be transmitted on a noisy communications channel, said system for decoding comprising: means for receiving said synchronization words; means for detecting a normal word, an inverse word, and a word miss and for assigning a first binary level to said detected normal word if fewer than a first predetermined number of bit errors exist, assigning a second binary level to said detected inverse word if fewer than said first predetermined number of bit errors exists, and assigning a selected one of said binary levels to said word miss detection if said first predetermined number of bit errors is equalled or exceeded thereby creating a selected sequence; means for decoding said selected sequence into a decoded sequence; means for masking said selected binary levels in said selected sequence and masking corresponding binary levels in said decoded sequence, thereby creating a masked selected sequence and a masked decoded sequence; means for calculating the Hamming distance between said masked decoded sequence and said masked selected sequence; means for determining whether said Hamming distance is less than a second predetermined number, thereby indicating correctly decoded control information; and means for changing one or more of said selected binary levels if said Hamming distance is greater than said second predetermined number.
Claim 12
Independent Claim
230 words
A system for decoding control information contained in a sequence of normal and ones complement inverse synchronization words of a data message which may be transmitted on a noisy communications channel, said system for decoding comprising: means for receiving said synchronization words; means for detecting a normal word, an inverse word, and a word miss and for assigning a first binary level to said detected normal word if fewer than a first predetermined number of bit errors exist, assigning a second binary level to said detected inverse word if fewer than said first predetermined number of bit errors exists, and assigning a selected one of said binary levels to said word miss detection if said first predetermined number of bit errors is equalled or exceeded thereby creating a selected sequence; means for decoding said selected sequence into a decoded sequence; means for masking said selected binary levels in said selected sequence and masking corresponding binary levels in said decoded sequence, thereby creating a masked selected sequence and a masked decoded sequence; means for calculating the Hamming distance between said masked decoded sequence and said masked selected sequence; means for determining whether said Hamming distance is less than a second predetermined number, thereby indicating correctly decoded control information; and means for changing one or more of said selected binary levels if said Hamming distance is greater than said second predetermined number.
Claim 13
Dependent Claim
30 words
A system in accordance with claim 10 further comprising means for counting the number of selections of a binary level made during the sequence of normal and inverse synchronization words.
Claim 14
Dependent Claim
35 words
A system in accordance with claim 11 further comprising means for indicating incorrectly decoded control information when said count of the number of selections equals or exceeds the minimum distance of the synchronization sequence code.
Claim 15
Dependent Claim
45 words
A system in accordance with claim 10 wherein said means for determining whether said Hamming distance is less than a second predetermined number further comprises means for determining whether said Hamming distance is equal to said second predetermined number, thereby indicating correctly decoded control information.
Claim 16
Dependent Claim
55 words
A system in accordance with claim 10 wherein said means for changing one or more of said selected binary levels if said Hamming distance is greater than said second predetermined number further comprises means for changing one or more of said selected binary levels if said Hamming distance is equal to said second predetermined number.
Claim 17
Dependent Claim
26 words
A system in accordance with claim 10 wherein said means for selecting one of said binary levels further comprises means for randomly selecting a binary level.
Claim 18
Dependent Claim
29 words
A system in accordance with claim 10 wherein said means for selecting one of said binary levels further comprises means for selecting a binary level based on best-guess information.
Claim 19
Dependent Claim
20 words
A system in accordance with claim 10 wherein said second predetermined number further comprises the synchronization error correction capacity value.
Claim 20
Independent Claim
141 words
A method of decoding system states conveyed in sequences of normal and inverse synchronization words in a radiotelephone system carrying digital messages, said method of decoding comprising the steps of: detecting a normal word as one binary level and detecting an inverse word as the opposite binary level if fewer than a predetermined number of bit errors exist in the word to be detected; selecting one of the binary levels for a word detection if said predetermined number of errors is exceeded; combining said detected word binary levels and any said selected binary levels into a selected sequence of binary levels; generating a decoded sequence of binary levels corresponding to one of the system states; and comparing said selected sequence and said decoded sequence and indicating a correct sequence decode when said selected and decoded sequences have a predetermined correlation therebetween.
Claim 21
Independent Claim
141 words
A method of decoding system states conveyed in sequences of normal and inverse synchronization words in a radiotelephone system carrying digital messages, said method of decoding comprising the steps of: detecting a normal word as one binary level and detecting an inverse word as the opposite binary level if fewer than a predetermined number of bit errors exist in the word to be detected; selecting one of the binary levels for a word detection if said predetermined number of errors is exceeded; combining said detected word binary levels and any said selected binary levels into a selected sequence of binary levels; generating a decoded sequence of binary levels corresponding to one of the system states; and comparing said selected sequence and said decoded sequence and indicating a correct sequence decode when said selected and decoded sequences have a predetermined correlation therebetween.
Claim 22
Dependent Claim
47 words
A method in accordance with the method of claim 18 wherein said comparing step further comprises the step of masking said selected binary levels in said selected sequence and corresponding binary levels in said decoded sequence, thereby creating a masked selected sequence and a masked decoded sequence.
Claim 23
Dependent Claim
33 words
A method in accordance with the method of claim 18 wherein said comparing step further comprises the step of calculating the Hamming distance between said masked selected sequence and said masked decoded sequence.
Claim 24
Dependent Claim
32 words
A method in accordance with the method of claim 20 wherein said comparing the step further comprises the step of comparing said calculated Hamming distance to a synchronization error correction capability value.
Claim 25
Dependent Claim
41 words
A method in accordance with the method of claim 21 further comprising the step, responsive to said calculated Hamming distance comparing step, of changing said selected binary levels if said Hamming distance is greater than said synchronization error correction capability value.
Claim 26
Dependent Claim
41 words
A method in accordance with the method of claim 21 further comprising the step, responsive to said calculated Hamming distance comparing step, of changing said selected binary levels if said Hamming distance is equal to said synchronization error correction capability value.
Claim 27
Dependent Claim
30 words
A method in accordance with the method of claim 18 wherein said step of selecting one of the binary levels further comprises the step of randomly selecting a binary level.
Claim 28
Dependent Claim
33 words
A method in accordance with the method of claim 18 wherein said step of selecting one of the binary levels further comprises the step of selecting a binary level based on best-guess information.
Claim 29
Dependent Claim
34 words
A method in accordance with the method of claim 18 further comprising the step of counting the number of selections of a binary level made during the sequence of normal and inverse synchronization words.
Claim 30
Dependent Claim
39 words
A method in accordance with the method of claim 26 further comprising the step of indicating an incorrect sequence decode when said count of the number of selections equals or exceeds the minimum distance of the synchronization sequence code.
Claim 31
Independent Claim
213 words
A method of decoding control information contained in a sequence of normal and ones complement inverse synchronization words of a data message which may be transmitted on a noisy communications channel, said method of decoding comprising the steps of: receiving said synchronization words; detecting a normal word, an inverse word, and a word miss and assigning a first binary level if fewer than a first predetermined number of bit errors exist, assigning a second binary level to said detected inverse word if fewer than said first predetermined number of bit errors exist, and assigning a selected one of said binary levels to said word miss detection if said first predetermined number of bit errors is equalled or exceeded thereby creating a selected sequence; decoding said selected sequence into a decoded sequence; masking said selected binary levels in said selected sequence and masking corresponding binary levels in said decoded sequence, thereby creating a masked selected sequence and a masked decoded sequence; calculating the Hamming distance between said masked decoded sequence and said masked selected sequence; determining whether said Hamming distance is less than a second predetermined number, thereby indicating correctly decoded control information; and changing one or more of said selected binary levels if said Hamming distance is greater than said second predetermined number.
Claim 32
Independent Claim
213 words
A method of decoding control information contained in a sequence of normal and ones complement inverse synchronization words of a data message which may be transmitted on a noisy communications channel, said method of decoding comprising the steps of: receiving said synchronization words; detecting a normal word, an inverse word, and a word miss and assigning a first binary level if fewer than a first predetermined number of bit errors exist, assigning a second binary level to said detected inverse word if fewer than said first predetermined number of bit errors exist, and assigning a selected one of said binary levels to said word miss detection if said first predetermined number of bit errors is equalled or exceeded thereby creating a selected sequence; decoding said selected sequence into a decoded sequence; masking said selected binary levels in said selected sequence and masking corresponding binary levels in said decoded sequence, thereby creating a masked selected sequence and a masked decoded sequence; calculating the Hamming distance between said masked decoded sequence and said masked selected sequence; determining whether said Hamming distance is less than a second predetermined number, thereby indicating correctly decoded control information; and changing one or more of said selected binary levels if said Hamming distance is greater than said second predetermined number.
Claim 33
Dependent Claim
34 words
A method in accordance with the method of claim 28 further comprising the step of counting the number of selections of a binary level made during the sequence of normal and inverse synchronization words.
Claim 34
Dependent Claim
39 words
A method in accordance with the method of claim 29 further comprising the step of indicating incorrectly decoded control information when said count of the number of selections equals or exceeds the minimum distance of the synchronization sequence code.
Claim 35
Dependent Claim
49 words
A method in accordance with the method of claim 28 wherein said step of determining whether said Hamming distance is less than a second predetermined number further comprises the step of determining whether said Hamming distance is equal to said second predetermined number, thereby indicating correctly decoded control information.
Claim 36
Dependent Claim
59 words
A method in accordance with the method of claim 28 wherein said step of changing one or more of said selected binary levels if said Hamming distance is greater than said second predetermined number further comprises the step of changing one or more of said selected binary levels if said Hamming distance is equal to said second predetermined number.
Claim 37
Dependent Claim
30 words
A method in accordance with the method of claim 28 wherein said step of selecting one of said binary levels further comprises the step of randomly selecting a binary level.
Claim 38
Dependent Claim
33 words
A method in accordance with the method of claim 28 wherein said step of selecting one of said binary levels further comprises the step of selecting a binary level based on best-guess information.
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) | 1990-03-09 | 1990-09-08 | 1991-03-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1994-03-09 | 1994-09-08 | 1995-03-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1998-03-09 | 1998-09-08 | 1999-03-10 | $7700.00 | Window Closed / Lapsed |