A word-parallel, bit-serial signature processor for superimposed coding

Abstract

The design of a word-parallel, bit-serial (WPBS) signature processor for searching superimposed codes is presented. The WPBS signature processor is based on a transposed file organization and is optimal in the sense that the smallest possible amount of data is read. As such, it performs much faster than the word-serial, bit-parallel (WSBP) signature processor proposed in the literature. In addition, it can easily accommodate signatures of different lengths in the same signature store. This feature is important in utilizing the signature store efficiently but difficult to implement with a WSBP architecture. We also discuss the implementation of the processor with magnetic bubble memory.