in the second level, an ordered list implemented by two SRAMs is used to simulate the tree-based adaptive Huffman algorithm.

• 第二层采用两个静态记忆体来实现符号出现机率的排序串列以代替动态霍夫曼演算法的树状架构。