| 摘要 |
The method involves using a vector having several components corresponding to an n-dimensional space and recursively dividing the n-dimensional space into several equal spaces having one dimension less than a previous recursion until two-dimensional end spaces are formed. The multiple components in each end space are compared asynchronously to determine a sub-space of a particular end space having a closest match to the vector. Independent claims are included for the following: (1) vector quantization system for dynamic element matching process; and (2) mismatch shaping engine. |
