Abstract:
A real time digital Fourier analyzer using the Cooley-Tukey algorithm for calculating the Fast Fourier Transform. An arithmetic unit simultaneously performs the two complex calculations Ar Br + Wr Cr and A(r n/2) Br - Wr Cr. The calculated results are simultaneously stored and retrieved in an in-place operation in dual buffers in successive iterations. Addressing of the buffers uses a single binary address counter and sequential bit complementing for simultaneously addressing both buffers. Parity checking of the binary counter output address controls multiplexing logic to selectively address the buffers to store the calculated results into the desired buffer storage locations.
Abstract:
PROBLEM TO BE SOLVED: To provide a method, apparatus and computer instructions for presenting coverage data for code. SOLUTION: The coverage data containing instruction access indicators associated with the code are obtained. Particular instruction access indicators that have been set by a processor in the data processing system in response to execution of the code by the processor are identified to form set instruction access indicators. Each set instruction access indicator is associated with a portion of the code. A presentation for the coverage data is generated. The set instruction access indicators are identified in the presentation. This presentation may be, for example, a graphical presentation. COPYRIGHT: (C)2006,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To provide a method and a system capable of tracking a repeat instruction. SOLUTION: The repeat instruction is executed inside a processor. Interruption is started inside the processor in response to detection of a repeat instruction flag set during the last execution of the repeat instruction. The processor makes readout of execution count for the repeat instruction from a storage device inside the processor by a tracking program or external hardware during the interruption possible. COPYRIGHT: (C)2004,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To provide a method, an apparatus and a system for counting interrupts by type; and to provide a computer program having instructions for counting interrupts by type. SOLUTION: An interrupt count is incremented when a particular type of interrupt occurs. The count may be stored in an IDT (interrupt descriptor table) or an interrupt count table (ICT) outside the IDT. An interrupt unit increments the count each time a particular type of interrupt occurs. In the event of a potential count overflow, the mechanism of this application provides logic necessary to notify software in order to handle the overflow. COPYRIGHT: (C)2005,JPO&NCIPI
Abstract:
A method and apparatus is provided which allows a computer graphics system to accurately determine the actual depth value for pixels on a display screen which lie at the same depth as an associated surface. The associated surface is identified such that the delta z value with respect to the x and y direction along the surface can be calculated. The present invention then determines whether the line being considered is contained within a surface, or is an edge lying between, and adjacent to two surfaces. If the line is contained within a surface, the delta z value is initially added to the known endpoints of the line and then successively added, in the incremental x or y directions, to the pixels selected to represent the line. If the line is an edge, and includes selected pixels which lie on both associated surfaces, a filter is invoked that prevents those pixels corresponding to the surface, other than the surface first being considered, from being processed. The pixels being considered are then drawn in the same manner as a line within a surface. In this manner, the actual z value for each selected pixel can be determined and any hidden line, hidden surface removal problems are eliminated.
Abstract:
For profiling a program carried out in a data processing system, it is necessary to scan the basic profiling of the program being run and for each scanning period to generate a tree-data structure in which nodes represent the tree-data structure of the routines of the programs carried out during the scanning period. As a reaction to the notification that the program is concluded, the tree-data structures of all the scanning period are merged to a resulting tree-data structure.