← Back to Patent Explorer
US5504823A Expired / Lapsed US ⏱️ 0.0 years remaining

Image data partitioning circuit for parallel image decoding system

Assignee: Ramot at Tel Aviv University Ltd
•
Filing: 1993-09-23
•
Granted: 1996-04-02
•
Expires: 2013-09-23
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract There is provided an image data partitioning circuit for use in a parallel image decoding system which is capable of a effective partitioning operation for a variable length coded image, thereby advantageously achieving a high speed decoding operation. The image data partitioning circuit comprises: N buffer, each coupled to the respective decoding module for storing a partitioned variable length coded image to be processes thereby, respectively; first detector for detecting a starting position of the horizontally sliced data and generating a starting position detection signal; second detector for detecting a vertical position of the horizontally sliced data and for generating a vertical position detection signal; and partitioning device responsive to the starting position detection signal and the vertical position signal for partitioning the variable length coded image and for sequentially coupled the partitioned data of the variable length coded image to the N buffers.

Inventors

  • 👤 Sang-Ho Yoon

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-03 07:43
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/10; H04N19/169; H04N19/17; H04N19/174; H04N19/42; H04N19/436; H04N19/60; H04N19/61; H04N19/70; H04N19/90; H04N19/102; H04N19/13; H04N19/91

Claims Analysis

Total Claims: 2
Claim 1
Independent Claim 342 words
An image data partitioning circuit for use in an image decoding system having N decoding modules for decompressing a variable length coded image in parallel, wherein the variable length coded image includes M number of horizontally sliced data thereof, each of the sliced data having a different bit length, and N and M being integers larger than 1, which comprises: N buffer means for storing the variable length coded image, wherein each of the buffer means is coupled to its corresponding decoding module and has fixed storage locations for storing M/N number of the horizontally sliced data; first detecting means for detecting a starting position of the horizontally sliced data and generating a starting position detection signal; and partitioning means, responsive to the starting position detection signal, for sequentially providing the horizontally sliced data to a preceding buffer means and for detecting ((M/N)i+1)st horizontally sliced data to provide the horizontally sliced data to a next buffer means, thereby sequentially providing M/N horizontally slice data to the N buffer means, wherein i is 0 or an integer from 1 to N, said partitioning means including: storage means for temporarily storing the horizontally sliced data and, in response to a clock signal, for simultaneously providing a predetermined number of bits contained in the horizontally sliced data to the buffer means; counting means for counting a bits contained in the horizontally sliced data to generate the clock signal when said counted value reaches the predetermined number; boundary detection means for sensing the start position detection signal to generate a boundary detection signal when the ((M/N)i+1)st horizontally sliced data is detected and for detecting initial bits of the ((M/N)i+1)st horizontally sliced data contained in the predetermined number of bits to add a value representative of the number of the initial bits to the counted value; and means, in response to the clock signal, for providing a buffer write signal to the buffer means and, in response to the boundary detection signal and the clock signal, for providing the buffer write signal to the next buffer means.
Claim 2
Dependent Claim 342 words
An image data partitioning circuit for use in an image decoding system having N decoding modules for decompressing a variable length coded image in parallel, wherein the variable length coded image includes M number of horizontally sliced data thereof, each of the sliced data having a different bit length, and N and M being integers larger than 1, which comprises: N buffer means for storing the variable length coded image, wherein each of the buffer means is coupled to its corresponding decoding module and has fixed storage locations for storing M/N number of the horizontally sliced data; first detecting means for detecting a starting position of the horizontally sliced data and generating a starting position detection signal; and partitioning means, responsive to the starting position detection signal, for sequentially providing the horizontally sliced data to a preceding buffer means and for detecting ((M/N)i+1)st horizontally sliced data to provide the horizontally sliced data to a next buffer means, thereby sequentially providing M/N horizontally slice data to the N buffer means, wherein i is 0 or an integer from 1 to N, said partitioning means including: storage means for temporarily storing the horizontally sliced data and, in response to a clock signal, for simultaneously providing a predetermined number of bits contained in the horizontally sliced data to the buffer means; counting means for counting a bits contained in the horizontally sliced data to generate the clock signal when said counted value reaches the predetermined number; boundary detection means for sensing the start position detection signal to generate a boundary detection signal when the ((M/N)i+1)st horizontally sliced data is detected and for detecting initial bits of the ((M/N)i+1)st horizontally sliced data contained in the predetermined number of bits to add a value representative of the number of the initial bits to the counted value; and means, in response to the clock signal, for providing a buffer write signal to the buffer means and, in response to the boundary detection signal and the clock signal, for providing the buffer write signal to the next buffer means.

References Cited (Backward Citations)

US4734767A Cited
US4897719A Cited
US4985766A Cited
US5311307A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-04-02 1999-10-02 2000-04-02 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-04-02 2003-10-02 2004-04-02 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-04-02 2007-10-02 2008-04-02 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag