It is disclosed an algorithm able to compress a defined set of addresses S, the set of addresses to be compressed, belonging to the set U, the whole addressing space; for each of these addresses the algorithm must identify one and only one address belonging to C, the set of compressed address (i. e. perform a transformation S → C). The algorithm may be implemented using some low-cost random access memories (RAM) and some control logic. A performance comparison shows that is possible to perform the address compression using one order of magnitude less memory respect to the state-of-the-art techniques.;Basically, the method of the invention combines the splitting of the incoming address space (U) into a plurality of sub-spaces, a tree search algorithm for clustering a defined set (S) of identifiers contained in the sub-spaces into which the incoming addresses space (U) has been split and a sequential search performed within the right cluster in order to identify the compressed address belonging to space C.;The patent covers the algorithm, a preferred embodiment and some extended embodiments, that give extra gain.;Thanks to the invention is thus possible to implement silicon devices able to compress one order of magnitude more managed channels with respect to the state-of-the-art techniques, without area changes.;Conversely, it is possible to implement the address compression function with one order magnitude less memory resources with respect to the state-of-the-art techniques.
展开▼
机译：公开了一种算法，该算法能够压缩定义的地址集 S ，该地址集要压缩的地址集属于整个地址空间 U 。对于这些地址中的每一个，算法必须标识一个且仅一个属于 C 的地址，即压缩地址集（即执行 S → C ）。可以使用一些低成本随机存取存储器（RAM）和一些控制逻辑来实现该算法。性能比较表明，相对于最新技术，可以使用少一个数量级的存储器来执行地址压缩。基本上，本发明的方法结合了输入地址空间（U）的划分树搜索算法分为多个子空间，该树搜索算法用于聚类包含在子空间中的定义的一组标识符（S），其中已将传入地址空间（U）拆分为这些子空间，并在其中的右集群中执行顺序搜索为了识别属于空间C的压缩地址，该专利涵盖了算法，优选实施例和一些扩展的实施例，它们给出了额外的增益。借助于本发明，因此有可能实现能够压缩一个数量级的硅器件。相对于最新技术而言，可管理更多的通道，而不会改变面积;相反，可以实现存储器压缩量减少一阶的内存压缩功能•有关最新技术的资源。
展开▼
