US4901075A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for bit rate reduction
Assignee: US Philips Corp
•
Filing: 1987-09-11
•
Granted: 1990-02-13
•
Expires: 2007-09-11
Abstract
Abstract A method and apparatus for coding a signal for transmission in order to achieve improved reduction in the bit rate. A signal is a transform coded in order to form a sequence of zero coefficients and non-zero coefficients, and run lengths of zero coefficients together with preceding or subsequent non-zero coefficients are grouped as events and coded.
Inventors
- 👤 Peter Vogel
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 08:08
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/60; H03; H03M; H03M7/00; H03M7/30; H03M7/40; H03M7/42
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
186 words
A circuit arrangement for coding a signal comprising a run of zero coefficients and a subsequent coefficient, wherein said coefficients are applied with predetermined delays to the address inputs of a memory (PROM) and to a first input (E1) of a comparator circuit (K), in that a counter (Z) is provided whose count is applied to further address inputs of the memory (PROM) and to a second input (E2) of the comparator circuit (K), in that the comparator circuit (K) supplies a counting pulse to the counter (Z) from a first output (A1) if a zero coefficient is present at the first input (E1) and if the count has not exceeded a value stored in a memory of the comparator circuit (K) supplies a pulse from a second output (A2) if the conditions for the supply of a counting pulse are not fulfilled, and in that the counter (Z) is reset by means of the pulse at the second output (A2) of the comparator circuit (K), and in that the codeword present at the outputs of the memory (PROM) is transferred to an intermediate memory (FF).
Claim 2
Dependent Claim
186 words
A circuit arrangement for coding a signal comprising a run of zero coefficients and a subsequent coefficient, wherein said coefficients are applied with predetermined delays to the address inputs of a memory (PROM) and to a first input (E1) of a comparator circuit (K), in that a counter (Z) is provided whose count is applied to further address inputs of the memory (PROM) and to a second input (E2) of the comparator circuit (K), in that the comparator circuit (K) supplies a counting pulse to the counter (Z) from a first output (A1) if a zero coefficient is present at the first input (E1) and if the count has not exceeded a value stored in a memory of the comparator circuit (K) supplies a pulse from a second output (A2) if the conditions for the supply of a counting pulse are not fulfilled, and in that the counter (Z) is reset by means of the pulse at the second output (A2) of the comparator circuit (K), and in that the codeword present at the outputs of the memory (PROM) is transferred to an intermediate memory (FF).
Claim 3
Dependent Claim
55 words
A circuit arrangement as claimed in claim 1, characterized in that only the values of the coefficients are applied to the address inputs of the memory (PROM) and the comparator circuit (K) and in that the sign bits of the coefficients are supplied through a separate wire to the output (A) of the circuit arrangement.
Claim 4
Dependent Claim
111 words
In a method of coding a signal comprising a sequence of coefficients which results after a blockwise transform of pixels of a video signal with subsequent quantization, for transmission at a reduced bit rate, said signal comprising a plurality of zero coefficients, and a plurality of non-zero coefficients said method comprising the steps of: (a) deriving from said signal, a plurality of events each comprising a run of said zero-coefficients having a respective run length and preceded or followed by at least one non-zero coefficient, and (b) for each of said events, determining said respective run length and assigning a code word to represent said non-zero coefficient and said run length.
Claim 5
Dependent Claim
111 words
In a method of coding a signal comprising a sequence of coefficients which results after a blockwise transform of pixels of a video signal with subsequent quantization, for transmission at a reduced bit rate, said signal comprising a plurality of zero coefficients, and a plurality of non-zero coefficients said method comprising the steps of: (a) deriving from said signal, a plurality of events each comprising a run of said zero-coefficients having a respective run length and preceded or followed by at least one non-zero coefficient, and (b) for each of said events, determining said respective run length and assigning a code word to represent said non-zero coefficient and said run length.
Claim 6
Dependent Claim
13 words
The method of claim 3, wherein said code words are Huffman code words.
Claim 7
Dependent Claim
38 words
A method as claimed in claim 4, characterized in that a Huffman codeword is not transmitted if the length of the associated run of zero-coefficients exceeds a barrier which is dependent on the magnitude of the subsequent non-zero-coefficients.
Claim 8
Dependent Claim
70 words
A method as claimed in claim 4, characterized in that the signal comprises a sequence of coefficients which results after a blockwise transform of pixels of a video signal with subsequent quantisation and in that a checked Huffman codeword is not transmitted if the length of the associated zero run is larger than five and if the magnitude of the subsequent non-zero-coefficient has the smallest possible value different from zero.
Claim 9
Dependent Claim
41 words
A method as claimed in claim 4, characterized in that the Huffman codeword is independent of the sign of that non-zero coefficient which succeeds or precedes the run of zero-coefficients and in that the sign is coded by a separate bit.
Claim 10
Independent Claim
90 words
A method for coding a signal for transmission at a reduced bandwidth, comprising the steps of: (a) transforming said signal into a sequence comprising zero coefficients occurring in runs and non-zero coefficients; (b) deriving from said sequence, a plurality of events each comprised of a run of zero coefficients having a respective run length, which is preceded or followed by at least one non-zero coefficient, and (c) for each of said events, determining the run length and assigning a code word to represent said run length and said non-zero coefficient.
Claim 11
Independent Claim
90 words
A method for coding a signal for transmission at a reduced bandwidth, comprising the steps of: (a) transforming said signal into a sequence comprising zero coefficients occurring in runs and non-zero coefficients; (b) deriving from said sequence, a plurality of events each comprised of a run of zero coefficients having a respective run length, which is preceded or followed by at least one non-zero coefficient, and (c) for each of said events, determining the run length and assigning a code word to represent said run length and said non-zero coefficient.
Claim 12
Dependent Claim
46 words
The method of claim 8, comprising the additional steps of: determining for each event, whether the run length of said run of zero coefficients exceeds a predetermined length and if so assigning the same code word to represent each said run length and respective non-zero coefficient.
Claim 13
Dependent Claim
38 words
The method of claim 8, comprising the additional steps of: determining for each event, whether the non-zero coefficient exceeds a predetermined value and if so assigning the same code to represent said run length and said non-zero coefficient.
Claim 14
Dependent Claim
58 words
The method of claim 8, comprising the additional steps of: determining whether the run length of each event exceeds a predetermined run length and if so, splitting said respective event into a plurality of sections so that each of said sections has a run length below said predetermined run length, and assigning a code word to each section.
Claim 15
Independent Claim
77 words
An apparatus for coding a signal comprising a run of zero coefficients and a subsequent coefficient, said apparatus comprising: (a) means for determining if the length of said run exceeds a predetermined length; (b) splitting means coupled to said length determining means, for splitting a run which exceeds said predetermined length into a plurality of codable events; and (c) coding means coupled to said splitting means for assigning a code word to represent each said codable event.
Claim 16
Independent Claim
77 words
An apparatus for coding a signal comprising a run of zero coefficients and a subsequent coefficient, said apparatus comprising: (a) means for determining if the length of said run exceeds a predetermined length; (b) splitting means coupled to said length determining means, for splitting a run which exceeds said predetermined length into a plurality of codable events; and (c) coding means coupled to said splitting means for assigning a code word to represent each said codable event.
Claim 17
Dependent Claim
133 words
In a method of coding a signal comprising a sequence of coefficients which results after a blockwise transform of pixels of a video signal with subsequent quantization, for transmission at a reduced bit rate, said signal comprising a plurality of first coefficients having a signal value A and occurring in runs most frequently in said signal, and a plurality of second coefficients having values not equal to A, said method comprising the steps of: (a) deriving from said signal, a plurality of events each comprising a run of said first coefficients having a respective run length, which is preceded or followed by at least one second coefficient, and (b) for each of said events, determining said respective run lengths and assigning a code word to represent said second coefficient and said run length.
Claim 18
Dependent Claim
133 words
In a method of coding a signal comprising a sequence of coefficients which results after a blockwise transform of pixels of a video signal with subsequent quantization, for transmission at a reduced bit rate, said signal comprising a plurality of first coefficients having a signal value A and occurring in runs most frequently in said signal, and a plurality of second coefficients having values not equal to A, said method comprising the steps of: (a) deriving from said signal, a plurality of events each comprising a run of said first coefficients having a respective run length, which is preceded or followed by at least one second coefficient, and (b) for each of said events, determining said respective run lengths and assigning a code word to represent said second coefficient and said run length.
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) | 1993-02-12 | 1993-08-14 | 1994-02-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-02-12 | 1997-08-14 | 1998-02-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-02-12 | 2001-08-14 | 2002-02-13 | $7700.00 | Window Closed / Lapsed |