In this paper we describe a trellis representation of variable length coded data which is capable of being used for bit-level or symbol-level maximum a posteriori (MAP) decoding o...
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...
Delayed branching is a technique to alleviate branch hazards without expensive hardware branch prediction mechanisms. For VLIW processors with deep pipelines and many issue slots,...
As a key part of universal source coding, context quantization is very important for improving compression performance. However, in most existing methods, the quantizer is trained...
The paper presents a novel software-pipelining algorithm suitable for optimizing compilers targeting embedded VLIW processors. The proposed algorithm is different from previous ap...