Method of compressing lookup table for reducing memory,...

Coded data generation or conversion – Digital code to digital code converters – Coding by table look-up techniques

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C708S235000

Reexamination Certificate

active

06900747

ABSTRACT:
In a method of compressing a lookup table for reducing memory, a non-linear function generating apparatus having a lookup table compressed using the method, and a non-linear function generating method, X-coordinates of the non-linear function are separated into a plurality of sections including steps that have predetermined step sizes. Y-coordinate values corresponding to X-coordinate values are extracted for each step. The Y-coordinate values are stored in predetermined addresses in a memory, wherein the step sizes are different according to the sections. In this manner, memory capacity occupied by the lookup table is reduced.

REFERENCES:
patent: 5047768 (1991-09-01), Yamaguchi et al.
patent: 5703581 (1997-12-01), Matias et al.
patent: 6166781 (2000-12-01), Kwak et al.
patent: 6269193 (2001-07-01), Young et al.
patent: 6304676 (2001-10-01), Mathews
patent: 6642931 (2003-11-01), Haikin et al.
patent: 10-0219543 (1999-06-01), None

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

Method of compressing lookup table for reducing memory,... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method of compressing lookup table for reducing memory,..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of compressing lookup table for reducing memory,... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3394284

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