Method of pattern lossless compression
OwnerDavid W. Guidryinventor
Life of this patent
Estimating the term…
Abstract
A sin (x) or cos (x) computational generator is provided by a coarse and fine storage element sharing a common address bus with the coarse storage element storing full precision values for every Jth sample and said fine storage element storing correction values between the Jth samples. An arithmetic block operates on the output of the storage elements in response to addresses on the address bus to provide full precision values without storing full precision values.
Claims11
A sinusoidal digital pattern generator with reduced LUT memory space comprising:
- an address generator;
- a coarse storage element storing full precision values for every Jth sample and a fine storage element storing correction samples at every entry to provide correction sample sharing a common address bus coupled to said address generator for providing samples in-between;
- and
- an arithmetic block coupled to the output of said storage elements for providing full precision values with less storage.
A digital pattern generator comprising:
- an address generator;
- a plurality of individual storage elements each storing less than full precision values and sharing a common bus;
- arithmetic block that operates on the output of the storage elements to provide full precision values..
A sin (x) or cos (x) computational generator comprising;
- a coarse and fine storage element sharing a common address bus with said coarse storage element storing full precision values for every Jth sample and said fine storage element storing correction values between said Jth samples;
- and arithmetic block that operates on the output of said storage elements in response to addresses on said address bus to provide full precision values without storing full precision values.
A look up table enabling smaller storage size and faster speed access comprising:
- a coarse and fine storage element sharing a common address bus with said coarse storage element storing full precision values for every Jth sample and said fine storage element storing correction values between said Jth samples;
- and
- an arithmetic block that operates on the output of said storage elements in response to addresses on said address bus to provide full precision values without storing full precision values.
A method of compressing a pattern comprising the steps of:
- providing full precision values for every Jth sample;
- providing “delta” correction values for every final sample between each Jth sample to correct for the full precision sample values in-between;
- and
- summing the results so the full precision samples do not initially need to be provided to maintain the performance.
A method of transmitting a compressed pattern comprising the steps of:
- transmitting full precision values for every Jth sample;
- transmitting “delta” correction sample values for every full precision samples between each Jth sample to correct for the samples in-between the Jth sample;
- and
- summing the results so the full precision samples do not initially need to be transmitted to maintain the performance.
A method of providing a smaller size look up table with fast access comprising the steps of:
- storing full precision values for every Jth sample;
- storing “delta” correction values for every final sample between each Jth sample to correct for the full precision sample values in-between;
- and
- summing the results so the full precision samples do not initially need to be stored to maintain the performance.
A method of providing a smaller size look up table with fast configuration and frequency modification comprising the steps of:
- accessing simultaneously coarse and fine storage elements sharing a common address bus with said coarse storage element storing full precision values for every Jth sample and said fine storage element storing correction values between said Jth samples;
- and
- summing the output of said storage elements in response to addresses on said address bus to provide full precision values without storing full precision values.
Dependencies are inferred from the claim text.