Abstract:
A carry-look-ahead adder for adding an addend and an augend and generating a final sum. The addend, augend, and final sum are binary numbers, each having a plurality of bits. Bits of the same order in the addend and the augend are organized into columns. The adder has at least one data reduction stage, each data reduction stage having at least one multi-column full adder. The data reduction stages use the columns of addend and augend bits to generate a reduced addend and a reduced augend, with the reduced augend having fewer bits than the augend. A generate/propagate calculation stage then uses the reduced addend and the reduced augend for calculating generate and propagate data, the generate/propagate calculation stage having been modified to account for the reduction of the addend and augend. A carry-generate stage then uses the generate and propagate data to generate at least one final carry. Finally, a final sum calculation stage uses the reduced addend, the reduced augend, and the final carries for calculating the final sum. The data reduction stages reduce the inputs to the generate/propagate calculation stage thereby reducing the number of inputs to the carry-generate circuit. With fewer inputs, the number of stages in the carry-generate circuit can be reduced, thus resulting in a faster implementation of the carry-look-ahead adder.
Abstract:
A branch prediction technique which increases the likelihood of correctly predicting the direction of a conditional branch instruction is presented. The technique is based on the observation that many branches have run lengths that are constant or slowly-varying, i.e. several consecutive runs of 1's are of the same length. The technique uses the history stored for each branch, which history is enhanced by two small counters (102, 113), an up counter (102) and a down counter (113). These counters (102, 113) operate in conjunction with a state machine branch predictor (101) of the prior art for very accurate predictions.
Abstract:
A carry-save adder for use in a binary multiplier with a reduced number of full adder stages. The carry-save adder is summing columns of binary data and is implemented with a plurality of one-bit (30) and two-bit (60) full adders. The one-bit (30) and two-bit (60) full adders are configured in a plurality of interconnected modified Wallace-Tree adders, each Wallace-Tree adder for summing binary data bits from one or more columns and generating a partial sum (74) and a partial carry (76). Each modified Wallace-Tree adder has a plurality of stages (70, 110, 130, 150) comprising one-bit (30) and two-bit (60) full adders for reducing the number of the binary data bits, the last stage (36, 122, 142, 162) comprising a single one-bit full adder (36, 122, 142, 162) for generating the partial sum (74) and the partial carry results (76). A plurality of conductors interconnects the stages of each modified Wallace-Tree adder with stages in the same Wallace-Tree adder and with stages in other modified Wallace-Tree adders.
Abstract:
A method and apparatus coupled to broadcast signals, such as television signals, and a television set (16) for displaying broadcast programs and channels. The apparatus displays broadcast programs on selected channels to a viewer, marks one or more of the programs in response to a first signal from the viewer, marks one or more of the channels in response to a second signal from the viewer, stores signals corresponding to the marked programs and channels; and sequentially displays the marked programs and channels in response to a third signal from the viewer. The apparatus displays a plurality of icons (51-58) on the screen, sequentially moves an icon cursor (42) from one icon to another icon in response to a first signal from a television viewer to point to one icon at a time, and displays text associated with the pointed icon only.
Abstract:
An intuitively operated Electronic Program Guide (EPG) which presents program guide information in table form at two levels of resolution. Schedule information is presented in icon form (500) over a long time window while textual information (510) is presented for a viewer-selected time slot. The selected time slot may appear to be a magnified representation (512) of the long time window view. In this way, a television screen of conventional resolution may present at least five hours of schedule information for eight channels. The viewer may operate the Electronic Program Guide (EPG) intuitively with simple remote control commands.
Abstract:
An architecture (200) for distributing digital information to subscriber units (202) wherein selection from among multiple digital services is accomplished by transmitting a tuning command from a subscriber unit to an intermediate interface (206). The intermediate interface (206) selects the desired service from a broadband network and transmits it to the subscriber unit (202) over a bandwidth-constrained access line. The bandwidth-constrained access line may be implemented with existing infrastructure, yet the subscriber unit (202) may access a wide variety of digital information available on the broadband network. Universal broadband access is thus provided at low cost. Output bandwidth of broadcast equipment may also be optimized.
Abstract:
Apparatus for detecting and executing trapping program instructions in a superscalar processor operating on a plurality of pipelined instructions includes a fetch stage for fetching consecutive instructions from an instruction cache (210) or from main memory, an instruction FIFO memory (220) for storing fetched instructions from the fetch stage, and an instruction decode stage (230) for removing instructions from the FIFO memory (220) in accordance with relative ages of instructions stored in the FIFO memory (220). The decode stage examines instructions removed from the FIFO memory (220) for trapping conditions, and flushes all younger instructions from the FIFO memory (220) in response to identification of a trap in an instruction. The decode stage (230) distinguishes between hardware traps and software traps. A software trapping instruction is forwarded to an execute stage for execution. The decode stage (230) immediately causes the fetch address to be changed to the appropriate trap handler address.
Abstract:
A counter system has a first counter (1) seeded by several input signals and a second counter (2) seeded by at least a first output from the first counter. A selection signal is input to the second counter to select the use of either an interleaved count sequence or a sequential count sequence.