An improved hashing function for IS-2000 quick paging channel
暂无分享,去创建一个
Both mathematically and numerically, we prove that the hashing equation used to determine the second paging indicator bit of IS-2000 quick paging channel is not optimal. A new hashing equation is proposed that is more uniformly random, and thus improves the efficiency of the quick paging channel.
[1] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .