Abstract:
A logic state analyzer monitors an ongoing succession of logic states occurring in a collection of n-many digital signals, and stores in a memory a set of logic states selected from the ongoing succession. A logic state is any one of the 2 n  -1 possible patterns the n-many digital signals may exhibit. The memory is of some convenient fixed number of locations, and once the memory is filled the oldest stored logic states are overwritten as the newest logic states are stored. Various storage qualification criteria may be specified, in which case an individual logic state is not stored unless it meets those criteria. Upon recognition of a specified trigger condition in the succession of logic states the logic state analyzer stores an operator selectable number of additional logic states, after which the monitoring and storing of logic states ceases and the stored contents of the memory are displayed. The trigger condition may be the detection of a designated sequence of selected logic states. A sequence detector monitors the ongoing succession of logic states. To satisfy the sequence and thus meet the trigger condition the first logic state in the sequence must occur and be subsequently followed by the next logic state in the sequence, and so on, until all selected logic states in the designated sequence have occurred. It may also be required that each logic state in the sequence be detected a selected number of times before an occurrence of the next logic state in the sequence can contribute toward satisfaction of the sequence. A logic state may be designated as a restart state whose occurrence nullifies any partial satisfaction of the sequence and causes the process of sequence satisfaction to begin afresh.

Description:
REFERENCES TO RELATED APPLICATIONS 
     This application is a division of an earlier filed copending application Ser. No. 210,462, filed on Nov. 25, 1980 by George A. Haag, et al., amended to be entitled LOGIC STATE ANALYZER WITH STORAGE QUALIFICATION, and now issued as of Feb. 8, 1983 as U.S. Pat. No. 4,373,193. That application was a continuation of application Ser. No. 075,787 entitled LOGIC STATE ANALYZER filed Sept. 17, 1979 by the same inventors, and which is now abandoned. That application was in turn a division of a now abandoned application of the same inventors and title, Ser. No. 828,138, filed on Aug. 29, 1977. Each of the above patents and applications is assigned to Hewlett-Packard Co., as is the present application. 
     The subject matter of the present application is also related to the subject disclosed in U.S. Pat. No. 4,040,025, issued to Justin S. Morrill, Jr., on Aug. 2, 1977, and which was filed on Mar. 31, 1976. U.S. Pat. No. 4,040,025 is assigned to Hewlett-Packard Co. 
     The subject matter of the present application is also related to the subject disclosed in U.S. Pat. No. 4,100,532, issued to William A. Farnbach on July 11, 1978, and which was filed on Nov. 19, 1976. U.S. Pat. No. 4,100,532 is assigned to Hewlett-Packard Co. 
     U.S. Pat. Nos. 4,040,025 and 4,100,532 to Morrill, et al. and Farnbach, respectively, are hereby expressly incorporated by reference. 
    
    
     BACKGROUND AND SUMMARY 
     Logic state analyzers are used to monitor and record sequences of states that occur in a collection of digital signals in a system under test. A &#34;state&#34; is simply any one of the 2 n  logical patterns that n-many digital signals may experience. A sequence of addresses or a sequence of fetched instructions are examples of electrical activity describable as states in a microprocessing environment and that can be monitored by a logic state analyzer to record their &#34;state flow.&#34; 
     To monitor the ongoing sequence of states in a system under test a logic state analyzer samples the electrical values of the signals of interest at times determined by one or more clock signals associated with the system under test. The sampled electrical values obtained are compared to thresholds of selected value and polarity to determine their logical values, each of which will be either true or false, one or zero. Each resulting collection of ones and zeros for a sample is a state in the ongoing sequence of states. It is also simply a binary value that may be stored in a memory. A series of such stored values is a record of the activity occurring in the system under test. Such a record may be termed a trace. 
     To store an indefinitely long record or trace of such activity would require a corresponding indefinitely large memory. This is impractical for at least two reasons. First, the cost of huge memories is prohibitive. Second, and more to the point, no human being using a logic state analyzer has time to sort through several hundred thousand stored states, or even a few tens of thousands, to find the data that is meaningful for the problem under investigation. Yet this could easily be required if it were necessary to trace an entire high level transaction such as finding the tangent of an angle, or reading a file from a mass storage peripheral. What are needed are ways to reduce the amount of trace data stored to manageable proportions while ensuring that the information in the trace is most likely to be pertinent to the investigation at hand. 
     Accordingly, logic state analyzers are typically equipped with sufficient memory to store traces that range from a few hundred to a few thousand states. The memories are used circularly. That is, the newest data to be stored is written in the memory location currently containing the oldest data. The size of the memory is then the size of the trace, which then always reflects the last &#34;memory&#39;s worth&#34; of activity occurring to that time. 
     The storage of state data into the memory halts subsequent to the detection of some specified condition in the incoming state data. That condition is called the trigger condition, or simply the trigger. If the storage of state data halts immediately upon the detection of the trigger the trace then represents the activity that preceded the trigger. This can be called an &#34;end-on&#34; trigger. If the storage of state data were instead to continue for one additional &#34;memory&#39;s worth&#34; of state data the trace would then represent the activity that occurred after the trigger. This can be called a &#34;start-on&#34; trigger. Typically, the user specifies some number of additional storage operations that is less than one memory&#39;s worth, e.g., half that number of locations. This produces a &#34;center-on&#34; trigger. A &#34;center-on&#34; or any other &#34;middle of trace&#34; trigger produces a trace that records both what states led up to the trigger, as well as those that followed it. 
     One of the ways to help ensure that the trace contains principally the data that is most likely to be pertinent to the investigation at hand is to allow the trigger to represent a condition more sophisticated than simply any occurrence of a specified state. A sequential trigger, for instance, produces a trigger only when a predefined sequence of states has already occurred previous to the trigger state. In terms of a flow chart for the state flow of the system under test, the user can use a sequential trigger to say &#34;trigger when it gets there by going that way.&#34; That is, simply getting &#34;there&#34; is not sufficient to create a trigger; getting &#34;there&#34; must also be preceded, in order, by certain other events (states) that represent &#34;going that way.&#34; For example, the trigger may be desired upon fetching an instruction from the first address in a complement routine, but only if that routine is called in the context of floating point division, not for floating point subtraction, etc. Thus, sequential triggering allows the user to specify a trigger condition that is not simply a mere place on a flow chart, but is one that has historical criteria associated with it as well. 
     Sequential triggering is accomplished by equipping a logic state analyzer with a mechanism to allow the user to define a sequence of states to precede a designated trigger state and a sequence detection mechanism to issue an appropriate internal trigger signal upon detection of the trigger state subsequent to the satisfaction of the sequence. 
     It may also be convenient to equip a logic state analyzer having a sequential trigger with a restart capability. This useful feature allows the detection of a specified state to cancel the progress made to that time toward satisfaction of the sequence, requiring satisfaction to begin afresh. 
    
    
     DESCRIPTION OF THE FIGURES 
     FIG. 1 illustrates the interactive format specification display. 
     FIG. 2 illustrates the interactive trace specification display. 
     FIG. 3 illustrates a trace list display of the stored data states. 
     FIG. 4 illustrates a trace graph display of the stored data states. 
     FIG. 5 illustrates a trace compare output display list. 
     FIG. 6 illustrates the input keyboard. 
     FIG. 7 illustrates a block diagram of the present invention. 
     FIG. 8 illustrates the distributed memory addressing of the present invention. 
     FIG. 9 illustrates the relationship between physical and logical addresses of the distributed memory of FIG. 8. 
     FIG. 10 is a block diagram of the acquisition system. 
     FIG. 11 illustrates a multiple pattern recognition unit. 
     FIG. 12 illustrates a simplified sequential triggering circuit. 
     FIG. 13 illustrates the measurement and control module. 
     FIG. 14 illustrates the data format of the data memory. 
     FIG. 15 illustrates the format of the label format file. 
     FIG. 16 illustrates the logic flow of the display formatting logic. 
    
    
     FORMAT SPECIFICATION 
     Data formatting permits the partitioning of 32 input data channels into parameters of interest. Contiguous data channels which behave as a single parameter may be assigned to one of six labels (A-F). For example, in FIG. 1, illustrating the interactive format specification display, 16 bits of an address bus have been assigned to label &#34;A&#34;, 8 bits of a data bus have been assigned to label &#34;D&#34;, 1 bit of data on pod 1 has been assigned to label &#34;F&#34;, and 7 bits have been left unassigned (labeled &#34;X&#34;). Further specifications and data manipulations are made by referencing these labels. Each assigned label may be independently declared to have a positive or negative &#34;logic polarity&#34; and converted to an independently selected radix which can be binary, octal, decimal or hexedecimal. Further, the slope of the positive or negative clock transition at which time the input data channels are sampled can be selected (&#34;clock slope&#34;). 
     Keyboard entries to the microprocessor 800, as shown in FIG. 16, permit the construction of the lebel format file, shown in more detail in FIG. 15 which, contains the format specification parameters. This is used to process the stored data states in the construction of the alphabetically concatenated ASCII display data file and the graphic display data file. Either of the display data files is subsequently selected and used for display purposes by the display control module 700 and the CRT display 1000. 
     TRACE SPECIFICATION 
     The assigned input data channels are sampled at the specified clock transitions and are treated as one sampled state. The trace specification defines which of the sampled states are to be stored for display and which sampled states are to be counted for count measurements. The trace specification comprises a definition of state conditions specifying the trace position, the selective trace, and the count measurement. Each state condition defines a state of the assigned input data channels in any combination of 1&#39;s, 0&#39;s, and/or X&#39;s (don&#39;t care). In octal, decimal or hexedecimal bases the definition is defined in terms of the appropriate alphamumerics and X&#39;s. 
     A trace position may be selected to a start, center or end the selective trace in response to the input data satisfying a predefined state sequence. In this description it will be assumed that the trace position starts the selective trace. A state sequence of up to seven state conditions must be satisfied in a specified order, ignoring intermediate states which do not satisfy the state sequence. The simplest state sequence is a single state condition. Specific segments of branched, looped or nested forms of state flow may be directly located by properly defined state sequences. In addition, each state condition in a state sequence may be required to occur from 1 to 65536 times before the state condition is satisfied. This form of positioning will locate the nth pass of a loop beginning at a given state condition. Clock delay may be incorporated by defining the nth occurrence of any state (an all don&#39;t care state specification). The trace logic may also be specified to restart the satisfaction of the predefined state sequence if it is not satisfied before or concurrently with the location of a predefined restart state condition. A restart on &#34;any state&#34; requires that the state sequence be satisfied without any unspecified intermediate states. For example, FIG. 2 illustrates the interactive trace specification display for a trace position starting upon the satisfaction of 4 state conditions in sequence. A restart state condition is also defined. 
     The selective trace is a qualification to determine which sampled states will be stored for display. One to seven state conditions may be &#34;OR&#34; specified for collection. Selectively tracing only sampled states of interest eliminates the clutter of unnecessary states and magnifies the apparent size of the trace beyond its 64 terms. Also, an occurrence term may be specified so as to store only every nth satisfaction of an &#34;OR&#34; specified state condition. FIG. 2 illustrates the selective trace of every occurrence of a single state condition. 
     The count measurement performs a &#34;time&#34; or a &#34;state&#34; count associated with each of the (64) states stored and can be displayed in one of two formats: 
     absolute--the count from the trace position 
     relative--the count from the previous trace state 
     The time count is performed by counting the occurrences of an internal clock between sequentially stored states and the display is in the units of seconds. A state count similarly counts the number of occurrences of a specified state condition (&#34;count&#34;) between sequentially stored states. For example, specifying &#34;any state&#34; would result in a count of the selected clock transitions of the input data. In FIG. 2, a state count is performed on the occurrences of a specified state condition intermediate to each sampled state stored. 
     INTERNAL MEASUREMENT STORAGE 
     One complete measurement of 64 sampled states, which includes the sampled states satisfying the state conditions defining the state sequence and specifications of the format, trace, and display, may be internally stored. This &#34;current measurement&#34; may be stored or exchanged with a &#34;stored measurement&#34; for later analysis. A &#34;trace compare&#34; mode of operation (described more fully below) compares results of a previously stored trace with the current measurement and may be utilized as a further qualifier on data storage. 
     DISPLAY SPECIFICATION 
     The output display format of the current measurement may be selected from a trace list, a trace graph, or a trace compare. 
     A trace list, illustrated in FIG. 3, displays a listing of the stored states in their order of occurrence. Twenty trace states, (one per line) are simultaneously presented on the CRT display. The &#34;ROLL&#34; keys allow scanning of the 64 stored states. Each line comprises a line number, the stored state alphabetically sorted into assigned labels in their numerical base, and the time or state count if selected. 
     A trace graph, as shown in FIG. 4, presents a graph of the data magnitude of a specified label versus the storage location for all 64 stored states. Each state is given a vertical displacement corresponding to its binary magnitude and an increasing horizontal displacement for successive states in order of their occurrence. The result is a waveform analogous to oscilloscope displays of voltage magnitude. The label to be graphed is selected by specifying the &#34;graphed label&#34;. Scaling of state magnitude is controlled by specifying the &#34;upper limit&#34; and &#34;lower limit&#34; on the vertical axis. Limits can be specified directly or dynamically varied with logrithmic autoranging controls. These facilities allow any portion of a graph to be magnified to a full scale presentation. The 20 points corresponding to the lines viewed in the trace list are intensified. The intensified portion also responds to the &#34;ROLL&#34; controls, and their corresponding absolute value may be read in the trace list. 
     A trace compare as illustrated in FIG. 5 presents a tabular listing of the difference between results in the &#34;current measurement&#34; and the data in the &#34;stored measurement&#34;. The listing is formatted and rolled as in the trace list. The results of the two measurements are exclusive OR&#39;ed such that identical corresponding bits are displayed as zeros and unequal bits are displayed as ones. In an octal base a &#34;03&#34; is equivalent to a binary &#34;000 011&#34; and indicates that the right two bits are different in the two measurements. Trace compare also offers a &#34;compared trace&#34; mode which reruns a measurement until the current and stored measurement are either equal or not equal. (STOP=, or STOP≠) For example, in FIG. 5 of the instrument has rerun trace measurements until the &#34;current measurement&#34; equaled the &#34;stored measurement&#34;, as indicated by the &#34;STOP=&#34; specification and revealed by the array of &#34;0&#34;&#39;s in the comparison. 
     TRACE MODES 
     Three trace mode options are provided. &#34;Trace&#34; executes a single current measurement. &#34;Continuous trace&#34; repeats the execution of a current measurement continuously. &#34;Compared trace&#34; repeats the execution of a current measurement until the desired comparison with the stored measurement is obtained. 
     CLOCK ENABLE AND TRIGGER OUTPUTS 
     A trigger output provides a triggering pulse for external instrumentation such as oscilloscopes. A 50 ns pulse is generated each time the trace position is found. The clock enable output is useful for gating clocks or interrupting the device under test. A high signal level indicates that the instrument is actively searching for the trace position. It remains at the high signal level until the trace position has been found or the halt key is depressed. Both outputs are suspended when the format specification is displayed to allow measurement of channel activity. 
     KEYBOARD AND SPECIFICATION DESIGNATION 
     Referring to FIG. 6, an illustration of the keyboard, the keys are functionally segregated into four blocks, the &#34;current measurement display&#34;, &#34;entry&#34;, &#34;edit&#34;, and &#34;execute&#34;. A power up sequence initially defines a default set of specifications, displays the default format specification, then automatically selects a hexadecimal trace list display. Activation of the &#34;ROLL DISPLAY&#34; keys permits the presentation of any portion of the 64 states stored. To change the format specification, the &#34;FORMAT SPECIFICATION&#34; key is pressed. The cursor keys in the edit block are used to move the cursor, designating a selectable entry field by a blinking inverse video field on the interactive display. 
     The trace specification can be edited by selecting the trace specification interactive display by activating the &#34;trace specification&#34; key. Editing is accomplished in the same manner as the format specification is edited. A general description of the functions of the individual keys is given in Appendix A. A detailed description of the interactive display entry fields is given in Appendix B. 
     DETAILED DESCRIPTION 
     Input states are sensed through 32 high impedance variable threshold data probes at rates up to 10 MHz. The data probes 100, illustrated in FIG. 7, are segmented into four 8 bit data pods and a fifth pod for clock sensing. Each pod may be preset to TTL logic threshold or variably adjusted in the range of +10 to -10 volts to interpret input logic levels. 
     The 32 input data channels and the clock signal from the data probes 100 are input to the state recognition module 200. An internal sampling clock is generated in response to the selected clock slope, the input data signals are compared to the selected threshold voltages and interpreted, and the data signals are latched in response to occurrences of the internal sampling clock. The state recognition module 200 outputs the sampled state to the high speed acquisition system bus 500. The index module 300 accesses the sampled state on the acquisition system bus 500, compares the sampled state to the selected state conditions and determines the trace position, selective storage events and state count events. The measurement control module 400 also accesses the acquisition system bus 500 and stores state or time counts and sampled data states in response to the events detected by the index module 300. 
     The modules of the acquisition system 250 communicate with other system modules via the communications bus 600, which provides a means for addressing selected modules and for transferring selected data. The entire system functions as a distributed memory, as illustrated in FIG. 8. For instance, addresses between 1800 and 1FFF on the communications bus 600 access the state count measurements and the sampled data states stored in the measurement control module 400 memories. FIG. 9 shows another representation of the system architecture, illustrating the relationship between the physical couplings of FIG. 7 and the logical addresses of FIG. 8. 
     Referring to FIG. 10, the index module 300 detects the trace position by first comparing the sampled state on the acquisition system bus 500 with a qualifier state condition stored in the multiple pattern recognition unit 315. The multiple pattern recognition unit 315 comprises a digital pattern triggering circuit as described in the copending patent application entitled &#34;DIGITAL PATTERN TRIGGERING CIRCUIT&#34;, U.S. patent application Ser. No. 743,188 filed Nov. 19, 1976, by WILLIAM A. FARNBACH now U.S. Pat. No. 4,100,532. As illustrated in FIG. 11, the multiple pattern recognition unit 315 comprises 2 pairs of 8 sixteen by four bit memories providing for the detection of up to eight qualifier state conditions, where each qualifier state condition is identified by a 1, 0, X input, format (in binary). Pattern selector 325 of FIG. 10 selects one of the eight lines output from the multiple pattern recognition unit and passes the selected output to the occurrence counter 345. The occurrence counter 345 counts the occurrences of the selected qualifier state conditions and provides an output in response to counting a specified number of occurrences of the selected qualifier state condition. This output is termed a &#34;break event&#34; and the sequencer logic 350 in response requests the pattern selector 325 to select the next sequential qualifier state condition and requests the occurrence counter 345 to select the corresponding count. The sequencer logic 350 also outputs a &#34;N-1&#34; event flag in response to detection of the occurrence of the &#34;NEXT TO LAST BREAK EVENT&#34;. A simplified sequential triggering circuit is illustrated in FIG. 12 where the multiple pattern recognition unit 316 incorporates the functions of the multiple pattern recognition unit 315 and of the pattern selector 325. The sequence logic 351 incorporates the functions of the sequence logic 350 except that the final trigger is output in response to the completion of the state sequence. Another method of implementing the multiple pattern recognition unit 316 would be to have 3 selector bits be the most significant bits in the address, allowing the comparator to sequence through various segments of memory when comparing sequential state conditions of the state sequence. 
     Referring again to FIG. 10, the selective trace is incorporated in a similar manner except that the trace selector 320 of FIG. 10 can &#34;OR&#34; any combination of the AME lines. A trace occurrence counter 340 outputs a trace event flag upon counting each &#34;nth&#34; &#34;ORED&#34; AME event. 
     The restart unit 310 causes the sequence logic 350 to restart the satisfaction of the state sequence subsequent to the detection of a selected restart state condition. The restart unit is disabled for the data state corresponding to the detection of a break event by sequencer logic 350 which permits the state sequence to be satisfied without any unspecified intermediate state by setting the restart state condition to &#34;any state&#34;. 
     The state count unit 305 strobes a counter in the measurement control module 400 each time the selected state condition to be counted is detected. 
     The measurement and control module 400 is illustrated in FIGS. 10 and 13. The event flags from index module 300 are input to the high speed control 460 and determine which sampled states on the acquisition system bus 500 are to be stored. The high speed control 460 addresses the data memory 410 and the count memory 420 accordingly. FIG. 14 illustrates the data format of the data memory 410. The sampled state conditions resulting in break events are sequentially stored in locations 1-(N-1). Upon detection of the &#34;N-1&#34; event flag, sampled state conditions are sequentially written into the remaining memory locations, writing over the oldest data when the memory is filled. The trace position address of the memory location containing the state condition resulting in the final trigger is stored in a register and sampled states are written into the appropriate number of remaining storage locations. For example, if the trace was defined to end on the detection of the trace portion, no sampled states would be written subsequent to the detection of the trace position. The order of occurrence of the stored data is easily reconstructed by recovery of the trace position address appearing on the communications bus 600 as illustrated in FIG. 8. Count selector and synchronizer 450 controls the measurement counter 430, whose contents are stored in count memory 420 upon update of the memory address. The low speed control 480 provides a low speed interface for programming the high speed control 460 and for selecting and latching data for the communications bus 600 interface. 
     The strobe generator 400, illustrated in FIGS. 10 and 13, generates a sequence of strobes which, when coupled with a series of data latches (not shown) and timing logic (not shown) effectuate the orderly performance of machine tasks. In effect, a number of sampled states are simultaneously in various stages of processing at any one time and are &#34;pipelined&#34; through the required logic blocks. 
     
                                           APPENDIX A__________________________________________________________________________GENERAL DESCRIPTION-KEYBOARD__________________________________________________________________________CURRENT MEASUREMENT DISPLAYLINES 3 THROUGH 24 ARE DEPENDENT ON DISPLAYED MENU CHOSEN,WHICH MAYBE SELECTED BY KEYS IN CURRENT MEASUREMENT BLOCK:FORMAT SPECIFICATION           SELECT CLOCK SLOPE AND FORMAT 32 CHANNELS           INTO LOGICAL LABELS AND DESIRED LOGIC           POLARITY AND NUMERICAL BASE.TRACE SPECIFICATION           DEFINE TRACE POSITION,SELECTIVE TRACE           AND COUNT MEASUREMENT.LIST            DISPLAY RESULTANT CURRENT TRACE AND           COUNT DATA.GRAPH           GRAPH RESULTANT CURRENT TRACE DATA FOR           SELECTED LABEL.THE 2.0. INTENSIFIED DOTS           CORRESPOND TO TRACE LIST DATA.COMPARE         DISPLAY &#34;EXCLUSIVE OR&#34; OF VALID CURRENT  VS            DATA WITH VALID STORED DATA,AND SELECT STORE          COMPARED TRACE MODE.ROLL  DISPLAY   VIEW TRACE LIST OR TRACE COMPARE DATA.           TRACE GRAPH SHOWS INTENSIFIED DOTS THATGRAPH GRAPH     REPRESENT THE TRACE LIST DATA DISPLAYED.ENTRYALL PROGRAM ENTRIES ARE MADE IN INVERSE VIDEO FIELDS AT THEBLINKING CURSOR,AND MAYBE CHANGED BY ENTRY BLOCK OF KEYS:FIELD SELECT [ ]           ALL FIELDS ENCLOSED WITH BRACKETS [ ]           ARE CHANGED BY THIS KEY. THE 161.0.A           SELECTS ONLY ALLOWED CHOICES..0.-G,A-F,X     ALL OTHER FIELDS MAYBE CHANGED USING           THESE KEYSEDITDISPLAYED MENUS MAYBE EDITED BY EDIT BLOCK OF KEYS:DELETE INSERT   USED IN TRACE SPECIFICATION MENU ONLY           TO OPTIONALLY DELETE OR INSERT STATES           TO SPECIFY TRACE POSITION AND SELECTIVE           TRACE.A MAXIMUM OF 8 STATES MAYBE USED           BETWEEN TRACE POSITION AND SELECTIVE           TRACE.DEFAULT         RETURN DISPLAYED MENU TO KNOWN (PRESET,           TRACEABLE) CONDITION.INCR DECR       USED IN TRACE GRAPH ONLY TO AUTOMATICALLY           CHANGE UPPER OR LOWER GRAPH LIMITS.           TO MOVE BLINKING CURSOR TO DESIRED FIELD.EXECUTETHE REMAINING KEYS ARE THE EXECUTE BLOCK OF KEYS:CURRENT MEASUREMENT           KEY SAVES CURRENT SPECIFICATION AND           DATA MEASUREMENT IN A STORED FILE.THESTORED MEASUREMENT           CURRENT SPECIFICATION AND DATA REMAINS           UNCHANGED.           KEY EXCHANGES CURRENT AND STORED           MEASUREMENT FILES.PRINT           PRINT CURRENT DISPLAY,EXCEPT TRACE GRAPH           ON AN HP 9866 LINE PRINTER USING CONNECTOR           ON REAR OF 161.0.A.TRACE LIST AND TRACE           COMPARE WILL PRINT CURRENT PAGE AND ANY           REMAINING DATA IN MEMORY.TRACE           EXECUTES CURRENT SPECIFICATION,AND IF           DISPLAY IS FORMAT SPECIFICATION OR           TRACE SPECIFICATION,THE 161.0.A SWITCHES           DISPLAY TO TRACE LIST.           IF TRACE IS HELD DOWN,THE MEASUREMENT IS           TRACED CONTINUOUSLY.           IF COMPARE TRACE MODE IS SET FOR [STOP=]           OR [STOP#] THE MEASUREMENT IS TRACED           UNTIL COMPARED CONDITION IS MET.THE           INSTRUMENT STATUS (1ST LINE) IS           &#34;COMPARED TRACE-FAILED&#34;,IMPLIES CONDITION           NOT MET,OR &#34;COMPARED TRACE-COMPLETE&#34;,           IMPLIES CONDITION MET.STOP            STOPS ANY MEASUREMENT TRACE,COMPARED TRACE           OR PRINT IN PROCESS.__________________________________________________________________________ 
    
     
                                           APPENDIX B__________________________________________________________________________DETAILED FIELD/S DESCRIPTION__________________________________________________________________________CLOCK SLOPE:EXAMPLES:   CLOCK SLOPE [+]   CLOCK SLOPE [-]PURPOSE:   TO SELECT CLOCK TRANSITION TO STROBE POD DATA INTO   161.0.A.LABEL ASSIGNMENT AND ACTIVE CHANNELS:EXAMPLE:   POD4       POD3       POD2       POD1   7-- -- -- -- -- --.0.              7-- -- -- -- -- --.0.                         7-- -- -- -- -- --.0.                                    7-- -- -- -- -- --.0.   AAAAAAAA   AAAAAAAA   DDDDDDDD   XXXXXXXF   11111111   11111111   11111111   1   ACTIVE CHANNELSPURPOSE:   TO ASSIGN LABELS A,B,C,D,E OR F TO ANY NUMBER OF   CONTINUOUS CHANNELS INDEPENDENT OF POD BOUNDARIES. - IN THE ABOVE   EXAMPLE THE LABEL A   IS ASSIGNED TO 16 BITS OF POD3 AND POD4,AND MAY   REPRESENT A 16 BIT ADDRESS.LABEL D IS ASSIGNED 8 BITS   ON POD2 AND MAY REPRESENT AND 8 BIT DATA BLS. LABEL   F IS ASSIGNED TO BE A SINGLE BIT QUALIFIER (READ,   WRITE) AND IS ASSIGNED TO LEAST SIGNIFICANT BIT ON   POD1.   ANY UNUSED CHANNELS MAYBE TURNED OFF BY PUTTING A &#34;X&#34;   IN GIVEN CHANNELS.COMMENT:   AS MANY AS SIX LABELS OR AS FEW AS ONE MAYBE ASSIGNED   ACROSS THE 32 CHANNELS. IF A LABEL IS SPLIT, SUCH AS    AABBBAAA  (LABEL IS NOT CONTINUOUS)   THEN AN ERROR MESSAGE &#34;ERROR-SPLIT LABEL&#34; IS DISPLAYED   AND THE CURSOR IS LOCKED TO LABEL ASSIGNMENT FIELDS UNTIL   THE ERROR IS CORRECTED.   PRESSING DEFAULT KEY WILL ASSIGN LABEL F TO ALL 32   CHANNELS.   ACTIVE CHANNELS ARE SHOWN BY &#34;!&#34; MARKS FOR EACH ASSIGNED   CHANNEL. ABSENCE OF &#34;!&#34; INDICATE LOW CHANNEL(BIT)   ACTIVITY,AND ARE GOOD INDICATORS OF POD CLIPS THAT MAY   HAVE FALLEN OFF. CHANNEL ACTIVITY IS NOT   DISPLAYED WHILE 161.0.A IS TRACEING.   IF POD IS CONNECTED TO DATA PORT ON REAR OF 161.0.A,   THE CHANNEL ACTIVITY &#34;!&#34; FOR LEAST SIGNIFICANT 2 BITS   IS NOT SHOWN (DUE TO SYNCHRONOUS 8 BIT COUNT AND   161.0.A).LOGIC POLARITY:EXAMPLE:   LABEL       A   D   F   LOGIC POLARITY               [-] [-] [+]   (+,-)PURPOSE:   TO SELECT A LOGIC POLARITY FOR EACH ASSIGNED LABEL.NUMERICAL BASE:EXAMPLE:   LABEL       A   B   F   NUMERICAL BASE               [HEX]                   [OCT]                       [BIN]   (BIN,OCT DEC,HEX)PURPOSE:   TO SELECT A NUMERICAL BASE TO BE HEXIDECIMAL(HEX),   OCTAL(OCT),DECIMAL(DEC),OR BINARY(BIN) FOR   EACH ASSIGNED LABEL.TRACE POSITION:EXAMPLE:   [START ] TRACE   [CENTER] TRACE   [END ] TRACEPURPOSE:   TO SELECT TRACE POSITION TO BE SOME GIVEN STATE   AND ITS POSITION IN RESULTANT DATA TRACE FILE   SHOULD BE AT [START] FOLLOWED BY SELECTIVE TRACE   STATES,OR AT [CENTER]  SHOWING ANY SELECTIVE STATES   BEFORE AND AFTER &#34;CENTER STATE&#34;,OR AT [END]   SHOWING ANY SELECTIVE STATES BEFORE THE &#34;END STATE&#34;.EXAMPLE:   LABEL       A  OCCUR   BASE        HEX                  DEC   FIND IN SEQUENCE               1.0.                  .0..0..0..0.1   THEN        2.0.                  .0..0..0..0.1   THEN        3.0.                  .0..0..0..0.5   [START ] TRACE               4.0.                  .0..0..0..0.1   SEQ.RESTART [ON]               5.0.COMMENT:   THIS EXAMPLE HAS THE FOLLOWING MEANING FOR DEFINING   TRACE POSITION:   FIND IN SEQUENCE .0..0..0..0.1 OCCURANCE OF STATE 1.0.,THEN   THE .0..0..0..0.1 OCCURANCE OF STATE 2.0., THEN THE .0..0..0..0.5   OCCURANCE   OF STATE 3.0.,AND [START] TRACE AT .0..0..0..0.1 OCCURANCE   OF STATE 4.0..   IF DURING THIS SEQUENCE THE RESTART STATE 5.0. IS   ENCOUNTERED BEFORE REACHING THE .0..0..0..0.1 OCCURANCE OF   STATE 4.0.,THE MEASUREMENT RESTARTS,TO FIND IN SEQUENCE   THE .0..0..0..0.1 OCCURANCE OF STATE 1.0. ,THEN .0..0..0..0.1   OCCURANCE   OF STATE 2.0. ETC.   NOTE: IF A SEQUENCE STATE IS DEFINED TO BE THE SAME AS THE   RESTART STATE,THE SEQUENCE STATE DOMINATES.   IF [CENTER] OR [END] WERE SELECTED,SELECTIVE   TRACE STARTS AT COMPLETION OF 5 OCCURANCES   OF STATE 3.0. (SEE SELECTIVE TRACE).SELECTIVE TRACE:EXAMPLE:   LABEL       A  OCCUR   [ALL STATES]PURPOSE:   TO TRACE ALL STATES.EXAMPLE:   LABEL       A  OCCUR   BASE        HEX                  DEC   TRACE   [ONLY STATE]               6.0.                  .0..0..0..0.1   OR          7X   OR          8XPURPOSE:   TO SELECTIVELY TRACE DESIRED STATES.COMMENTS:   THE ABOVE EXAMPLE HAS FOLLOWING MEANING:   DO A SIMULTANEOUS TRACE OF .0..0..0..0.1 OCCURANCE   OF STATES 6.0. OR 7X (7.0. TO 7F) OR   8X (8.0. TO 8F).COUNT:EXAMPLE:   LABEL       A   BASE        HEX   COUNT [ OFF ]   COUNT [STATE]               7X   COUNT [TIME ]PURPOSE:   TO SELECT COUNT MEASUREMENT TO BE [OFF] ,OR COUNT [STATE]   OR COUNT [TIME].COMMENT:   WHEN COUNT IS [OFF], THE TRACE LIST DOES NOT SHOW   COUNT DATA FOR THE NEXT TRACE MEASUREMENT.   WHEN COUNT [STATE] IS SELECTED, A 32 BIT COUNT OF - SELECTED   STATE 7X (7.0. TO 7F) IS STORED IN MEMORY   WITH EACH POD DATA STATE STORED. THE RESULTANT COUNT   DATA IS DISPLAYED IN TRACE LIST FOR NEXT TRACE   MEASUREMENT.   WHEN COUNT (TIME) IS SELECTED, A COUNT VALUE OF TIME IS   STORED FOR EACH POD DATA STATE STORED IN MEMORY. THE   RESULTANT TIME DATA IN DISPLAYED IN TRACE LIST FOR   NEXT TRACE MEASUREMENT.STATE COUNT OR TIME [ABS],[REL]:EXAMPLE:   LABEL       A  STATE COUNT   BASE        HEX                  DEC                  [ABS]   SEQUENCE    1.0.                  - 1.0.43   SEQUENCE    2.0.                  - 1.0.33   SEQUENCE    3.0.                  - 1.0.23   START       4.0.                      .0.   +.0.1       6.0.                  +  2.0.   +.0.2       7.0.                  +  3.0.   +.0.3       71 +   31   .           .  .   LABEL       A  STATE COUNT   BASE        HEX                  DEC                  [REL]   SEQUENCE    1.0.   SEQUENCE    2.0.                     1.0.   SEQUENCE    3.0.                     2.0.   START       4.0.                    1.0.23   +.0.1       6.0.                     2.0.   +.0.2       7.0.                     1.0.   +.0.3       71     1   .           .  .   LABEL       A  TIME   BASE        HEX                  DEC                  [ABS]   SEQUENCE    1.0.                  - 2.0.8.3 US   SEQUENCE    2.0.                  - 2.0..0..2 US   SEQUENCE    3.0.                  - 185.1 US   START       4.0.                      ..0. US   +.0.1       6.0.                  +  8.0...0. US   +.0.2       7.0.                  + 12.0..9 MS   +.0.3       71 + 122.5 MS   .           .  .PURPOSE:   TO VIEW TRACE LIST AND SELECT [ABS] OR   [REL] FOR STATE COUNT OR TIME DATA.COMMENTS:   WHEN ABSOLUTE [ABS] IS SELECTED THEN STATE COUNT   OR TIME IS DISPLAYED IN +/- ABSOLUTE VALUES WITH   RESPECT. TO START STATE 4.0.. ALL STATES BEFORE START   STATE 4.0. ARE SHOWN WITH &#34;-&#34; COUNT VALUES. START   STATE 4.0. IS SHOWN AS ALWAYS .0.. ALL STATES SHOWN   AFTER START STATE 4.0. ARE SHOWN WITH &#34;+&#34; COUNT   VALUES.   WHEN RELATIVE [REL] IS SELECTED, THEN STATE COUNT   OR TIME IS DISPLAYED SHOWING COUNT VALUES RELATIVE   TO PREVIOUS STATE COUNT VALUE (IF VALID)   WITHOUT SIGN.GRAPHED LABEL:EXAMPLE:   GRAPHED LABEL [A]   GRAPHED LABEL [F]PURPOSE:   TO SELECT A DEFINED LABEL A,B,C,D,E OR F TO BE   GRAPHED.UPPER/LOWER LIMITS:EXAMPLE:   UPPER LIMIT   177   LOWER LIMIT   .0..0..0.PURPOSE:   TO CHANGE UPPER OR LOWER GRAPH LIMITS.COMMENT:   GRAPH LIMITS MAYBE CHANGED USING ENTRY KEYS OR   THE LIMITS MAYBE AUTOMATICALLY INCREMENTED OR   DECREMENTED USING INCR OR DECR KEYS   IN EDIT BLOCK.   THE UPPER LIMIT MUST BE GREATER THAN LOWER LIMIT,   ELSE AN &#34;ERROR-OVERLAPPING LIMITS&#34; IS DISPLAYED   AND GRAPH DOTS ARE NOT DISPLAYED.COMPARED TRACE MODE:EXAMPLE:   LABEL       A  COMPARED   BASE        HEX                  TRACE MODE                  [OFF]   SEQUENCE    .0..0.   SEQUENCE    .0..0.   SEQUENCE    .0..0.   START       .0..0.   +.0.1       3.0.   +.0.2       .0..0.PURPOSE:   TO SHOW THE &#34;EXCLUSIVE OR&#34; OF CURRENT DATA WITH   STORED DATA. ALL .0.&#39;S IMPLIES SAME DATA IN BOTH FILES   AND NON .0.&#39;S (3.0.) SHOWS THAT DATA STATE DOES NOT   COMPARE (BITS 4 AND 5, ASSUMING LSB IS BIT .0.).EXAMPLE:   LABEL       A  COMPARED   BASE        HEX                  TRACE MODE                  [STOP=]   LABEL       A  COMPARED   BASE        HEX                  TRACE MODE                  [STOP#]PURPOSE:   TO SELECT COMPARED TRACE MODE TO BE STOP WHEN EQUAL   [STOP=],OR STOP WHEN NOT EQUAL [STOP#].COMMENTS:   WHEN [STOP=] IS CHOSEN THE MEASUREMENT IS TRACED   UNTIL VALID CURRENT DATA EQUALS (=) VALID STORED   DATA.THE STATUS OF INSTRUMENT WILL BE:     &#34;COMPARED TRACE-FAILED&#34;   WHICH MEANS CURRENT DATA DOES NOT EQUAL STORED   DATA.THE 161.0.A THEN TRACES AGAIN SHOWING:     &#34;COMPARED TRACE-IN PROCESS&#34;   AND COMPARES ANOTHER SET OF DATA. THIS PROCESS   CONTINUES UNTIL:     &#34;COMPARED TRACE-COMPLETE&#34;   WHICH MEANS VALID CURRENT FILE EQUALS VALID STORED FILE   DATA.   A SIMILIAR OPERATION EXISTS FOR [STOP#],EXCEPT THIS   MEASUREMENT CONTINUES UNTIL FILES DO NOT COMPARE.   NOTE: THIS IS NOT A REAL TIME MEASUREMENT,BUT RATHER   A &#34;SAMPLED COMPARED MODE&#34; THAT IS DEPENDENT IN PART   UPON DATA CLOCK RATES,TRACE SPECIFICATION.   THIS MEASUREMENT MODE MUST BE TURNED [OFF]   TO OBTAIN SINGLE OR CONTINUOUS TRACE MODE.__________________________________________________________________________