Abstract:
An underlayer (8A) of a magnetic recording medium (16) includes first and second non-magnetic, chromium-based layers (18, 20), at least one of the first and second chromium-based layers being a chromium alloy. The lattice parameter of the composite underlayer is between the lattice parameters of the first and second chromium-based layers. Recognizing this permits one to predictably adjust the lattice parameter of the composite underlayer to be close to the lattice parameter of the magnetic layer (10) so to optimize magnetic and parametric properties.
Abstract:
The present invention provides a novel nonvolatile Flash EEPROM array design which allows for array, block or sector erase capabilities. The relatively simple transistor design layout of the present invention allows small portions of the EEPROM array to be erased without affecting data stored in the remaining portion of the array. In addition, given the block structured layout of the Flash EEPROM array, adjacent blocks in the array can share transistor control circuitry, thus minimizing the size of the array. The novel nonvolatile Flash EEPROM array preferably comprises a plurality of blocks which comprise a plurality of sectors of NOR-gate transistors. Each transistor has a drain, a source, and a control gate. Preferably, the drains of each transistor in a column are electrically coupled, the control gates of each transistor in a row are electrically coupled, and the sources of all the transistors in a sector are electrically coupled. A sector of the nonvolatile Flash EEPROM array preferably comprises 8 rows and 512 columns of transistors and a block preferably comprises 128 vertically stacked sectors.
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 hierarchical word line driving structure uses a shared inverter circuit architecture which allows for lower power consumption and a pulsed control signal to ensure accurate memory retrieval. The shared inverter word line structure includes a row decoder, a first sub-word line driver, a second sub-word line driver, and an interconnect line. The first sub-word line driver includes an inverting circuit for inverting the signal propagating along the global word line, while the second sub-word line driver does not. The interconnect line is coupled between the first and second sub-word line drivers to communicate the inverted signal therebetween. A pulsed control signal is supplied to clamping transistors connected to unselected word lines to ensure they remain clamped to ground.
Abstract:
A method and apparatus are disclosed for providing data (200) over data broadcasting systems to specially targeted audiences (202, 204). In accordance with the invention, user classifications may be obtained for a plurality of data users. The classifications for a predetermined data content may also be obtained. Once the user and programming content classifications are obtained, the predetermined data content, the regular content, and a mapping means are transmitted to multiple user reception units over separate transmission services. The mapping means indicates when the individual reception units are to switch automatically to the predetermined data content from the regular data content (210, 212, 214, 216), and may be configured in accordance with the user classifications and the predetermined data content so that each user obtains and is presented with the predetermined programming content that substantially matches the user's classifications.
Abstract:
A method and apparatus are disclosed for providing data over data broadcasting systems to specially targeted audiences. In accordance with the invention, user classifications may be obtained for a plurality of data users. The classifications for a predetermined data content may also be obtained. Once the user and programming content classifications are obtained, the predetermined data content, the regular data content, and a mapping means are transmitted to multiple user reception units over separate transmission services. The mapping means indicates when the individual reception units are to switch automatically to the predetermined data content from the regular data content, and may be configured in accordance with the user classifications and the predetermined data content classifications so that each user obtains and is presented with the predetermined programming content that substantially matches that user's classifications.
Abstract:
A variable rate correlation circuit (fig.3) for conserving power includes a variable clock source (340), a local PN source (360), and a correlator (320). The local PN source (360) further includes a local generator (361) and a resampler (364). The variable clock source (340) provides a normal clock rate and a lower clock rate. The local generator (361) supplies the local PN sequence at the normal clock rate. The resampler (364) receives the local PN sequence sampled at the normal clock rate and output the local PN sequence sampled at the lower clock rate. The correlator (320) receives the lower sampled local PN sequence, the received PN sequence, and the lower clock rate signal, correlating the received and local PN sequences at the lower clock rate to produce a correlated result.
Abstract:
A method and apparatus are disclosed for locating desired television programs and categories of television programs. To facilitate viewer access to preferred programming, program guide information of an electronic program guide may be searched in accordance with viewer-specified or system default parameters. Viewer-specified parameters illustratively include program names, partial program names, categories of programming, and subcategories of programming. Once the search is complete, a means is provided for displaying information on television programs in the categories, or with titles, that match the television program titles or categories of interest.
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-look-ahead adder (30) for adding an addend (4) and an augend (6) and generating a final sum (8). 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 (38) and a reduced augend (40), with the reduced augend having fewer bits than the augend. A generate/propagate calculation stage (34) then uses the reduced addend and the reduced augend for calculating generate (42) and propagate data (44), the generate/propagate calculation stage having been modified to account for the reduction of the addend and augend. A carry-generate stage (36) then uses the generate and propagate data to generate at least one final carry (48). 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.