By using pyramid structure of the code?book and Cauchy?Schwarz inequality, a condition of removing unnecessary matching operations from the search procedure was derived, then the fast search arithmetic is proposed based on this removing condition.

• 利用码书的拓扑结构和柯西 施瓦兹不等式的性质推导出了消除不必要匹配操作的条件,并根据这个条件提出了快速搜索算法。