Patent US4159469A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4159469A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for the coding and decoding of digital information

Assignee: Motorola Solutions Inc
•
Filing: 1977-10-17
•
Granted: 1979-06-26
•
Expires: 1997-10-17
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The encoder processes M information characters, each of bit length m, followed by k-1 flush out bits, through an (n,k) convolutional encoder. Each resulting output character is stored as one row of an output register matrix. A transmission bit stream is formed by extracting bits from the register on a column by column basis, thereby interleaving the characters. The decoder fills an input storage basis on a column by column basis, thereby restoring each character in its appropriate row. The characters are sequentially switched to an (n,k) convolutional decoder which outputs the original m bit information character. The characters are, in turn, stored in corresponding rows of an output register matrix, where they are available as recovered data.

Inventors

  • 👤 Kenneth J. Zdunek

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-29 07:55
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/004; H04L1/0056; H04L1/0059; H04L1/0071

Claims Analysis

Total Claims: 13
Claim 1
Independent Claim 89 words
A digital data encoder for encoding a total of M characters, each with a length of m information bits, comprising: (n,k) convolutional encoder means selected such that m≧k; means for feeding each character, followed by k-1 flush bits, to said (n,k) convolutional encoder; M output storage registers, each register of length (mn/k)+(k-1)×((n/k)-1); storing means for storing each convolutionally encoded character M in a predetermined one of said M output storage registers; and output means for outputing the contents of said M output storage registers in a predetermined interleaved sequence.
Claim 2
Dependent Claim 89 words
A digital data encoder for encoding a total of M characters, each with a length of m information bits, comprising: (n,k) convolutional encoder means selected such that m≧k; means for feeding each character, followed by k-1 flush bits, to said (n,k) convolutional encoder; M output storage registers, each register of length (mn/k)+(k-1)×((n/k)-1); storing means for storing each convolutionally encoded character M in a predetermined one of said M output storage registers; and output means for outputing the contents of said M output storage registers in a predetermined interleaved sequence.
Claim 3
Dependent Claim 44 words
The digital data encoder of claim 1 wherein: said M output storage registers are arranged in a matrix of M rows and mn/k+(k-1)×((n/k)-1) columns, and wherein said output means outputs the contents of said M output storage registers in a column by column sequence.
Claim 4
Dependent Claim 112 words
The digital data encoder of claim 2 wherein said (n,k) convolutional encoder is comprised of: a shift register of length k into which each m length character followed by k-1 flush bits are sequentially shifted and, parity bit generating means for generating predetermined parity bits dependent upon the status of one or more of the signals in said register, and wherein the storing means includes means for alternately outputing each of the m information bits followed by (n/k)-1 parity bits until all m information bits followed by (n/k)-1 parity bits are stored in one of said M output registers, said output means then outputing (k-1)×(n/k)-1) parity bits to fill said output register.
Claim 5
Dependent Claim 112 words
The digital data encoder of claim 1 wherein said (n,k) convolutional encoder is comprised of: a shift register of length k into which each m length character followed by k-1 flush bits are sequentially shifted and, parity bit generating means for generating predetermined parity bits dependent upon the status of one or more of the signals in said register, and wherein the storing means includes means for alternately outputing each of the m information bits followed by (n/k)-1 parity bits until all m information bits followed by (n/k)-1 parity bits are stored in one of said M output registers, said output means then outputing (k-1)×((n/k)-1) parity bits to fill said output register.
Claim 6
Independent Claim 85 words
A method for encoding a total of M characters, each character having a length of m information bits, comprising the steps of: (a) providing an (n,k) convolutional encoder; (b) sequentially feeding each character, followed by k-1 flush bits, to said (n,k) convolutional encoder; (c) providing M output storage registers, each output register having a length (mn/k)+(k-1)×((n/k)-1); (d) storing each convolutionally encoded character in a predetermined one of said M output storage registers; and (e) outputing said stored convolutionally encoded characters in a predetermined interleaved sequence.
Claim 7
Independent Claim 85 words
A method for encoding a total of M characters, each character having a length of m information bits, comprising the steps of: (a) providing an (n,k) convolutional encoder; (b) sequentially feeding each character, followed by k-1 flush bits, to said (n,k) convolutional encoder; (c) providing M output storage registers, each output register having a length (mn/k)+(k-1)×((n/k)-1); (d) storing each convolutionally encoded character in a predetermined one of said M output storage registers; and (e) outputing said stored convolutionally encoded characters in a predetermined interleaved sequence.
Claim 8
Dependent Claim 49 words
The method of claim 5 wherein said storing step further comprises the step of storing said convolutionally encoded characters in a matrix of M rows and (mn/k)+(k-1)×((n/k)-1) columns and wherein said outputing step comprises outputing the contents of said M output storage registers in a column by column sequence.
Claim 9
Dependent Claim 109 words
The method of claim 5 wherein the step of providing a convolutional encoder further comprises the steps of: (a) providing a shift register of length k, (b) providing parity bit generating means for generating predetermined parity bits dependent upon the status of one or more of the signals in said k length register; and wherein the outputing step comprises the further steps of: (a) storing each of the m information bits followed by (n/k)-1 parity bits until all of said m information bits followed by (n/k)-1 parity bits are stored in one of said M output registers and then (b) outputing (k-1)×((n/k)-1) parity bits to fill said output register.
Claim 10
Dependent Claim 150 words
A decoder for decoding a transmission bit stream comprised of M interleaved characters, each character formed by convolutionally encoding an m bit information character, followed by k-1 flush bits, in an (n,k) convolutional encoder selected such that m≧k, each character having a bit length of (mn/k)+(k-1)×((n/k)-1), the decoder comprising: M input storage registers, each input register having a length (mn/k)+(k-1)×((n/k)-1); means for de-interleaving said M characters from said transmission bit stream and storing each character in a predetermined one of said M input storage registers; an (n,k) convolutional decoder for decoding each of said characters and outputting said m bit information character; M output storage registers, each output register having a length m; and switching means for sequentially processing each character stored in said M input storage registers through said (n,k) convolutional decoder and storing each resulting m bit information character in a predetermined one of said M output registers.
Claim 11
Dependent Claim 150 words
A decoder for decoding a transmission bit stream comprised of M interleaved characters, each character formed by convolutionally encoding an m bit information character, followed by k-1 flush bits, in an (n,k) convolutional encoder selected such that m≧k, each character having a bit length of (mn/k)+(k-1)×((n/k)-1), the decoder comprising: M input storage registers, each input register having a length (mn/k)+(k-1)×((n/k)-1); means for de-interleaving said M characters from said transmission bit stream and storing each character in a predetermined one of said M input storage registers; an (n,k) convolutional decoder for decoding each of said characters and outputting said m bit information character; M output storage registers, each output register having a length m; and switching means for sequentially processing each character stored in said M input storage registers through said (n,k) convolutional decoder and storing each resulting m bit information character in a predetermined one of said M output registers.
Claim 12
Independent Claim 147 words
A method for decoding a transmission bit stream comprised of M interleaved characters, each character formed by convolutionally encoding an m bit information character, followed by k-1 flush bits, in an (n, k) convolutional encoder selected such that m≧k, each character having a bit length of (mn/k)+(k-1)×((n/k)-1), comprising the steps of: (a) providing M input storage registers, each register of length (mn/k)+(k-1)×((n/k)-1); (b) de-interleaving the M characters from the transmission bit stream and storing each character in a predetermined input register; (c) providing an (n, k) convolutional decoder for decoding each of characters and outputing said m bit information characters; (d) providing M output storage registers, each output register of length m; and (e) sequentially processing each character stored in said M input storage registers through said (n,k) convolutional decoder and storing each resulting m bit information character in a predetermined one of said M output registers.
Claim 13
Independent Claim 147 words
A method for decoding a transmission bit stream comprised of M interleaved characters, each character formed by convolutionally encoding an m bit information character, followed by k-1 flush bits, in an (n, k) convolutional encoder selected such that m≧k, each character having a bit length of (mn/k)+(k-1)×((n/k)-1), comprising the steps of: (a) providing M input storage registers, each register of length (mn/k)+(k-1)×((n/k)-1); (b) de-interleaving the M characters from the transmission bit stream and storing each character in a predetermined input register; (c) providing an (n, k) convolutional decoder for decoding each of characters and outputing said m bit information characters; (d) providing M output storage registers, each output register of length m; and (e) sequentially processing each character stored in said M input storage registers through said (n,k) convolutional decoder and storing each resulting m bit information character in a predetermined one of said M output registers.

References Cited (Backward Citations)

US3222643A Cited
US3891959A Cited
US3873971A Cited
US3988677A Cited
US4055832A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1982-06-25 1982-12-25 1983-06-26 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1986-06-25 1986-12-25 1987-06-26 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1990-06-25 1990-12-25 1991-06-26 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag