# US 2003/0070107 A1 · Processor provided with a slow-down facility through programmed stall cycles

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2003/0070107 A1
- Document ID: US20030070107A1
- Status: Published application
- Kind: A1
- Application number: 10/207,507
- Filed: 2002-07-29
- Published: 2003-04-10
- Earliest claimed: 2001-08-01
- Assignees: Koninklijke Philips Electronics N.V.
- Inventors: Abraham Karel Reimens; Nathan Woods
- Web page: https://patentgrep.com/patent/US20030070107A1

## CPC

- G06T 1/20: Processor architectures; Processor configuration, e.g. pipelining
- G06F 9/3836: {Instruction issuing, e.g. dynamic instruction scheduling or out of order instruction execution}
- G06F 9/3869: {Implementation aspects, e.g. pipeline latches; pipeline synchronisation and clocking}
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A processor executes image processing under control of a clock facility, such that a sequence of C effective clock cycles will effect a processing operation of a predetermined amount of image information. In particular, the processor has programming means for implementing programmable stall clock cycles interspersed between the effective clock cycles for implementing a programmable slowdown factor S, such that a modified number of C*S overall clock cycles will effect processing of the predetermined amount of digital signal information.

## Claims

### Claim 1

A processor for executing digital signal processing under control of a clock facility, such that a sequence of C effective clock cycles will effect a processing operation of a predetermined amount of digital signal information,
said processor being characterized in having programming means for implementing programmable stall clock cycles interspersed between said effective clock cycles for implementing a programmable slowdown factor S, such that a modified number of C*S overall clock cycles will effect processing of said predetermined amount of digital signal information.

### Claim 2 (depends on 1)

A processor as claimed in claim 1, and having said programming means controlling the interspersing in an at least substantially periodical manner.

### Claim 3 (depends on 1)

A processor as claimed in claim 1, effectively representing a coprocessor and having a control processor as said programming means.

### Claim 4 (depends on 3)

A processor as claimed in claim 3, wherein said coprocessor and said control processor are interconnected by a bus to a shared memory facility.

### Claim 5 (depends on 4)

A processor as claimed in claim 4, wherein said coprocessor, said control processor and said bus are disposed on a single semiconductor chip, whereas said shared memory facility is at least substantially off-chip.

### Claim 6 (depends on 1)

A processor as claimed in claim 1, and being arranged to execute at least two different modes, the modes being characterized by requiring respective different amounts of data to be processed under respective different percentages of stall clock cycles.

### Claim 7 (depends on 1)

A processor as claimed in claim 1, said stall cycles being generated by a floating point to integer conversion.

### Claim 8 (depends on 1)

A processor as claimed in claim 1, wherein said programming means drive an incrementable storage facility through a periodical increment by a number N that is a function of said factor S according to N=round (R*x), wherein x=(S−1/S) and R is the range of the storage facility, and wherein a carry output signal of the storage facility will generate a stall cycle.

### Claim 9 (depends on 1)

A processor as claimed in claim 1, wherein said programming means drive an arithmetic element that is arranged for executing an addition or subtraction operation with regard to a programmed value, and said addition or subtraction will in a first case produce a carry or borrow signal, respectively, and in a second case not produce such carry signal or borrow signal, respectively, and wherein a transition from a stall cycle to an effective processing cycle will be controlled by a transition between said first and second states.

### Claim 10 (depends on 5)

A processor as claimed in claim 5, wherein at least one other bus station than the coprocessor is allowed to grab the bus in a time interval during a said stall cycle.

### Claim 11 (depends on 1)

A processor as claimed in claim 1, furthermore having an origin for controlling second stall cycles, and comprising a detection facility for detecting an excessive number of said programmable stall cycles and said second stall cycles combined, and said processor having a control facility fed by said detection facility for then amending a recurrency of said programmable stall cycles.

### Claim 12 (depends on 11)

A processor as claimed in claim 11, wherein said detection facility is arranged for generating an interrupt signal.

### Claim 13 (depends on 11)

A processor as claimed in claim 11, wherein said detection facility is arranged for letting a bus arbiter allocate more bandwidth to the coprocessor in question.

### Claim 14 (depends on 1)

A processor as claimed in claim 1, furthermore having an origin for controlling second stall cycles, and comprising a detection facility for detecting an excessive number of said programmable stall cycles and said second stall cycles combined, and said processor having a control facility fed by said detection facility for then amending one or more control parameters of the coprocessor through exploiting its scalability.
