Array processing with fused multiply/add instruction

Image analysis – Image compression or coding – Transform coding

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

382276, 3647505, G06K 936

Patent

active

057199647

ABSTRACT:
Array processing for carrying out scaled-transform/descaled-inverse-transform procedures on data arrays encoding a visual image or other physical variable makes effective use of fused multiply/add instructions in computer workstations or other digital processors having a fused multiply/add capability. To reconstruct data representative of a physical variable from data originally representative of the variable which had been transformed according to a scaled discrete cosine transform procedure using a predetermined scaling matrix Q, an inverse transform procedure of the invention involves computing a descaling constant and a sequence of descaling/inverse-transform matrices which incorporate elements of the scaling matrix Q. One point of the input data array is multiplied by the descaling constant. The result is matrix multiplied by the sequence of descaling/inverse-transform matrices in turn. The descaling-inverse-transform matrices have the property that each matrix multiplication can involve arithmetic operations of exclusively fused signed multiply/add operations, which can be carried out with great efficiency on a computer workstation with fused signed multiply/add capability.

REFERENCES:
patent: 4805228 (1989-02-01), Jenkins et al.
patent: 4860373 (1989-08-01), Hartless et al.
patent: 4918742 (1990-04-01), Simonds
M.J. Narassimha et al., "On the Computation of the Discrete Cosine Transform", IEEE Trans. on Comm., vol. COM-26, No. 6, Jun. 1978, pp. 934-936.
J. Makhoul, "A Fast Cosine Transform in One and Two Dimensions", IEEE Tran. on Acoustics, Speech, & Signal Processing, vol. ASSP-28, No. 1, Feb. 1980, pp. 27-34.
B. Lee, "A New Algorithm to Compute the Discrete Cosine Transform", IEEE Tran. on Acoustics, Speech and Signal Processing, vol. ASSP-32, No. 6, Dec. 1984, pp. 1243-1245.
W-H Chen, et al., "A Fast Computational Algorithm for the Discrete Cosine Transform", IEEE Tran. on Comm., vol. 25, No. 9, Sep. 1977, pp. 1004-1009.
K.S. Shanmugam, "Comments on `Discrete Cosine Transform`", IEEE Trans. Comput. vol. C-24 p. 759.
N. Ahmed, et al., "Discrete Cosine Transform", IEEE Tran. on Computers, Jan. 1974, pp. 90-93.
H.S. Hou, "A Fast Recursive Algorithm for Computing the Discrete Cosine Transform", IEEE Tran. on Acous., Speech & Signal Processing, vol. ASSP-35, No. 10, Oct. 1987 pp. 1455-1461.
N. Suehiro, et al., "Fast Algorithm for the DFT and Other Sinusoidal Transforms", IEEE Tran. on Acous., Speech & Signal Processing, vol. ASSP-34, No. 3, Jun. 1986, pp. 642-644.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Array processing with fused multiply/add instruction does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Array processing with fused multiply/add instruction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Array processing with fused multiply/add instruction will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1790545

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.