set-tree block coding 集合树块编码
block tree 整体生产树
unitized solid-block tree 整体式采油树
Block-tree 块树
tree-structured block 树形结构子块划分
block-cutpoint tree [计] 块割点树
block cut-point tree 块割点树
According to above, a tree-block data lossless compression algorithm with lower complexity is proposed suitable for easier hardware implementation and with good ability for deducing the error propagation(the error propagation is limited within a tree-block).
针对上述要求,论文提出了一种易于硬件实现、低复杂度、抗误码强的树块数据无损压缩算法。
参考来源 - 一种适于遥感图像的压缩算法·2,447,543篇论文数据，部分数据来源于NoteExpress
First, the node from the free tree with the lowest address (which is greater than or equal to the requested block size) is removed.
首先，删除空闲树中(大于或等于请求的块大小的)地址最低的节点。
Similar to the Yorktown policy, Watson searches the size tree and finds the smallest possible block suitable for the request.
与Yorktown策略相似，Watson搜索大小树，寻找符合请求的最小的块。
If the size of the reallocated block is smaller than the original block, the block is split and the extra block is returned to the free tree with the required size block being returned to the caller.
如果重新分配的块小于原来的块，那么把它分割开，多余的块返回给空闲树，请求的块返回给调用者。
应用推荐