ALGORITHM FOR DESCRIBING COLLECTED PACKET/FRAME FORMAT DATA
Original Publication Date: 1991-Jul-01
Included in the Prior Art Database: 2001-Dec-18
An algorithm is needed to describe, in no more description byte for every collected data byte for opti- than one description byte for every one collected data mum memory utilization and real-time efficiency. byte, collected data bytes from a packet/frame data structure. Since only one description byte is available for every collected data byte, an algorithm is needed to The packet/frame data structure is defined as any include all of the necessary information in the descrip- data structure with the following attributes: tion byte. Figure 2 illustrates this algorithm.