Data-processing apparatus provided with a finite-state machine to perform a program jump

Claim 1

A data-processing apparatus comprising a processor, a read-write memory, an interface element for connection to the "outside world" and a data bus to connect said components to each other, and also comprising a program counter, a program memory addressed by the program counter, an instruction register connected to a data output of said program memory, and a control bus connected to said instruction register to apply control signals to said processor, said read-write memory and said interface element; said program counter being provided with means to perform, in a first alternative, an incrementation operation by means of an incrementation element (204), or, in a second alternative, a loading operation, and having for that purpose a data input connected to said control bus in order to receive a jump address for the execution of a first program jump, said first or second alternatives being selected by a control signal from said instruction register; said instruction register further providing signals for the execution of a second program jump via a feedback finite-state machine (206, 208), said finite-state machine comprising a first decoding circuit (206) connected to an output register (208); in which outputs from said output register are fed back to the first decoding circuit, and in which said first decoding circuit is fed a sign-signal output (207) from said processor, said output register (208) having a multibit-wide information output whose content bits are formed in at least two successive machine cycles, wherein said multibit-wide information output is connected to a comparator (218) to supply a condition code to said comparator, which comparator is also supplied by outputs from said instruction register in order, upon detection of a first equality condition (unequal) between said supplied items of information, to validate a current instruction or, upon detection of a second equality condition (equal) between said supplied items of information, to invalidate, in a third alternative, said current instruction, so that said current instruction operates like a dummy instruction (NOP) and a subsequent instruction is then activated.