Structured Codebook Storage Using Subvector Pointer Tables
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing speech and audio codecs require significant memory and computational resources for encoding, particularly in ROM-based memory, despite the use of structured codebooks, which limits further reduction in memory requirements.
Innovation Solution
The implementation of a table structure using sub-vectors and pointers to form basis code vectors, where the pointers utilize modulo n arithmetic to efficiently store and combine vector components, reducing memory consumption by exploiting repetitive patterns in basis code vectors.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If structured codebooks are used in speech and audio codecs, then coding efficiency is preserved, but memory requirements remain significant
Solution Approach 1:
The codebook is segmented into multiple subsets, where each subset contains a portion of the code vectors. Instead of storing the entire codebook in memory, the encoder can access different subsets sequentially or selectively, thereby reducing the amount of data that needs to be held in memory at any one time while preserving the ability to perform comprehensive codebook search for efficient coding.
Solution Approach 2:
The patent introduces a new dimension of organization by arranging codebook subsets in a structured manner with defined relationships between them. This dimensional organization allows the system to navigate through the codebook space efficiently without requiring all code vectors to be simultaneously accessible in memory, thus reducing memory requirements while maintaining coding efficiency.
2Reliability
If structured codebooks with lattice structures are implemented, then coding performance is improved, but computational complexity increases
Solution Approach 1:
The lattice structure and codebook search process are segmented into manageable stages corresponding to different codebook subsets. This segmentation allows the computational workload to be distributed and optimized, reducing the peak computational complexity while maintaining the performance benefits of structured codebooks through systematic exploration of code vector candidates.
Data Source
AI summary
It is inter alia disclosed an apparatus comprising: a table comprising a plurality of sub vectors, wherein each entry of the table is a subvector and each subvector have vector components which are the same as vector components of one or more basis code vectors; and a further table wherein an entry of the further table comprises a first pointer pointing to a sub vector in the table and a second pointer pointing to a subvector in the table, wherein the first pointer and the second pointer are arranged in the further table such that when vector components of the sub vector pointed to by the first pointer are combined with vector components of the sub vector pointed to by the second pointer a basis code vector is formed.