A PRF Sorter Based on List Manipulation Techniques

摘要

This report describes a program that uses list processing techniques to sort pulses into sequences uniformly spaced in time, a process referred to as PRF sorting. The detailed discussion of the program's operation is based on a LISP implementation that functions on a demonstration level. A listing of a PASCAL version capable of operation on real data is also given. The unique feature of the algorithm used here is the ability to postpone the decision to assign a pulse to a particular existing pulse train. This is achieved by duplicating the existing pulse train and assigning the pulse to one of the two resulting pulse trains. Both pulse trains are then carried in the system, with equal status, until eventually a decision is made as to which is correct. The list structures used, native to LISP, prevent the duplication of pulse trains from resulting in unreasonable storage requirements. (Author)