Incrementing, Decrementing, Or Shifting Circuitry Patents (Class 711/219)
-
Publication number: 20040117596Abstract: A hardware assisted searching mechanism is provided that offloads the processor from searching operations. In a preferred embodiment, the hardware assisted searching mechanism performs a binary search of an associated 32 bit register against a binary search table that is set up by the firmware of the storage system. From this binary search table, an index into other structures stored in firmware is obtained that may be used to identify a target device. For example, when a search is to be performed due to receipt of an I/O operation, the firmware, i.e. software instructions stored in the persistent memory chip that are executed by the system processor, writes a 32 bit value to a hardware register that is used by the hardware assisted searching mechanism of the present invention. The hardware assisted searching mechanism performs a binary search of a binary search table based on the contents of the hardware register and returns an index of the entry in another hardware register.Type: ApplicationFiled: December 11, 2002Publication date: June 17, 2004Inventors: Russell J. Henry, Bret S. Weber, Dennis E. Gates, John R. Kloeppner, Keith William Holt
-
Publication number: 20040117595Abstract: A system and method for calculating memory addresses in a partitioned memory in a processing system having a processing unit, input and output units, a program sequencer and an external interface. An address calculator includes a set of storage elements, such as registers, and an arithmetic unit for calculating a memory address of a vector element dependent upon values stored in the storage elements and the address of a previous vector element. The storage elements hold STRIDE, SKIP and SPAN values and optionally a TYPE value, relating to the spacing between elements in the same partition, the spacing between elements in the consecutive partitions, the number of elements in a partition and the size of a vector element, respectively.Type: ApplicationFiled: September 8, 2003Publication date: June 17, 2004Inventors: James M. Norris, Philip E. May, Kent D. Moat, Raymond B. Essick, Brian G. Lucas
-
Patent number: 6748509Abstract: A memory component, on a single integrated circuit, operated as a slave to an external master, includes a RAM, one or more configuration registers, data formatting logic, and associated control logic. The behavior of the memory component, and in particular the selection of a burst transfer format, is controllable via configuration register bits in the one or more configuration registers. Specifically, based on a format selection specified by the configuration bits, the control logic determines the sequence-length of the data transfers between the RAM and the external master. Other than the sequence-length, the data is not otherwise altered during the data transfers.Type: GrantFiled: December 20, 2001Date of Patent: June 8, 2004Assignee: Intel CorporationInventors: Daniel Litaize, Jean-Claude Salinier, Abdelaziz Mzoughi, Fatima-Zahra Elkhlifi, Mustapha Lalam, Pascal Sainrat
-
Patent number: 6745314Abstract: A circular buffer control circuit, a method of controlling a circular buffer and a digital signal processor (DSP) incorporating the circuit or the method. In one embodiment, the circuit includes: (1) address calculation logic, having multiple datapaths, that calculates, from data regarding a buffer operation, an updated address result therefor and (2) modification order determination circuitry, coupled in parallel with the address calculation logic, that transmits a memory access request and the updated address result in an order that is based on whether the buffer operation is pre-modified or post-modified.Type: GrantFiled: November 26, 2001Date of Patent: June 1, 2004Assignee: LSI Logic CorporationInventor: Shannon A. Wichman
-
Patent number: 6745147Abstract: A data processing system, method, and computer program product for automatically tracking insertions of integrated circuit devices into receptacle devices. An insertion of an integrated circuit device is automatically detected utilizing the data processing system. An insertion count that is associated with the integrated circuit device is automatically incremented in response to a detection of an insertion of the integrated circuit device. The insertion count is used to track insertions of the integrated circuit device.Type: GrantFiled: October 4, 2001Date of Patent: June 1, 2004Assignee: International Business Machines CorporationInventors: George Henry Ahrens, Jr., Susan L. Caunt, Alongkorn Kitamorn, Leo C. Mooney
-
Patent number: 6745299Abstract: A system and method of evaluating cache coherency protocols and algorithms in scalable symmetric multiple processor computer systems. The system includes scalable 32-byte or larger cache lines wherein one specific byte in the cache line is assigned for write and read transactions for each specific 32-bit processor. The method includes steps to ensure each 32-bit processor writes and reads to and from the specific byte in the cache line assigned to that 32-bit processor.Type: GrantFiled: November 19, 2001Date of Patent: June 1, 2004Assignee: Hewlett-Packard Development Company, L.P.Inventors: Robert D. Bushey, Kelly Larson
-
Publication number: 20040088518Abstract: A memory access system is described which generates two memory addresses from a single memory access instruction which identifies a register holding at least two packed objects. In the preferred embodiment, the contents of a base register is combined respectively with each of two or more packed objects in an offset register.Type: ApplicationFiled: October 29, 2003Publication date: May 6, 2004Applicant: Broadcom CorporationInventor: Sophie Wilson
-
Patent number: 6732252Abstract: A memory interface device of the present invention includes: an input buffer including a plurality of input areas; an output buffer including a plurality of output areas; and a control section for controlling the input buffer, the output buffer and a single port memory. The control section controls the input buffer and the single port memory so as to transfer a signal stored in one of the input areas of the input buffer to the single port memory while storing an input signal in another one of the input areas of the input buffer. The control section controls the output buffer and the single port memory so as to output as an output signal a signal stored in one of the output areas of the output buffer while transferring a signal stored in the single port memory to another one of the output areas of the output buffer.Type: GrantFiled: July 16, 2002Date of Patent: May 4, 2004Assignees: Matsushita Electric Industrial Co., Ltd., Texas Instruments IncorporatedInventors: Yoichiro Miki, Masahiro Tani, Kazuki Ninomiya, Naoya Tokunaga, Kenta Sokawa, Hiroshi Miyaguchi, Yuji Yaguchi, Tsuyoshi Akiyama, Kenya Adachi
-
Publication number: 20040083350Abstract: A method and system for accessing a specified cache line using previously decoded base address offset bits, stored with a register file, which eliminate the need to perform a full address decode in the cache access path, and to replace the address generation adder multiple level logic with only one level of rotator/multiplexer logic. The decoded base register offset bits enable the direct selection of the specified cache line, thus negating the need for the addition and the decoding of the base register offset bits at each access to the cache memory. Other cache lines are accessed by rotating the decoded base address offset bits, resulting in a selection of another cache word line.Type: ApplicationFiled: October 29, 2002Publication date: April 29, 2004Applicant: International Business Machines Corp.Inventor: David Arnold Luick
-
Patent number: 6725298Abstract: A method of managing ring-buffer memory space in a digital signal processor when processing a filter, includes releasing ring-buffer memory space previously reserved for ring-buffer data upon completing a filter process and determining that the ring-buffer data stored in said ring-buffer memory space is no longer necessary after the filter-process is carried out.Type: GrantFiled: June 19, 2000Date of Patent: April 20, 2004Assignee: NEC Electronics CorporationInventor: Yutaka Hiratani
-
Patent number: 6721867Abstract: The invention relates to memory processing in a microprocessor. The microprocessor comprises a memory indicated by means of alignment boundaries for storing data, at least one register for storing data used during calculation, memory addressing means for indicating the memory by means of the alignment boundaries and for transferring data between the memory and the register, and a hardware shift register, which can be shifted with the accuracy of one bit, and which comprises a data loading zone and a guard zone. The memory addressing means transfer data including a memory addressing which cannot be fitted into the alignment boundary between the memory and the register through the data loading zone in the hardware shift register, and the hardware shift register is arranged to process data using shifts and utilizing the guard zone.Type: GrantFiled: April 19, 2002Date of Patent: April 13, 2004Assignee: Nokia Mobile Phones, Ltd.Inventor: Aki Launiainen
-
Publication number: 20040064674Abstract: A sum decoder is disclosed including multiple sum predecoders, a carry generator, and multiple rotate logic units. Each sum predecoder receives multiple bit pairs of non-overlapping segments of a first and second address signal, and produces an input signal dependent upon the bit pairs. The carry generator receives a lower-ordered portion of the first and second address signals, and generates multiple carry signals each corresponding to a different one of the sum predecoders. Each rotate logic unit receives the input signal produced by a corresponding sum predecoders and a corresponding one of the carry signals, rotates the bits of the input signal dependent upon the carry signal, and produces either the input signal or the rotated input signal as an output signal. A memory is described including the sum decoder, a final decode block, and a data array. The final decode block performs logical operations on the output signals of the sum decoder to produce selection signals.Type: ApplicationFiled: September 30, 2002Publication date: April 1, 2004Applicant: International Business Machines CorporationInventors: Toru Asano, Sang Hoo Dhong, Joel Abraham Silberman, Osamu Takahashi
-
Patent number: 6711494Abstract: A data formatter includes a shift register and a pointer manager. The shift register receives data from a providing RAM and shifts that data in response to reading data from the providing RAM and writing data to a receiving FIFO. A pointer manager maintains a pointer that points to a first valid byte in a sub-block of data into the correct bytes lanes of the FIFO by moving the pointer as data is shifted into and out of the shift register.Type: GrantFiled: November 30, 2001Date of Patent: March 23, 2004Assignee: Emulex CorporationInventors: Eric Peel, Bradley Roach, Qing Xue
-
Patent number: 6708264Abstract: A synchronous memory device includes a prefetch address counter. The address counter is composed of an n number of one-bit counter circuits, an n number of adders to which the output signals of these counters are supplied respectively, and an adder control circuit for controlling each adder. A start address is externally supplied to each of the one-bit counter circuits, which in turn count up. When the addressing mode is the sequential mode and the start address is an odd address, each adder performs addition according to the state of the even control signal outputted from the adder control circuit. With the addition, the address outputted from each one-bit counter circuit is inverted, but otherwise the same signal as the address outputted from each one-bit counter circuit is outputted.Type: GrantFiled: June 14, 2000Date of Patent: March 16, 2004Assignee: Kabushiki Kaisha ToshibaInventors: Katsumi Abe, Hiroyuki Ohtake
-
Publication number: 20040049652Abstract: The present invention provides a memory architecture allowing for instructions of variable length to be stored without wasted memory spaces. Instructions of one, two, and three bytes can all be retrieved in a single fetch. The exemplary embodiment divides the memory block into two ×16 memories having some special addressing circuitry. This structure logically arranges the memory into a number of rows, each of four byte-wide columns. To the first of these ×16 memories, the full address is provided. If the address is within the two columns of the second ×16 memory, the full address is also provided to the second ×16 memory. If the address is to the first of the ×16 memories, the second ×16 memory instead receives the portion of the address specifying the row with one added to it. This results in a dual row access with the last one or two bytes of 3-byte instruction being supplied by the row above the first byte.Type: ApplicationFiled: September 8, 2003Publication date: March 11, 2004Inventors: Bruce L. Troutman, Russell B. Lloyd, Randal Q. Thornley
-
Patent number: 6704857Abstract: The ManArray processor is a scalable indirect VLIW array processor that defines two preferred architectures for indirect VLIW memories. One approach treats the VIM as one composite block of memory using one common address interface to access any VLIW stored in the VIM. The second approach treats the VIM as made up of multiple smaller VIMs each individually associated with the functional units and each individually addressable for loading and reading during XV execution. The VIM memories, contained in each processing element (PE), are accessible by the same type of LV and XV Short Instruction Words (SIWs) as in a single processor instantiation of the indirect VLIW architecture. In the ManArray architecture, the control processor, also called a sequence processor (SP), fetches the instructions from the SIW memory and dispatches them to itself and the PEs. By using the LV instruction, VLIWs can be loaded into VIMs in the SP and the PEs.Type: GrantFiled: December 22, 2000Date of Patent: March 9, 2004Assignee: PTS CorporationInventors: Edwin Frank Barry, Gerald G. Pechanek
-
Patent number: 6701422Abstract: A memory controller includes an incrementer for predicting a next address to be asserted by a processor. The incrementer, structurally a counter, is configurable to wrap at a wrap boundary and to indicate when a predicted address crosses a page boundary if the memory is in page mode. This incrementer provides accurate predictions even where successor addresses are on different pages or, in the case of address loops, even in some cases in which the successor address is not consecutive. Thus, the number of accurate address predictions is increased, enhancing overall performance. The invention has particular applicability to signal processing applications with instructions loops that cross one or more page boundaries.Type: GrantFiled: March 29, 2001Date of Patent: March 2, 2004Assignee: Koninklijke Philips Electronics N.V.Inventor: Liewei Bao
-
Patent number: 6701423Abstract: An address sequencer circuit for generating addresses for accessing a memory device. The address sequencer includes a plurality of address stages that are coupled together, and also includes a first clock generation circuit that receives an input clock and generates a first clock signal that is coupled to a first portion of the address stages. A second clock generation circuit is provided that receives the input clock and a toggle signal and generates a second clock signal that is coupled to a second portion of the address stages, thereby allowing the first and second portions of address stages to be clocked at different rates.Type: GrantFiled: July 30, 2001Date of Patent: March 2, 2004Assignee: Fujitsu LimitedInventor: Takao Akaogi
-
Publication number: 20040034757Abstract: Methods and systems provide for the fusing of multiple operations into a single micro-operation (uop). A method of decoding a macro-instruction provides for transferring data relating to a first operation from the macro-instruction to a uop. The uop is to be executed by an execution system of a processor. The method further provides for transferring data relating to a second operation from the macro-instruction to the uop.Type: ApplicationFiled: August 13, 2002Publication date: February 19, 2004Applicant: INTEL CORPORATIONInventors: Simcha Gochman, Ittai Anati, Zeev Sperber, Robert Valentine
-
Patent number: 6694420Abstract: An address range checking circuit capable of determining if a target address, A[M:0], is within an address space having 2N address locations beginning at a base address location, B[M:0], is disclosed, wherein the address range checking circuit does not require a large comparator circuit.Type: GrantFiled: December 5, 2001Date of Patent: February 17, 2004Assignee: STMicroelectronics, Inc.Inventor: Lun Bin Huang
-
Patent number: 6691219Abstract: The present invention provides an 8-bit microcontroller capable of supporting expanded addressing capability in one of three address modes. The microcontroller operates in either the traditional 16-bit address mode, a 24-bit paged address mode or in a 24-bit contiguous address mode based on the setting of a new Address Control (ACON) Special Function Register (SFR). The 24-bit paged address mode is binary code compliant with traditional compilers for the standard 16-bit address range, but allows for up to 16M bytes of program memory and 16M bytes of data memory to be supported via a new Address Page (AP) SFR, a new first extended data pointer (DPX) SFR and a new second extended data pointer (DPX1) register. The 24-bit contiguous mode requires a 24-bit address compiler that supports contiguous program flow over the entire 24-bit address range via the addition of an operand and/or cycles to either basic instructions.Type: GrantFiled: August 7, 2001Date of Patent: February 10, 2004Assignee: Dallas Semiconductor CorporationInventors: Edward Tangkwai Ma, Frank V. Taylor, III, Stephen N. Grider, Wendell L. Little
-
Patent number: 6687782Abstract: A ROM is provided with sufficient input address terminals for receipt of a unique address for each data storage location, even though the number of ROM input addresses exceeds the capacity of the processor and address bus. A dual mode read operation includes a random address mode for randomly accessing the ROM and a sequential address mode for accessing sequentially stored data strings at a high access rate. A first portion of the bus addresses are allocated as random reading mode bus addresses, the bus addresses having direct correspondence with ROM addresses. Other bus addresses are allocated as sequential reading mode bus addresses for addressing the ROM in sequential ROM address order for reading data. Successive output by the processor of the same sequential reading mode bus address effects application to the ROM of sequentially numbered ROM addresses. The first numbered address of the plurality of the sequential ROM address string is loaded as data into at least one counter.Type: GrantFiled: April 10, 2001Date of Patent: February 3, 2004Assignee: Snap-On Technologies, Inc.Inventor: James M. Normile
-
Patent number: 6684315Abstract: A method and system for purging translation lookaside buffers (TLB) of a computer system are described. Directed write transactions can be used to avoid deadlock and avoid the need for additional bridge buffers. Broadcast emulation can be achieved by linking the nodes in a doubly-linked list and having neighboring nodes notify each other of changes in TLB entries.Type: GrantFiled: January 22, 2002Date of Patent: January 27, 2004Assignee: Apple Computer, Inc.Inventors: David V. James, Donald N. North
-
Patent number: 6681313Abstract: In a system for conducting virtual address translation in a virtual memory system and implementing a table such as a Translation Lookaside Buffer, a system and method enabling quicker access to tables entries in which the entries are addressed after adding a plurality of address parts wherein the plurality is two (2) or (3). Particularly, a smaller and/or faster adder is used having, for example, only n=2 ports in the time critical path. In order to make the exact address calculation, during array accesses, a multiplexor is implemented to decide, after the TLB arrays are accessed for preselection, which of a plurality of possible entries has to be taken.Type: GrantFiled: May 8, 2000Date of Patent: January 20, 2004Assignee: International Business Machines CorporationInventors: Son Dao Trong, Luis Parga Cacheiro, Rolf Sautter, Hans-Werner Tast
-
Patent number: 6678816Abstract: Method for producing a predetermined length page memory pointer record, according to a selected page size and a selected page address, the method including the procedures of: determining a dynamic location of a separator bit within the page memory pointer record, according to the selected page size and an initial page size, the initial page size being respective of the smallest page size in a given memory system, writing a predetermined value to the dynamic location, writing a sequence of values opposite to the predetermined value to selected page size bits of the page memory pointer record, when the selected page size is different than the initial page size, and writing the selected page address to selected page address bits of the page memory pointer record.Type: GrantFiled: May 19, 2003Date of Patent: January 13, 2004Assignee: Intel CorporationInventors: Ronny Ronen, Andrew F. Glew, Maury J. Bach, Robert Valentine, Richard A. Uhlig, Opher D. Kahn
-
Publication number: 20040006680Abstract: A system and method for rapidly generating a series of non-repeating, deterministic, pseudo-random addresses is disclosed. A deterministic, pseudo-random number generator is implemented in hardware. Once a number in a pseudo-random sequence is generated, a pattern eliminator alters the number to remove any pattern existing in the low order bits. The number may then be combined with an offset and a base to form a memory address for testing a memory device. The generated memory address is output directly to the memory device being tested.Type: ApplicationFiled: June 28, 2002Publication date: January 8, 2004Inventor: Kevin Duncan
-
Publication number: 20040003199Abstract: A memory interface device (100) providing a fractional address interface between a data processor (104) and a memory system (102) and a method for retrieving intermediate data values from a memory system using fractional addressing. The device includes an address generator (108) for generating first and second memory addresses, the first memory address being less than or equal to a specified fractional address, the second memory address being greater than or equal to the fractional address. The device also includes a memory access unit (110) coupled to the address generator (108) for retrieving first and second data values from the memory system (102) at the first and second memory addresses, respectively. The device also includes a data access unit (112) for interpolating between the first and second data values and passing the interpolated value to the data processor (104).Type: ApplicationFiled: June 28, 2002Publication date: January 1, 2004Inventors: Philip E. May, Kent Donald Moat, Raymond B. Essick, Silviu Chiricescu, Brian Geoffrey Lucas, James M. Norris, Michael Allen Schuette, Ali Saidi
-
Publication number: 20040003179Abstract: The present invention realizes pre-fetch based on a high-accuracy prediction. A plurality of address values are registered in advance in a pre-fetch address queue, based on previous memory accesses. If a request address from the processor unit of a request address register matches this address value, a pre-fetch address obtained by adding a block size to the request address is output to a secondary cache as a pre-fetch request. This pre-fetch address is written back into the pre-fetch address queue.Type: ApplicationFiled: February 20, 2003Publication date: January 1, 2004Applicant: Fujitsu LimitedInventors: Yuji Shirahige, Tsuyoshi Motokurumada, Masaki Ukai, Aiichiro Inoue
-
Patent number: 6670895Abstract: Methods and apparatus are provided for use in digital information processors that support digital memory buffers. In one aspect of the present invention, a digital signal processor receives a swap instruction and responds to the swap instruction by swapping the contents of a first address register and a second address register. In another aspect, a digital signal processor receives a swap instruction, swaps the contents of a first address register and a second address register in a future file, generates and sends one or more control signals to an architecture file in a downstream stage of a pipeline in response to the swap instruction, and swaps the contents of the first address register and the second address register in the architecture file in response to the one or more control signals.Type: GrantFiled: May 1, 2002Date of Patent: December 30, 2003Assignee: Analog Devices, Inc.Inventor: Ravi Pratap Singh
-
Publication number: 20030233525Abstract: Systems and methods for backup of data in redundant data storage systems. In this regard, one embodiment can be broadly summarized by a representative system that copies a block of data from a primary storage unit to a primary backup storage unit using a primary addressing sequence that begins with a first start address; and substantially concurrently copies a second block of data from a secondary storage unit to a secondary backup storage unit using a secondary addressing sequence that begins with a second start address.Type: ApplicationFiled: June 18, 2002Publication date: December 18, 2003Inventor: Jay D. Reeves
-
Patent number: 6665768Abstract: An apparatus and method for accessing data in a processing system are described. The system includes multiple processing elements for executing program instructions. The processing system can be a single instruction stream, multiple data stream (SIMD) system, and the processing elements can be the multiple data paths of the SIMD system. Each processing element or data path is associated with an identifying value which distinguishes it from the other elements. A memory, which can be configured as an interleaved memory including multiple memory banks, stores data accessed by the processing elements. The data can be a table used for table look-ups for such functions as mathematical operations. Also, multiple copies of the table can be stored in multiple respective banks of the memory. An instruction calling for a memory access such as a table look-up is received. The instruction contains address information which can be a starting address of a table in memory.Type: GrantFiled: October 12, 2000Date of Patent: December 16, 2003Assignee: ChipWrights Design, Inc.Inventor: John L. Redford
-
Publication number: 20030229769Abstract: One embodiment of the present invention provides a system that accesses a desired element during execution of a program. During operation, the system receives a reference to the desired element. The system determines if the reference is an internal reference to a location in a local package that is currently executing, or an external reference to a location in an external package. If the reference is an external reference, the system uses an index component of the reference to lookup an address for the desired element in a global reference table. Next, the system uses the address to access the desired element. Note that the address retrieved from the global reference table is larger than the reference, which allows the address to access a larger address space than is possible to access with the reference alone.Type: ApplicationFiled: June 7, 2002Publication date: December 11, 2003Inventor: Oscar A. Montemayor
-
Patent number: 6654871Abstract: A method and a device for performing stack operations within a processing system. A first and second stack pointers point to a top of a stack and to a memory location following the top of the stack. A first stack pointer is used during pop operations and a second stack pointer is used during push operations. When a stack pointer is selected, it replaces the other stack pointer. The selected memory pointer is provided to a memory module in which a stack is implemented, and is also updated. When a pop operation is executed the updated stack pointer points to a memory location preceding a memory location pointed by the selected stack pointer and when a push operation is executed the updated stack pointer points to a memory address following that address.Type: GrantFiled: November 9, 1999Date of Patent: November 25, 2003Assignee: Motorola, Inc.Inventors: Fabrice Aidan, Yoram Salant, Mark Elnekave, Leonid Tsukerman
-
Patent number: 6647484Abstract: The present invention provides a register-indirect addressing mode using modulo arithmetic to transpose addresses for digital processing systems. The preferred systems and methods permit direct access of column data, which improves matrix computation significantly. The overhead of transpose mode is minimal because it can be implemented, if desired, by sharing hardware and/or software used in circular buffers. Transpose addressing mode also reduces program size and processor power consumed by reducing the sequence of instruction cycles.Type: GrantFiled: September 19, 2000Date of Patent: November 11, 2003Assignee: 3 DSP CorporationInventors: Chongjun June Jiang, Kan Lu, Chung Tao-Chang
-
Patent number: 6647482Abstract: Method for producing a predetermined length page memory pointer record, according to a selected page size and a selected page address, the method including the procedures of: determining a dynamic location of a separator bit within the page memory pointer record, according to the selected page size and an initial page size, the initial page size being respective of the smallest page size in a given memory system, writing a predetermined value to the dynamic location, writing a sequence of values opposite to the predetermined value to selected page size bits of the page memory pointer record, when the selected page size is different than the initial page size, and writing the selected page address to selected page address bits of the page memory pointer record.Type: GrantFiled: April 7, 2000Date of Patent: November 11, 2003Assignee: Intel CorporationInventors: Ronny Ronen, Andrew F. Glew, Maury J. Bach, Robert C. Valentine, Richard A. Uhlig, Opher D. Kahn
-
Patent number: 6643760Abstract: The present invention provides a memory architecture allowing for instructions of variable length to be stored without wasted memory spaces. Instructions of one, two, and three bytes can all be retrieved in a single fetch. The exemplary embodiment divides the memory block into two ×16 memories having some special addressing circuitry. This structure logically arranges the memory into a number of rows, each of four byte-wide columns. To the first of these ×16 memories, the full address is provided. If the address is within the two columns of the second ×16 memory, the full address is also provided to the second ×16 memory. If the address is to the first of the ×16 memories, the second ×16 memory instead receives the portion of the address specifying the row with one added to it. This results in a dual row access with the last one or two bytes of 3-byte instruction being supplied by the row above the first byte.Type: GrantFiled: April 30, 2001Date of Patent: November 4, 2003Assignee: ZiLog, Inc.Inventors: Bruce L. Troutman, Russell B. Lloyd, Randal Q. Thornley
-
Patent number: 6643761Abstract: An address generation unit (AGU) and a digital signal processor (DSP) including such an AGU are disclosed. The AGU (3) has a register file (4) providing order (R), stage (S), and displacement (N) values to a digital addressing unit (DAU) (5) for performing one of eight addressing operations. The register file provides an input (X) to the DAU and receives an output (Y) from the DAU. Within the DAU (5), selection multiplexers (13, 14) select full adder outputs to provide Y, or bit-select from adders and the input (X) to provide Y. For a radix-4 operation, most significant bits (MSBs) are taken from the input (X), middle bits are taken from the output of a first adder (adder1), and the least significant bits (LSBs) are taken from the output of a second adder (adder2) if there is a carry out from the first adder. The AGU may also include bit reverse blocks connected at both the input and output of an adder.Type: GrantFiled: September 8, 2000Date of Patent: November 4, 2003Assignee: Massana Research LimitedInventors: Vincent Berg, Christopher Bleakley, Brian Murray, Jose Rodriguez
-
Patent number: 6633966Abstract: FIFO type memory is provided on a small circuit scale. Reading of data Dout<3:0> from a two-port type RAM (101) is executed with respect to the address specified by a read address (21) in synchronization with the fall of a clock (CLK) provided to a clock end (CLR). Writing of data Din<3:0> on the RAM (101) is executed with respect to the address specified by a write address (22) in synchronization with the rise of a clock (CLK) provided to a clock end (CLW). In an address delayer (103) after a read address (21) taking an address value is outputted, a write address (22) taking the same address value is always outputted with a fixed delay, so that a memory (100) performs the FIFO type data input/output as a whole.Type: GrantFiled: October 22, 1998Date of Patent: October 14, 2003Assignee: Mitsubishi Denki Kabushiki KaishaInventor: Masayuki Koyama
-
Publication number: 20030188125Abstract: A dual-cycle address generation unit is described to generate linear addresses. The dual-cycle address generation unit includes a first adder to add a product of an index and a scaling factor to an offset and a segment base during a first clock cycle and a second adder to add output of the first adder with a base during a second clock cycle.Type: ApplicationFiled: March 28, 2002Publication date: October 2, 2003Inventors: Ross A. Segelken, Feng Chen, David J. Sager
-
Patent number: 6629190Abstract: A memory including a plurality of memory word lines and a sequential addressing circuit is provided. The sequential addressing circuit comprises at least one sequential shift register including at least one logic gate and at least one word flag cell for each of the word lines. Enablement of each memory word line depends upon the state of the word flag cell. An enable or access bit is shifted sequentially through the sequential. addressing circuit to select each of the word lines. The enable or access bit selectively bypasses or skips a word line depending on the state of its corresponding word flag cell. A method for accessing a nonvolatile writeable memory is also described. The method comprises determining at least one non-operational or defective memory bit cell of a nonvolatile writeable memory. At least one word line of the nonvolatile writeable memory is masked out, wherein the at least one word line is coupled to the at least one non-operational operational memory bit cell.Type: GrantFiled: March 5, 1998Date of Patent: September 30, 2003Assignee: Intel CorporationInventor: Phillip E. Mattison
-
Patent number: 6622232Abstract: A memory that supports non-aligned memory accesses includes a field address generator circuit, multiple field memories, and a data rotation circuit. The field address generator circuit generates multiple field addresses in response to an address associated with a memory access. Each field memory receives one of the field addresses from the field address generator circuit. The data rotation circuit rotates data associated with the memory access based upon the memory access address to support a non-aligned access. The memory can support either non-aligned read accesses or non-aligned write accesses. A method for performing non-aligned read or write memory accesses is also described.Type: GrantFiled: May 18, 2001Date of Patent: September 16, 2003Assignee: Intel CorporationInventor: Jacob J. Schroeder
-
Publication number: 20030172246Abstract: Logic for circular addressing providing increased compatibility with higher-level programming languages accesses a base pointer pointing to a first element of an array including a number of elements each including an address. The first element of the array includes an address less than the address of every other element of the array. The logic accesses a base-pointer offset, adds the base-pointer offset to the base pointer to calculate an address of a current element of the array, and stores the calculated address for subsequent access by one or more operations. After the current element has been accessed by the one or more operations, the logic increments the base-pointer offset by one, accesses a maximum offset value equal to the number of elements of the array, and compares the incremented base-pointer offset with the maximum offset value. If the incremented base-point offset is less than the maximum offset value, the logic stores the incremented base-pointer offset.Type: ApplicationFiled: January 22, 2003Publication date: September 11, 2003Inventor: Alexander Tessarolo
-
Publication number: 20030167372Abstract: A semiconductor memory device including an array with a first memory cell block having redundancy blocks and a second memory cell block having normal blocks. A redundancy block in the first memory cell block is substituted for a defective normal block in the second memory cell block. The substitution is performed by a block selection circuit. When substitution is required, the block selection circuit selects from among the first memory cell blocks in inverse order, beginning with the first memory cell block having the highest address. First memory cell blocks that are not substituted for defective cell blocks are used as normal memory cell blocks by the block selection circuit.Type: ApplicationFiled: February 24, 2003Publication date: September 4, 2003Applicant: Samsung Electronics Co., Ltd.Inventor: Sung-Soo Lee
-
Patent number: 6611894Abstract: The present invention relates to a data retrieval apparatus for retrieving the data from a number of places of data stored in memories which adopts binary search method and enables high-speed retrieval operation. The apparatus includes three memories and address converting circuits. A logical address space is divided into 2 banks of a bank constituting a set of even number addresses and a bank constituting a set of odd number addresses. Further, in the case where in respect of one bank of the 2 banks and addresses are expressed by binary numbers, the one bank is divided into a bank constituting a set of addresses where an even number of bits of “1” are present and a bank constituting a set of addresses where an odd number of bits of “1” are present. A total of the 3 banks of the logical address space are mapped in a physical address space of 3 memories. A control device carries out retrieval of data stored in the memories by binary search method by using given key data.Type: GrantFiled: March 25, 1999Date of Patent: August 26, 2003Assignee: Kawasaki Microelectronics, Inc.Inventor: Ryuichi Onoo
-
Publication number: 20030149857Abstract: A reconfigurable parallel look-up table system includes a memory; a plurality of look-up tables stored in the memory; a row index register for holding the values to be looked up in the look-up tables; a column index register for storing a value representing the starting address of the look-up tables stored in the memory; and an address translation circuit responsive to the column index register and the row index register to simultaneously generate an address for each value in the row index register to locate in parallel the function of those values in each look-up table.Type: ApplicationFiled: April 24, 2002Publication date: August 7, 2003Inventors: Yosef Stein, Haim Primo
-
Patent number: 6604184Abstract: The present invention is a method and apparatus to map virtual memory space. A region register file provides a region identifier for a virtual address in the virtual memory space. The virtual address includes a virtual region number and a virtual page number. A virtual page table look-up circuit is coupled to the region register file to generate a page table entry (PTE) virtual address from virtual address parameters. The virtual address parameters include the virtual address.Type: GrantFiled: June 30, 1999Date of Patent: August 5, 2003Assignee: Intel CorporationInventors: Achmed R. Zahir, Gary N. Hammond, John H. Crawford
-
Publication number: 20030145188Abstract: A method for operating a memory device, the method comprising marking a portion of a memory device associated with a group of bits comprising at least one bit upon which an operation is to be performed, and operating on the group of bits and skipping operating on at least one unmarked portion of the memory device in an operation cycle of the memory device. A random access memory (RAM) device is also disclosed comprising a plurality of addresses for storing therein data, and at least one address pointer for at least one of the addresses in the RAM device.Type: ApplicationFiled: August 5, 2002Publication date: July 31, 2003Inventors: Zeev Cohen, Ran Dvir, Eduardo Maayan
-
Patent number: 6601158Abstract: According to one embodiment of the invention, an apparatus that includes a first and second counter both including a count computation circuit and an upper bound circuit. The output of the upper bound circuit of the first counter is coupled to the count computation circuit and upper bound circuit of the second counter. The apparatus also includes a lookup table addressed by the current count value of the first counter, as well as a combining circuit coupled to the output of the lookup table and to receive the current count value of the second counter.Type: GrantFiled: December 30, 1999Date of Patent: July 29, 2003Assignee: PMC-Sierra, Inc.Inventors: Curtis Abbott, Homayoun Shahri
-
Patent number: 6601157Abstract: There is disclosed a technique for accessing a register file which comprises defining a first register address as a plurality of bits and using said first register address to access said register file generating a second register address by using a sequence of said plurality of bits with at least one of said plurality of bits supplied via a unitary operator, the unitary operator being effective to selectively alter the logical value of said bit depending on its logical value in the first register address, and using said second register address to access said register file. A computer system for carrying out such a technique is also enclosed.Type: GrantFiled: November 1, 2000Date of Patent: July 29, 2003Assignee: Broadcom CorporationInventors: Mark Taunton, Sophie Wilson, Timothy Martin Dobson
-
Publication number: 20030135709Abstract: A method for processing requests or commands for writing and reading to and from memory that has not been allocated and reserved for one or more volumes, and a method for establishing one or more volumes, where the one or more volumes define an area of the memory that is accumulatively greater than the actual memory capacity, thus allowing for memory to be added at a later time.Type: ApplicationFiled: January 17, 2002Publication date: July 17, 2003Inventors: Ronald Steven Niles, Larry Louie