Abstract:
A method and apparatus for enabling a computer to run using either a Big Endian or Little Endian architecture is provided. The method and apparatus use the fact that XORing the lower two bits of a byte address in one architecture with a binary 3 converts that byte address to the equivalent byte address in the other architecture. The conversion method and apparatus is implemented in hardware by setting a bit in a status register indicating a Big Endian or Little Endian architecture in conjunction with an XOR gate which couples the byte address to binary 3. The conversion method and apparatus is implemented in software by scanning the instructions of the input for load and store instructions. The software modifies the instructions by taking the contents of the register and XORing the two least significant bits of the byte address with a binary 3.
Abstract:
A data processing system (10) implements a static and a dynamic masking operation of operand information concurrently. A static mask implements a conditional mask of a predetermined number of bits specified by the user and is determined prior to a comparison operation between the breakpoint address stored in a breakpoint register (24) and a logical address transferred via a logical address bus (11). A dynamic mask value implements a variable mask which allows the data processing system to mask the breakpoint address according to the size of a breakpoint address access. The static mask value and the dynamic mask value are concurrently implemented using a specialized bit cell (60) contained in both the breakpoint register (24) and the CAM array (26). The specialized bit cell (60) is comprised of two transistors (62 and 64) to concurrently mask a respective bit of operand information during a comparison operation.
Abstract:
The number of zeroes in an operation result of 54 bits is counted by a priority encoder 2 on a three-bit basis. A 54.times.18 normalization shifter 3 normalizes the operation result in response to the counted result. An LSB determination logic 4 determines a position of the LSB shifted by overflow and underflow, according to a logic state of the most significant three bits of the operation result, and an increment signal generating portion 5 and a three-bit input incrementer 6 add 1 corresponding to the shifted LSB to generate a round-up signal. A 54.times.3 normalization shifter 9 selectively normalizes a processed result of a lost-significant bit processing portion B or that of a round processing portion A. Normalization shifters of the lost-significant bit processing portion constitute a two stage structure, in which the normalization shifter in the final stage also serves for the rounding processing portion, and a normalization shifter in the succeeding stage of an arithmetic operation portion is omitted. Consequently, a floating point arithmetic unit with the reduced volume of hardware can be provided without reducing the operation speed.
Abstract:
A leading zero predictor (LZP) in parallel with the full subtraction operation correctly predicts the exact number of leading zeros of a subtraction result. Once the full subtraction operation is completed, the necessary shifts may be performed immediately, without a delay to determine the presence of leading zeros, and without need for a normalization corrector.
Abstract:
The anomaly handling facility provides a system for controlling conversion, detecting anomalies, providing analysis of anomaly content in an array of floating-point elements, and preserving reconstruction data to recover value accuracy typically lost when anomalies are encountered during conversion.Although the preferred embodiment specifically handles anomalies relative to the commonality of value representation by both IBM ESA/370 hexadecimal floating-point notations and ANSI/IEEE 754-1985 binary floating-point stand notations, the systematic design provided by the disclosed floating-point notation conversion anomaly handling facility can be applied to an pair of floating-point notation systems that are not totally coincident in value coverage.
Abstract:
A computing method of floating-point represented data including dividing data x with a n (n>M) bit length into high rank data X' and low rank data .alpha. with a mutual m bit length, a mantissa part of the high rank data X' leaving the same bits as those of the data x by k bits (k.gtoreq.1) from its initial bit to replace the rest of the bits of X' by zero, the low rank data .alpha. being formed as X--X', and computing other data together with the high rank data X' and the low rank data .alpha..
Abstract:
A method for coordinating the activity of a plurality of processors in a computing architecture adapted to emulate a physical space, in which spatial locality is reflected in memory organization, including the steps of subdividing the emulated physical space, assigning memory to each subdivision, and assigning a processor to each assigned memory, respectively. A related data array computer for performing an iterative updating operation upon data bits, including a first circuit for performing data-blind data movement upon the data bits, the circuBACKGROUND OF THE INVENTIONThe U.S. Government has non-exclusive rights in this invention pursuant to contract number N00014-84-K-0099 awarded by DARPA.
Abstract:
A micro scanning tunneling microscope ("STM") arithmetic circuit device comprises an information-rewritable micro STM recording medium and a micro STM recording apparatus which temporarily stores information on the recording medium such that the information can be read as a variation in a tunnel current. The recording apparatus has a probe (probes) for writing/reading information on the recording medium and a scanner for varying a relationship in position between the probe and the recording medium. The micro STM recording apparatus uses a recording medium having a specific format as the micro STM recording medium in which recorded information is read as a variation in a tunnel current. That is, the recording medium has an address area in which address information is recorded and a data area in which data information is recorded.
Abstract:
The amount of shifting required for normalizing a result of floating-point type multiplication is screened to determine if it falls within a predetermined range. The result is directly normalized in the event that the amount of shifting falls within the range while if the amount falls outside the predetermined range, the result is subject to coarse shifting until it falls in the predetermined range and then is normalized.
Abstract:
A masked compare circuit for comparing a first N-bit dataword to a second N-bit dataword, the circuit including a decoder for receiving an M-bit mask code and generating an output signal identifying a bit position, K, derived from the M-bit mask code, M and K being positive integers; and a comparator module responsive to the decoder output signal for comparing the N-K+1 most significant bits of the first dataword to corresponding bits of the second dataword, the comparator module generating an output signal having a first value when all of the compared bits are the same and having a second value when any of the compared bits are different.