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

Memory structure to minimize rounding/trunction errors for n-dimensional image transformation

Assignee: International Business Machines Corp
•
Filing: 1994-05-09
•
Granted: 1995-06-27
•
Expires: 2014-05-09
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method for computing n-dimensional decomposable image transformation using the 1D approach with constrained transpose memory provides a minimized rounding/truncation error. The method minimizes transpose memory size required to fulfill a defined accuracy requirement for n-dimensional image transformation. A set of input data elements are stored. Then, a first transform, of the multiple dimension transform, is performed on the set of input data elements so as to form an array of transformed data elements, each of the transformed data elements having a larger number of bits than the input data elements. A common range of the transformed data elements is determined, and a minimum number of bits required to represent the common range without loss of information is then determined. The memory word size available for storage of the transformed data elements is compared with a minimum number of bits so as to determine an excess number of bits. Only the excess number of bits of the transformed data is truncated/rounded so as to form an output set of data elements. Finally, the output set of data elements is stored.

Inventors

  • 👤 Thomas A. Horvath
  • 👤 Min-Hsiung Lin
  • 👤 Gee-Gwo Mei

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 12:03
CPC Classifications
G; G06; G06F; G06F17/00; G06F17/10; G06F17/14; G06F17/147; G11; G11C; G11C7/00; G11C7/10; G11C7/1006

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 159 words
A method for minimizing rounding/truncation errors in the storage of multiple dimension transform data, comprising the steps of: (a) storing a set of input data elements; (b) performing a first transform, of the multiple dimension transform, on the set of input data elements so as to form an array of transformed data elements, each of the transformed data elements having a larger number of bits than the input data elements; (c) determining a common range of the transformed data elements; (d) determining a minimum number of bits required to represent the common range without loss of information; (e) comparing the memory word size available for storage of the transformed data elements with a minimum number of bits so as to determine an excess number of bits; (f) rounding or truncating only the excess number of bits of the transformed data so as to form an output set of data elements; and (g) storing the output set of data elements.
Claim 2
Independent Claim 159 words
A method for minimizing rounding/truncation errors in the storage of multiple dimension transform data, comprising the steps of: (a) storing a set of input data elements; (b) performing a first transform, of the multiple dimension transform, on the set of input data elements so as to form an array of transformed data elements, each of the transformed data elements having a larger number of bits than the input data elements; (c) determining a common range of the transformed data elements; (d) determining a minimum number of bits required to represent the common range without loss of information; (e) comparing the memory word size available for storage of the transformed data elements with a minimum number of bits so as to determine an excess number of bits; (f) rounding or truncating only the excess number of bits of the transformed data so as to form an output set of data elements; and (g) storing the output set of data elements.
Claim 3
Dependent Claim 54 words
The method recited in claim 1 further comprising the step of performing a second transformation, of the multiple dimension transform, on the output set of data elements and said set of input data elements so as to form a second array of transformed data elements and then repeating the steps (c) to (g) inclusive.
Claim 4
Dependent Claim 43 words
The method recited in claim 1 wherein the steps (a) through (g) are performed for a plurality of sets of input data elements, said method further comprising of aligning the output sets of data elements for each set of the input data elements.
Claim 5
Dependent Claim 159 words
A memory architecture which minimizes rounding/truncation errors in the storage of multiple dimension transform data comprising: first storage means for temporarily storing an array of transformed data elements, each of the transformed data elements having a larger number of bits than that of an input set of data elements; a bit range representation adjuster connected to receive said array of transformed data elements from said first storage means for determining a common range of the transformed data elements; shift and round/truncate logic connected to said bit range representation adjuster for first determining a minimum number of bits required to represent the common range without loss of information and shifting said data array to said minimum number of bits and second rounding or truncating low order bits of said minimum number of bits so as to reduce the array to a memory word size available for storage; and second storage means for receiving and storing the rounded/truncated array of data.
Claim 6
Dependent Claim 159 words
A memory architecture which minimizes rounding/truncation errors in the storage of multiple dimension transform data comprising: first storage means for temporarily storing an array of transformed data elements, each of the transformed data elements having a larger number of bits than that of an input set of data elements; a bit range representation adjuster connected to receive said array of transformed data elements from said first storage means for determining a common range of the transformed data elements; shift and round/truncate logic connected to said bit range representation adjuster for first determining a minimum number of bits required to represent the common range without loss of information and shifting said data array to said minimum number of bits and second rounding or truncating low order bits of said minimum number of bits so as to reduce the array to a memory word size available for storage; and second storage means for receiving and storing the rounded/truncated array of data.
Claim 7
Dependent Claim 63 words
The memory architecture recited in claim 4 wherein said bit range representation adjuster comprises logic which successively compares first and second, second and third, third and fourth, and so forth leading bits of each of said transformed data elements stored in said first storage means, said logic stopping the comparison when a transition in logic level is detected in any of the comparisons.
Claim 8
Dependent Claim 300 words
A multiple dimensional image data transformation system comprising: means for storing a set of input image data elements; a plurality of one dimensional transformation circuits, a first one of the transformation circuits being connected to said means for storing to receive said set of input image data elements and performing a transformation operation to produce an array of transformed data elements, each of the transformed data elements having a larger number of bits than the input data elements; a transpose memory between each pair of one dimensional transformation circuits, each said transpose memory comprising: first storage means for temporarily storing an array of transformed data elements, each of the transformed data elements having a larger number of bits than an input set of data elements; a bit range representation adjuster connected to receive said array of transformed data elements from said first storage means for determining a common range of the transformed data elements; shift and round/truncate logic connected to said bit range representation adjuster for first determining a minimum number of bits required to represent the common range without loss of information and shifting said data array to said minimum number of bits and second rounding or truncating low order bits of said minimum number of bits so as to reduce the array to a memory word size available for storage; and second storage means for receiving and storing the rounded/truncated array of data; each transformation circuit after the first transformation circuit being connected to said means for storing to receive said set of input image data elements and to a preceding transpose memory to receive rounded/truncated array data and performing a transformation operation to produce another array of transformed data elements, each of the transformed data elements having a larger number of bits than the input data elements.
Claim 9
Dependent Claim 300 words
A multiple dimensional image data transformation system comprising: means for storing a set of input image data elements; a plurality of one dimensional transformation circuits, a first one of the transformation circuits being connected to said means for storing to receive said set of input image data elements and performing a transformation operation to produce an array of transformed data elements, each of the transformed data elements having a larger number of bits than the input data elements; a transpose memory between each pair of one dimensional transformation circuits, each said transpose memory comprising: first storage means for temporarily storing an array of transformed data elements, each of the transformed data elements having a larger number of bits than an input set of data elements; a bit range representation adjuster connected to receive said array of transformed data elements from said first storage means for determining a common range of the transformed data elements; shift and round/truncate logic connected to said bit range representation adjuster for first determining a minimum number of bits required to represent the common range without loss of information and shifting said data array to said minimum number of bits and second rounding or truncating low order bits of said minimum number of bits so as to reduce the array to a memory word size available for storage; and second storage means for receiving and storing the rounded/truncated array of data; each transformation circuit after the first transformation circuit being connected to said means for storing to receive said set of input image data elements and to a preceding transpose memory to receive rounded/truncated array data and performing a transformation operation to produce another array of transformed data elements, each of the transformed data elements having a larger number of bits than the input data elements.
Claim 10
Dependent Claim 67 words
The multiple dimensional image data transformation system recited in claim 6 wherein said bit range representation adjuster comprises logic which successively compares first and second, second and third, third and fourth, and so forth leading bits of each of said transformed data elements stored in said first storage means, said logic stopping the comparison when a transition in logic level is detected in any of the comparisons.

References Cited (Backward Citations)

US4589084A Cited
US4829465A Cited
US4760543A Cited
US5177704A Cited
US5218563A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1998-06-26 1998-12-26 1999-06-27 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2002-06-26 2002-12-26 2003-06-27 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2006-06-26 2006-12-26 2007-06-27 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag