Abstract:
A comparator circuit with comparing means for comparing first and second voltages, has current source circuitry for providing current to said comparing means, said current source circuitry having an input for receiving a clock signal having first and second states, whereby the comparing means starts to compare the first and second voltages when the clock signal makes a transition from the first state to the second state; and means for determining when said comparing means has completed a comparison of said first and second voltages and for switching off said current source circuitry and hence said comparing means when said comparison has been completed.
Abstract:
A current mirror has an input node for receiving an input current and an output node for filing an output current. First, second and third transistors are provided with each transistor having first and second current path terminals and a control terminal. The control terminals of the first and second transistors are connected to each other. The first current path terminal of the first transistor and one of the current path terminals of the second transistor are connected to a power supply. The control terminal of the third transistor is connected to the input node. One of the first and second current path terminals of the third transistor are connected to the output node and the other of the first and second current path terminals of the third transistor are connected to the other of the first and second current path terminals of the second transistor. A resistive element is arranged between the input node and the second current path terminal of the first transistor. The control terminals of the first and second transistors are connected to a node between the resistive element and a second current path terminal of the first transistor. The resistive element is a transistor of the opposite plurality to the first, second and third transistors.
Abstract:
A computer system has a plurality of processors each for executing a sequence of instructions and at least one of the processors having a cache memory associated therewith. A memory provides an address space of that processor where data items are stored for use by all of the processors. A behaviour store holds in association with the address of each item a cache behaviour identifying the cacheable behaviour of the item, the cacheable behaviours including a software coherent behaviour and an automatically coherent behaviour. When a cache coherency operation is instigated by a cache coherency instruction, the operation is effected dependent on the cacheable behaviour of the specified address of the item. A method of modifying the coherency status of a cache in this manner is also described.
Abstract:
There is disclosed a controller for controlling direct memory access. Such controller is particularly applicable when applied to a transport interface in the receiver of a digital set-top-box for television systems. Storage means stores the base and top addresses of a circular buffer in a memory to which received data is to be forwarded and stored, and a write pointer for such buffer is also stored in the storage means. Addressing circuitry generates the address to which the receive data is to be written in dependence on the stored base and top addresses and the write pointer. Output circuitry writes the data into the circular buffer at the location identified by the generated address.
Abstract:
An electronic device includes a first laser source (101a) configured to project a first laser beam (107a), and a second laser source (101b) configured to project a second laser beam (107b) in alignment with the first laser beam in a first direction but at an angle with respect to the first laser beam in a second direction. A mirror apparatus (110) is positioned so as to reflect the first and second laser beams. Control circuitry (130) is configured to control the mirror apparatus to simultaneously reflect the first and second laser beams in a first scan pattern to form an first image, the first image formed from the first scan pattern having a number of scan lines greater than two times a horizontal resonance frequency at which the mirror apparatus oscillates divided by a desired frame rate of the first image.
Abstract:
A method, apparatus and system for restricting the use of a data item (PBK1) stored within a circuit (3), the method comprising the steps of: - receiving and storing the data item in the circuit (3); - receiving a signature (201), the signature (201) being derived from data in a data item field (hash of PBK1=H(PBK1)-207) and data in one or more value fields (VCC 203, STC 205), the signature (201) being in a (RSA) coded form generated according to a predetermined algorithm (RSA): - decoding the signature (201) and extracting information representative of the data H(PBJ1) in the data item field (207) and information representative of the values VCC & STC in the one or more value fields (203, 205); - determining whether the information representative of the data extracted from the data item field (207) of the signature (201) corresponds to a predetermined value stored in the circuit (3) and whether the information representative of each value extracted from each value field (203,205) of the signature (201) corresponds to a corresponding further predetermined value stored in the circuit (3); and - generating a comparison signal according to the result of the determinations; in which use of the data item (PBK1) is restricted according to the state of the comparison signal.
Abstract:
An initiator transmits a data access command to a data source or destination containing an identification of the initiator and of the data source or destination. A security filter compares the identifications with a list of those initiators defined as secure and a list of those data sources or destinations which are defined as unprivileged. The filter then blocks or allows the data access command signal according to a set of rules. In one embodiment, the most secure initiator is a security control circuit which is authorised to access all data sources or destinations. The other secure initiators are authorised to access only specified unprivileged data sources or destinations and the insecure initiators are not authorised to access any data sources or destinations. The information relating to which initiators are secure and insecure and which data sources or destinations are privileged and unprivileged is loaded during an initialisation procedure by the security control circuit in response to a configuration command transmitted by a processor. In order that the configuration command is not blocked by the security filter before the processor is authorised to access the security control circuit prior to initialisation, the configuration command is verified using a signature check.
Abstract:
The routing of data streams is discussed, and particularly routing one or more incoming streams to one or more output destination port. The ability to merge incoming streams is discussed so that several low bit rate input packet streams can be merged into a higher bit rate output stream. An assignment data structure identifies for each input stream the or each destination to which it is to be routed, and a packet allocation data structure holds information about the packets and information about the destination of the packets to allow a memory holding the packets to be controlled accordingly.
Abstract:
This invention relates to a linear scalable method for computing a Fast Fourier Transform (FFT) or Inverse Fast Fourier transform (IFFT) in a multiprocessing system using a decimation in time approach. Linear scalability means, as the number of processors increases by a factor P (for example), the computational cycle reduces by exactly the same factor P. The invention comprises computing the first two stages of an N-point FFT/IFFT as a single radix-4 butterfly computation operation while implementing the remaining (log 2 N-2) stages as radix-2 operations, fusing the 3 main nested loops of each radix-2 butterfly stage into a single radix-2 butterfly computation loop, and distributing the computation of the butterflies in each stage such that each processor computes an equal number of complete butterfly calculations thereby eliminating data interdependency in the stage.