Time-bandwidth engineering for arbitrary waveform generation
Hongbiao Gao, Mohammad Hossein Asghari, Bahram Jalali · 2014
We propose a technique to increase the throughput of non-binary arithmetic coding by reducing the computational complexity of symbol searches in the decoding process. This is achieved by reducing the length of the interval that needs to be searched using table look-up. Furthermore, the proposed method utilizes concatenation of RAM and ROM tables to avoid the division operation associated with RAM table lookup. The RAM table stores the search interval boundaries while the ROM table stores division approximation boundaries. Our experimental results confirm that the technique can significantly speed up the decoding process, and close the throughput gap between the encoder and the decoder.