基于二叉树型结构独立地址的快速分配算法

提出了一种可用于CDMA独立地址分配的快速分配算法.它与传统的地址码空间搜索算法具有下列不同:采用二分法技术从初始地址码开始生成其他的地址码;为了保证地址码之间的相互独立性,在每次的生成过程中地址码有一半位数的取值发生变化,对每次生成的多个子地址码保持前面一半位数的取值相同;整个地址码组成二叉树型结构.该算法也适用于其他的具有数据独立性要求的场合.

Fast Algorithm of the Independent Address Based on Two-fork-tree Type

An algorithm is presented to address allocation independently for CDMA.Different from the traditional address code space searching algorithm,dichotomy is first used to generate other address codes from the initial address codes;secondly,in order to ensure the independence between address codes,half of the digit values change in each of the code generation process;furthermore,between a number of address codes in each generation the anterior half of digit values remain the same;finally,the entire address codes build up a binary tree structure.Taking the 8 bits address code as an example,its distribution is given according to the algorithm.Compared with the traditional method,the rapid distribution algorithm,which is based on a binary tree structure,has a quite low time complexity and needs no mutual independence judgement of the address code.The algorithm can also be used in other instances where data independence is required.