Generating A Particular Pattern/sequence Of Addresses Patents (Class 711/217)
-
Patent number: 8140824Abstract: A computer program product comprises a computer useable medium having a computer readable program for authentication of code, such as boot code. A memory addressing engine is employable to select a portion of a memory, as a function of a step value, as a first input hash value. The step value allows for the non-commutative cumulative hashing of a plurality of memory portions with a second input hash value, such as a previous hash value that has been rotated left. An authenticator circuit is employable to perform a hash upon the portion of memory and the second input hash value. A comparison circuit is then employable to compare an output of the authenticator circuit to an expected value.Type: GrantFiled: March 15, 2007Date of Patent: March 20, 2012Assignee: International Business Machines CorporationInventor: David J. Craft
-
Publication number: 20120030447Abstract: A wireless communications device (110) has a digital section (800) and a radio frequency section (840). The digital section (800) does setup and execution on a set of data in at least first and second threads concurrently in a series of overlapping iterations by dividing the set of data into at least two different subsets and concurrently reading and writing in both subsets. A state machine (1010, 1100) is shared by the setup and execution iterations. Two or more memory units (930, 940) segregate the set of data, the predetermined size of the set of data in the memories (930, 940) combined comprehending the total number of addresses occupied by the set of data utilized in operation of circuitry (910). Dirty bits (1430) are accessible at addresses corresponding to addresses in the memory. A selector circuit (1412) has a selector output selectively coupled to an address line, and to a data line.Type: ApplicationFiled: September 1, 2011Publication date: February 2, 2012Applicant: TEXAS INSTRUMENTS INCORPORATEDInventors: Tonmoy Shingal, Chakravarthy Srinivasan, Shankaranarayana Karantha
-
Patent number: 8108651Abstract: A programmable signal processing circuit is used to (de-)interleave a data stream. Data from the signal stream is stored in a data memory (28) and read in a different sequence. The programmable signal processing circuit is used for computing addresses, for use in said storing and/or reading. The programmable signal processing circuit has an instruction set that contains an instruction to compute the addresses from preceding addresses that have been used for said storing and/or reading. In response to the instruction the programmable signal processing circuit permutes positions of a plurality of bits from the old address operand and forms of a bit of the new address result as a logic function of a combination of bits from the old address operand. Successive addresses are formed by means of repeated execution of a program loop that contains an address update instruction for computing the addresses.Type: GrantFiled: December 13, 2005Date of Patent: January 31, 2012Assignee: Silicon Hive B.V.Inventors: Paulus W. F. Gruijters, Marcus M. G. Quax, Ingolf Held
-
Patent number: 8099638Abstract: The disclosure relates to a programmable virtual memory client, that includes programmable control logic configured to generate at least one data pattern sequence from a number of stored data patterns. Additionally, the virtual memory client includes virtual memory client control logic configured to use the generated at least one data pattern sequence to at least one of read from and write to at least one memory device. A method includes generating at least one data pattern sequence from a number of stored data patterns and writing and reading the data pattern sequence from and to a memory device.Type: GrantFiled: November 12, 2004Date of Patent: January 17, 2012Assignee: ATI Technologies ULCInventors: Sagheer Ahmad, Eric Scott, Joe Macri, Dan Shimizu
-
Patent number: 8095767Abstract: Techniques for providing arbitrary precision floating number (APFN) processing are disclosed. In some aspects, an APFN store may be used to store a large number (i.e., an APFN) having many significant digits, which in turn may enable a high degree of precision in mathematical operations. An APFN module may be used to create and define the APFN store. The APFN module may enable a user to define a precision (significant digits) for the large number that corresponds to the size of an array of bytes in the APFN store that are allocated for storing the large number. In further aspects, the APFN store may be used to store additional intermediary data and a resultant.Type: GrantFiled: December 30, 2008Date of Patent: January 10, 2012Assignee: Microsoft CorporationInventors: Xu Yang, Hao Wei, Gong Cheng, ZhangZhang Song, Dongmei Zhang, Jian Wang
-
Publication number: 20120005455Abstract: A device for storing data includes a sequence generator configured to generate a first number sequence that is a pseudorandom number sequence, a cross-correlation unit configured to produce a second number sequence that is a cross-correlation between the first number sequence and a third number sequence, and a write and read unit configured to write the second number sequence in memory and read the second number sequence from the memory, wherein the cross-correlation unit is further configured to reconstruct the third number sequence by obtaining a cross-correlation between the first number sequence and the second number sequence read from the memory.Type: ApplicationFiled: July 2, 2010Publication date: January 5, 2012Applicant: EMPIRE TECHNOLOGY DEVELOPEMENT LLCInventor: Tomoaki Ueda
-
Publication number: 20110314251Abstract: Concepts and technologies are described herein for determining memory safety of floating-point computations. The concepts and technologies described herein analyze code to determine if any floating-point computations exist in the code, and if so, if the floating-point computations are memory safe. The analysis can include identifying floating-point instructions and conditional statements in the code. The code can be symbolically executed, and behavior of the floating-point instructions and the conditional statements can be monitored to determine if a floating point calculation is ever involved in computation of any memory address during the execution of the code.Type: ApplicationFiled: June 17, 2010Publication date: December 22, 2011Applicant: Microsoft CorporationInventors: Patrice Godefroid, Johannes Kinder
-
Patent number: 8074026Abstract: A scatter/gather technique optimizes unstructured streaming memory accesses, providing off-chip bandwidth efficiency by accessing only useful data at a fine granularity, and off-loading memory access overhead by supporting address calculation, data shuffling, and format conversion.Type: GrantFiled: May 10, 2006Date of Patent: December 6, 2011Assignee: Intel CorporationInventors: Daehyun Kim, Christopher J. Hughes, Yen-Kuang Chen, Partha Kundu
-
Patent number: 8074010Abstract: An intelligent memory bank for use with interleaved memories storing plural vectors comprises setup apparatus (96) receives an initial address (B+C+V+NMSK) and spacing data (D) for each vector. Addressing logic (90) associates a memory cell select (C) to each initial and subsequent address of each of the plurality of vectors. Cell select apparatus (98) accesses a memory cell (in 92) using a memory cell select (C) associated to a respective one of the initial and successive addresses of each vector.Type: GrantFiled: July 7, 2010Date of Patent: December 6, 2011Assignee: Efficient Memory TechnologyInventor: Maurice L. Hutson
-
Patent number: 8074050Abstract: An address space expansion method implemented by the electronic device which includes a storage unit, wherein the storage unit includes a first storage unit and a second storage unit, comprising: responding to the user operation to generate a target address; determining whether a address range of the target address is less than or equal to a predetermined address range, and generating a corresponding control signal; enabling the first storage unit or the second storage unit according to the generated corresponding control signal; acquiring a physical address corresponding to the target address and providing the physical address to the enabled storage unit according to the corresponding control signal and a predetermined converting rule; accessing and performing a reading/writing operation for data corresponding to the physical address of the enabled storage unit.Type: GrantFiled: July 22, 2009Date of Patent: December 6, 2011Assignee: Hon Hai Precision Industry Co., Ltd.Inventor: Chen-Huang Fan
-
Patent number: 8069304Abstract: A network device determines the presence of the pre-specified string in a message based on a sequence matching rule. A sequence represents non-contiguous portions of the message. A combination of content addressable memory, programmable processing units, and the programmable control unit may determine the presence of the pre-specified string in the message by comparing the non-contiguous portions of the message. Such an approach may reduce the computational resources required for searching the pre-specified string in the message.Type: GrantFiled: September 6, 2007Date of Patent: November 29, 2011Assignee: Intel CorporationInventors: Murukanandam Kamalam Panchalingam, Nithish Mahalingam
-
Patent number: 8069311Abstract: A method includes detecting a cache miss. The method further includes, in response to detecting the cache miss, traversing a plurality of linked memory nodes in a memory storage structure being used to store data to determine if the memory storage structure is a binary tree. The method further includes, in response to determining that the memory storage structure is a binary tree, prefetching data from the memory storage structure. An associated machine readable medium is also disclosed.Type: GrantFiled: December 28, 2007Date of Patent: November 29, 2011Assignee: Intel CorporationInventor: Mingqiu Sun
-
Patent number: 8051272Abstract: A method for generating addresses for a processor is provided. The addresses are for use by an application that may be executed by the processor. The application comprises a plurality of instructions, and each instruction comprises at least one line. The method includes storing a plurality of predetermined addresses and, for each line of each instruction, generating at least one address for the processor based on the predetermined addresses.Type: GrantFiled: September 15, 2006Date of Patent: November 1, 2011Assignee: Samsung Electronics Co., Ltd.Inventor: Eran Pisek
-
Patent number: 8050355Abstract: A transmitter using pseudo-orthogonal code includes a serial-to-parallel converter for converting serial transmission data into 9-bit parallel data, and a pseudo-orthogonal code memory for receiving the parallel data from the serial-to-parallel converter and outputting 16-bit pseudo-orthogonal code by using the received data as addresses. The pseudo-orthogonal code memory has the relationship of the input address and output code, as expressed in the following equation: c(i)=0.5×((?1)b2?(i1b1)?(i0b0) (?1)b5?i2?(i1b4)?(i0b3) (?1)b8?i3?(i1b7)?(i0b6) (?1)( b2?b5?b8)?i3?i2?(i1(b1?b4?b7))?(i0(b0?b3?b6))) where C(i) is a pseudo-orthogonal code value, i is each bit of the pseudo-orthogonal code, 0?i?15, and b0-b8 are a transmission data bit stream input in the memory as addresses. Accordingly, the transmission efficiency of the transmitter/receiver using orthogonal code can be remarkably improved.Type: GrantFiled: June 11, 2008Date of Patent: November 1, 2011Assignee: Korea Electronics Technology InstituteInventors: Jin Woong Cho, Yong Seong Kim, Do Hun Kim, Sun Hee Kim, Dae Ki Hong
-
Patent number: 8041919Abstract: A method of storing data blocks onto sectors of a storage device comprises determining a specific number n of blocks, where n is greater than 1, storing n blocks consecutively onto consecutive sectors, such that each block begins directly after the previous block ends, repositioning the storing at the beginning of the next sector, and storing a further n blocks consecutively onto consecutive sectors, such that each block begins directly after the previous block ends.Type: GrantFiled: October 21, 2008Date of Patent: October 18, 2011Assignee: International Business Machines CorporationInventors: Carl D. Kambites, Ronald J. Venturi
-
Patent number: 8028148Abstract: Aspects of the present invention are directed at centrally managing the allocation of memory to executable images in a way that inhibits malware from identifying the location of the executable image. Moreover, performance improvements are implemented over traditional systems that enable relative addressed instruction to be resolved at runtime. In this regard, a method is provided that identifies a randomized location to load the executable image into a memory address space. Then, data that may be used to resolve the relative addressed instruction is loaded and maintained in memory. At runtime when pages that store relative addressed instructions are accessed, an arithmetic operation is performed to resolve the relative addressed instruction. As a result, only those relative addressed instructions on pages accessed during program execution are resolved.Type: GrantFiled: September 6, 2006Date of Patent: September 27, 2011Assignee: Microsoft CorporationInventors: Richard Shupak, Landy Wang
-
Patent number: 8026921Abstract: A table-based driving circuit for displays that switches between a normal operational mode and a read table block mode. The driving circuit comprises an address sequencer and a memory. The memory comprises the full table of individual sequences, such as interlacing or color-sequential sequence. In the read table mode, the next upcoming addresses are read, i.e. are downloaded, from the memory into an address table register in the address sequencer. In the normal operational mode, the address sequencer generates the addresses for the video data to be stored in the memory or to be displayed.Type: GrantFiled: August 6, 2003Date of Patent: September 27, 2011Assignee: Trident Microsystems (Far East) Ltd.Inventor: Rob Anne Beuker
-
Patent number: 8028149Abstract: A method of reading a group of memory words from an integrated circuit memory of a contactless tag, comprising the sending by a remote interrogation unit to the contactless tag of a specific command for reading the group of memory words from a given start address, the initialization of an address counter for the contactless tag to the value of the given start address, and the sending by the contactless tag of the memory word at the start address, as well as an iterative process comprising in succession a first step of sending by the remote interrogation unit to the contactless tag of an incrementation marker recognizable by the contactless tag, a second step of incrementation of the address counter for the contactless tag in response to the incrementation marker, and a third step of sending by the contactless tag to the remote interrogation unit of a data frame comprising the memory word stored in the memory at the address pointed at by the current value of the address counter.Type: GrantFiled: May 18, 2005Date of Patent: September 27, 2011Assignee: STMicroelectronics SAInventors: Christophe Moreaux, Pierre Rizzo
-
Patent number: 8015460Abstract: One or more embodiments of the invention enable a memory device to load its memory array with desired background data, such as to reduce total test time and costs associated with testing. A background data loading circuit according to one embodiment of the invention includes a buffer, a data loading circuit, and a pattern generating logic. The buffer is coupled to the array of memory cells. The data loading circuit is coupled to load data into the buffer to be transferred to a respective row of the memory cells. The pattern generating logic is coupled to the data loading circuit. The pattern generating logic applies a pattern generating algorithm corresponding to a test mode when the memory devices is in the test mode and generates patterns of data each for a respective row of the memory cells according to the pattern generating algorithm.Type: GrantFiled: April 7, 2008Date of Patent: September 6, 2011Assignee: Micron Technology, Inc.Inventor: Terry Grunzke
-
Patent number: 8015389Abstract: An image memory, image memory system, and memory controller that are capable of efficiently accessing a rectangular area of two-dimensionally arrayed data are provided. The memory device has: a memory cell array that has a plurality of memory unit areas, each of which is selected by addresses; a plurality of input/output terminals; and an input/output unit provided between the memory cell array and the plurality of input/output terminals.Type: GrantFiled: December 19, 2007Date of Patent: September 6, 2011Assignee: Fujitsu Semiconductor LimitedInventors: Takahiko Sato, Toshiya Uchida, Tatsuya Kanda, Tetsuo Miyamoto, Satoru Shirakawa, Yoshinobu Yamamoto, Tatsushi Otsuka, Hidenaga Takahashi, Masanori Kurita, Shinnosuke Kamata, Ayako Sato
-
Publication number: 20110208945Abstract: Testing a circuit in a post-silicon stage is performed by enabling the different processing entities of the circuit to determine a consistent access permissions schema in a random manner. Based upon the consistent access permissions schema, addresses to be accessed during the testing of the circuit may be determined. The addresses may be determined in a random manner. The consistent permissions schema may be determined based on a template representative of repetitive portions of access permissions schema. The disclosed subject matter may utilize biasing modules to bias the test generation to provide a test having a predetermined characteristic. The disclosed subject matter may utilize a joint random seed or other techniques to provide for consistent random decisions by the different processing entities.Type: ApplicationFiled: February 22, 2010Publication date: August 25, 2011Applicant: International Business Machines CorporationInventors: Allon Adir, Gil Shurek
-
Publication number: 20110197037Abstract: A method for accessing a downgrade memory and a downgrade memory apparatus are provided. The downgrade memory apparatus comprises at least one management unit and a controller. The management unit comprises a plurality of blocks, each block having a plurality of pages, and each page having a plurality of sectors, the downgrade memory having a plurality of non-accessible sectors. The controller is configured to parse a write command corresponding to a special block, to select at least one accessible sector according to a status information of the special block and to program the write command to the special block, wherein the status information indicates at least one non-accessible sector in the special block. Thereby the method and the apparatus of downgrade memory may as well omit the non-accessible sectors as enhance the usage memory capacity in accordance with the status information.Type: ApplicationFiled: April 22, 2011Publication date: August 11, 2011Applicant: SILICONMOTION INC.Inventor: Wu-Chi Kuo
-
Patent number: 7996645Abstract: Data is written to a hard disk drive using shingled writing principles, i.e., each data track is partially overwritten when an immediately contiguous data track is written. One or more contiguous data tracks establish a band, and a band establishes a respective segment in a log-structured file system.Type: GrantFiled: September 29, 2003Date of Patent: August 9, 2011Assignee: Hitachi Global Storage Technologies Netherlands B.V.Inventors: Richard M. H. New, Mason Lamar Williams
-
Patent number: 7996620Abstract: A cache memory high performance pseudo dynamic address compare path divides the address into two or more address segments. Each segment is separately compared in a comparator comprised of static logic elements. The output of each of these static comparators is then combined in a dynamic logic circuit to generate a dynamic late select output.Type: GrantFiled: September 5, 2007Date of Patent: August 9, 2011Assignee: International Business Machines CorporationInventors: Yuen H. Chan, Ann H. Chen, Kenneth M. Lo, Shie-ei Wang
-
Patent number: 7996203Abstract: A method, system, and computer program product are provided for verifying out of order instruction address (IA) stride prefetch performance in a processor design having more than one level of cache hierarchies. Multiple instruction streams are generated and the instructions loop back to corresponding instruction addresses. The multiple instruction streams are dispatched to a processor and simulation application to process. When a particular instruction is being dispatched, the particular instruction's instruction address and operand address are recorded in the queue. The processor is monitored to determine if the processor executes fetch and prefetch commands in accordance with the simulation application. It is checked to determine if prefetch commands are issued for instructions having three or more strides.Type: GrantFiled: January 31, 2008Date of Patent: August 9, 2011Assignee: International Business Machines CorporationInventors: Wei-Yi Xiao, Dean G. Bair, Christopher A. Krygowski, Chung-Lung K. Shum
-
Publication number: 20110173383Abstract: Methods of operating a memory system are useful in facilitating access to data. Where repetitive data patterns are detected among portions of received data, and an indication is provided, a portion of the data may be stored and/or subsequently retrieved without having to store and/or retrieve, respectively, all portions of the data.Type: ApplicationFiled: March 28, 2011Publication date: July 14, 2011Inventor: Sergey Anatolievich Gorobets
-
Publication number: 20110161559Abstract: Systems and methods are disclosed to improve the performance of a memory system by freeing up physical memory areas that correspond to logical block address ranges that have repeated data patterns. A controller detects data patterns in incoming data. When a data pattern is detected, the data is not written to non-volatile storage area. Rather, the logical block address range of the data is marked in a data structure as having pattern data. The pattern may also be recorded in the data structure as a pattern descriptor. Because the data having the data pattern is not written to the non-volatile storage area, the freed up corresponding physical memory area may be utilized by the memory system for other purposes, thereby improving the overall performance and endurance of the memory system.Type: ApplicationFiled: December 31, 2009Publication date: June 30, 2011Inventors: Damian P. Yurzola, Sergei A. Gorobets, Neil D. Hutchison, Eran Erez
-
Patent number: 7970981Abstract: In one aspect, a method of writing data in a flash memory system is provided. The flash memory system forms an address mapping pattern according to a log block mapping scheme. The method includes determining a writing pattern of data to be written in a log block, and allocating one of SLC and MLC blocks to the log block in accordance with the writing pattern of the data.Type: GrantFiled: February 6, 2007Date of Patent: June 28, 2011Assignee: Samsung Electronics Co., Ltd.Inventors: Won-Moon Cheon, Seon-Taek Kim, Chan-Ik Park, Sung-up Choi
-
Patent number: 7954015Abstract: An apparatus for producing a word of a de-interleaved sequence of bits from a sequence of bits stored in a memory is described. In one embodiment, the apparatus includes a read circuit for selecting bits of the stored sequence and forming the selected bits into a word, and a logic network arranged to produce the word of the de-interleaved sequence by concatenating sections of a plurality of words produced by the read circuit. The technique can also be used to achieve interleaving, rather than de-interleaving, of a data sequence.Type: GrantFiled: December 5, 2008Date of Patent: May 31, 2011Assignee: Altera CorporationInventor: Kulwinder Dhanoa
-
Patent number: 7953955Abstract: A systematic approach to architecture and design of the instruction fetch mechanisms and instruction set architectures in embedded processors is described. This systematic approach allows a relaxing of certain restrictions normally imposed by a fixed-size instruction set architecture (ISA) on design and development of an embedded system. The approach also guarantees highly efficient usage of the available instruction storage which is only bounded by the actual information contents of an application or its entropy. The result of this efficiency increase is a general reduction of the storage requirements, or a compression, of the instruction segment of the original application. An additional feature of this system is the full decoupling of the ISA from the core architecture. This decoupling allows usage of a variable length encoding for any size of the ISA without impacting the physical instruction memory organization or layout and branching mechanism as well as tuning of the execution core to the application.Type: GrantFiled: December 14, 2010Date of Patent: May 31, 2011Assignee: Altera Corporation.Inventors: Sergei Yurievich Larin, Gerald George Pechanek, Thomas M. Conte
-
Patent number: 7934074Abstract: A flash memory controller on a PCIE bus controls flash-memory modules on a flash bus. The flash-memory modules are plane-interleaved using interleaved bits extracted from the lowest bits of the logical block index. These plane-interleave bits are split into a LSB and a MSB, with middle physical block bits between the LSB and MSB. A physical sequential address counter generates a physical block number by incrementing the plane-interleave bits before the middle physical block bits, and then relocating the MSB to above the middle physical block bits. This causes blocks to be accessed in a low-high sequence of 0, 1, 4096, 4097, 2, 3, 4098, 4099, etc. in the four planes of flash memory. A RAM physical page valid table tracks valid pages in the four planes, while a RAM mapping table stores the plane, block, and page addresses for logical sectors generated by the physical sequential address counter.Type: GrantFiled: October 11, 2007Date of Patent: April 26, 2011Assignee: Super Talent ElectronicsInventors: Charles C. Lee, Frank Yu, Ming-Shiang Shen, Abraham C. Ma, David Q. Chow
-
Publication number: 20110078409Abstract: A single instruction, multiple data (“SIMD”) computer system includes a central control unit coupled to 256 processing elements (“PEs”) and to 32 static random access memory (“SRAM”) devices. Each group of eight PEs can access respective groups of eight columns in a respective SRAM device. Each PE includes a local column address register that can be loaded through a data bus of the respective PE. A local column address stored in the local column address register is applied to an AND gate, which selects either the local column address or a column address applied to the AND gate by the central control unit. As a result, the central control unit can globally access the SRAM device, or a specific one of the eight columns that can be accessed by each PE can be selected locally by the PE.Type: ApplicationFiled: September 27, 2010Publication date: March 31, 2011Inventor: Jon Skull
-
Patent number: 7916048Abstract: A method an apparatus is provided to generate a gray code sequence from a sequence of binary values having a length “L”. Accordingly, one aspect of the present invention provides a circuit comprising a cycle flag toggle circuit configured to toggle a cycle flag between a first value and a second value, an intermediate value generator coupled to an output of the cycle flag toggle circuit configured to receive the binary value, and configured to generate an intermediate value from the cycle flag and the binary value, and a binary to gray converter coupled to an output of the intermediate value generator, configured to convert the intermediate value to a gray code.Type: GrantFiled: February 3, 2010Date of Patent: March 29, 2011Assignee: International Business Machines CorporationInventors: Jayashri A. Basappa, Anil Pothireddy, David G. Wheeler
-
Publication number: 20110035566Abstract: A technique for generating a list of all N-bit unsigned binary numbers by starting with an initial number less than some power of 2, successively multiplying the number by that power of 2 and adding the largest non-negative number less than that power of 2 such that the new number is not a duplicate of any of those already generated, and using the resulting lists to generate efficient hashing and serial decoding hardware and software.Type: ApplicationFiled: October 18, 2010Publication date: February 10, 2011Applicant: OC APPLICATIONS RESEARCH LLCInventor: Laurence H. Cooke
-
Patent number: 7886205Abstract: Verifying operation of a data processing system. A first sequence of addressing ranges is generated for multiple requesters. Each addressing range includes a start and an end address and a respective identifying number. A second sequence of verification ranges is generated corresponding the addressing ranges of the first sequence. Each verification range includes a start and an end address and specifies at least one allowed value including each respective identifying number of all of the addressing ranges that overlap the verification range. A respective accessing activity executing on each requestor accesses each addressing range in the first sequence. The accesses include writing the respective identifying number of the addressing range to at least one address of the addressing range. A verification activity executing on a requestor reads a value from each address of each verification range of the second sequence and outputs an error message in response to the value not matching the allowed value.Type: GrantFiled: June 24, 2008Date of Patent: February 8, 2011Assignee: Unisys CorporationInventors: Michelle J. Lang, Joseph B. Lang, legal representative, William Judge Yohn
-
Patent number: 7882509Abstract: The persistent binding of STP SAS addresses to SATA devices is disclosed so that SATA devices can be moved to different insertion points (ports) within a SAS expander and still properly receive I/O requests. When a SATA device is inserted into the SAS expander, it is interrogated to obtain information about the attached device. This information may be combined using a hashing function to obtain a unique ID for the SATA device. A table can be used to assign a STP SAS address to the Phy connected to the device based in the unique ID. In this manner, the same STP SAS address will be assigned to the Phy connected to a particular SATA device, regardless of where the device is connected to the SAS expander.Type: GrantFiled: June 29, 2007Date of Patent: February 1, 2011Assignee: Emulex Design & Manufacturing CorporationInventors: Marc Timothy Jones, Curtis Edward Nottberg, Kevin Dale Bowman
-
Patent number: 7865692Abstract: A systematic approach to architecture and design of the instruction fetch mechanisms and instruction set architectures in embedded processors is described. This systematic approach allows a relaxing of certain restrictions normally imposed by a fixed-size instruction set architecture (ISA) on design and development of an embedded system. The approach also guarantees highly efficient usage of the available instruction storage which is only bounded by the actual information contents of an application or its entropy. The result of this efficiency increase is a general reduction of the storage requirements, or a compression, of the instruction segment of the original application. An additional feature of this system is the full decoupling of the ISA from the core architecture. This decoupling allows usage of a variable length encoding for any size of the ISA without impacting the physical instruction memory organization or layout and branching mechanism as well as tuning of the execution core to the application.Type: GrantFiled: January 26, 2006Date of Patent: January 4, 2011Assignee: Altera Corp.Inventors: Sergei Yurievich Larin, Gerald George Pechanek, Thomas M. Conte
-
Patent number: 7849284Abstract: A message memory (1) with a flexible association between the message-object memories of the message memory (2) and the segments of a physical memory (3). The association is made through configuration, wherein one or more memory segments form a cluster as a function of the length of the message content to be stored.Type: GrantFiled: May 10, 2004Date of Patent: December 7, 2010Assignee: NXP B.V.Inventor: Peter Fuhrmann
-
Patent number: 7836504Abstract: The present invention provides a system, method, and computer-readable medium for identifying malware that is loaded in the memory of a computing device. Software routines implemented by the present invention track the state of pages loaded in memory using page table access bits available from a central processing unit. A page in memory may be in a state that is “unsafe” or potentially infected with malware. In this instance, the present invention calls a scan engine to search a page for malware before information on the page is executed.Type: GrantFiled: March 1, 2005Date of Patent: November 16, 2010Assignee: Microsoft CorporationInventors: Kenneth D Ray, Michael Kramer, Paul England, Scott A Field
-
Patent number: 7831800Abstract: A processor system (100) includes a central processing unit (102) and a prefetch engine (110). The prefetch engine (110) is coupled to the central processing unit (102). The prefetch engine (110) is configured to detect, when data associated with the central processing unit (102) is read from a memory (114), a stride pattern in an address stream based upon whether sums of a current stride and a previous stride are equal for a number of consecutive reads. The prefetch engine (110) is also configured to prefetch, for the central processing unit (102), data from the memory (114) based on the detected stride pattern.Type: GrantFiled: May 17, 2007Date of Patent: November 9, 2010Inventor: Andrej Kocev
-
Patent number: 7822944Abstract: Systems and methods for optimizing random access retrieval of a requested data item in a radio frequency identification (RFID) tag are provided. During random access retrieval, a first read of a memory bank in the RFID tag is performed. The first read providers a set of identifier indices stored in a packed object in the memory bank of the RFID tag and a length of the packed object. A determination is then made whether a retrieved identifier index represents the requested data item to be retrieved. A second read of the memory bank, accessing the portion of the memory bank including the data items, is then performed. The location of the data item in the packed object may optionally be determined prior to the second read.Type: GrantFiled: May 29, 2007Date of Patent: October 26, 2010Assignee: Symbol Technologies, Inc.Inventor: Frederick Schuessler
-
Patent number: 7818538Abstract: A serial decoding technique may employ one or more circular shift register strings in which an input to an element of a shift register string may be gated by either an address input or the inverse of the address input. An output word line of the decoder may be driven by a respective shift register stage in the case of a single shift register string, or by a logical combination of shift register stages from respective shift register strings in the case of multiple shift register strings.Type: GrantFiled: August 27, 2008Date of Patent: October 19, 2010Inventor: Laurence H. Cooke
-
Patent number: 7814294Abstract: An image memory, image memory system, and memory controller that are capable of efficiently accessing a rectangular area of two-dimensionally arrayed data are provided. The memory device has: a memory cell array that has a plurality of memory unit areas, each of which is selected by addresses; a plurality of input/output terminals; and an input/output unit provided between the memory cell array and the plurality of input/output terminals.Type: GrantFiled: January 26, 2007Date of Patent: October 12, 2010Assignee: Fujitsu Semiconductor LimitedInventors: Takahiko Sato, Toshiya Uchida, Tatsuya Kanda, Tetsuo Miyamoto, Satoru Shirakawa, Yoshinobu Yamamoto, Tatsushi Otsuka, Hidenaga Takahashi, Masanori Kurita, Shinnosuke Kamata, Ayako Sato
-
Memory controller and method for multi-path address translation in non-uniform memory configurations
Patent number: 7793034Abstract: In a method of translating a physical memory address to a device address in a device memory space, a fast address translate of the physical memory address, adapted to translate addresses in uniformly configured device memory space, is performed thereby generating a first translated address. A full address translate of the physical memory address, adapted to translate addresses in non-uniformly configured device memory space, is also performed thereby generating a second translated address. Boundaries of a uniform portion of the device memory space are identified, to which the physical memory address is compared to determine if the physical memory address is in the uniform portion of the device memory space. When the physical memory address is in the uniform portion, the first translated address is selected as the device address. Otherwise, the second translated address is selected.Type: GrantFiled: November 5, 2007Date of Patent: September 7, 2010Assignee: International Business Machines CorporationInventors: Brian D. Allison, Joseph A. Kirscht, Elizabeth A. McGlone -
Patent number: 7774577Abstract: An image memory, image memory system, and memory controller that are capable of efficiently accessing a rectangular area of two-dimensionally arrayed data are provided. The memory device has: a memory cell array that has a plurality of memory unit areas, each of which is selected by addresses; a plurality of input/output terminals; and an input/output unit provided between the memory cell array and the plurality of input/output terminals.Type: GrantFiled: December 19, 2007Date of Patent: August 10, 2010Assignee: Fujitsu Semiconductor LimitedInventors: Takahiko Sato, Toshiya Uchida, Tatsuya Kanda, Tetsuo Miyamoto, Satoru Shirakawa, Yoshinobu Yamamoto, Tatsushi Otsuka, Hidenaga Takahashi, Masanori Kurita, Shinnosuke Kamata, Ayako Sato
-
Publication number: 20100199070Abstract: A programmable filter processor which is adaptable to different filtering algorithms, a plurality of different software algorithms being executable, the programmable filter processor including a logic unit which includes a plurality of pipeline stages; a first memory in which the software algorithms are stored; a second memory in which raw data and parameters for the different filter algorithms are stored; and an address generating unit which is controllable via a program counter, the address generating unit being developed to generate control commands for the second memory and the logic unit.Type: ApplicationFiled: July 8, 2008Publication date: August 5, 2010Inventors: Stephen Schmitt, Juergen Mallok, Juergen Hanisch
-
Publication number: 20100191932Abstract: Provided are an address generation apparatus and method of an interleaver/deinterleaver. By calculating coefficients of an address generator polynomial of an interleaver by determining exponents according to the number of prime factors forming a length of input data of the interleaver and generating an address of the deinterleaver using the calculated coefficients, errors generated when the address of the deinterleaver is generated can be removed, and right interleaver and deinterleaver addresses can be calculated.Type: ApplicationFiled: March 21, 2008Publication date: July 29, 2010Applicants: Eletronics and Telecommunications Research Institute, Samsung Electronics Co., Ltd.Inventors: Nam-Il Kim, Young-Jo Ko, Young-Hoon Kim
-
Patent number: 7761667Abstract: A mechanism is provided that identifies instructions that access storage and may be candidates for catch prefetching. The mechanism augments these instructions so that any given instance of the instruction operates in one of four modes, namely normal, unexecuted, data gathering, and validation. In the normal mode, the instruction merely performs the function specified in the software runtime environment. An instruction in unexecuted mode, upon the next execution, is placed in data gathering mode. When an instruction in the data gathering mode is encountered, the mechanism of the present invention collects data to discover potential fixed storage access patterns. When an instruction is in validation mode, the mechanism of the present invention validates the presumed fixed storage access patterns.Type: GrantFiled: August 12, 2008Date of Patent: July 20, 2010Assignee: International Business Machines CorporationInventors: Christopher Michael Donawa, Allan Henry Kielstra
-
Patent number: 7707384Abstract: A memory processing approach involves implementation of memory status-driven access. According to an example embodiment, addresses received at an address buffer are processed for access to a memory relative to an active location in the memory. Addresses corresponding to an active location in the memory array are processed prior to addresses that do not correspond to an active location. Data is read from the memory to a read buffer and ordered in a manner commensurate with the order of received addresses at the address buffer (e.g., thus facilitating access to the memory in an order different from that received at the address buffer while maintaining the order from the read buffer).Type: GrantFiled: May 7, 2007Date of Patent: April 27, 2010Assignees: The Massachusetts Institute of Technology University, The Board of Trustees of the Leland Stanford Junior UniversityInventors: William J. Dally, Scott W. Rixner
-
Patent number: RE42684Abstract: A content addressable memory (CAM) is provided that can perform wide word searches. At least one CAM memory core having a plurality of bit pattern entry rows is included in the CAM. In addition, search logic is included that, is capable searching particular rows during each cycle. The search logic is also capable of allowing match line results of unsearched rows to remain unchanged during a cycle. The CAM further includes a serial AND array in communication with the bit pattern entry rows, wherein the serial AND array is capable of computing a match result for wide word entries that span multiple bit pattern entry rows. In one aspect, a match line enable signal is provided to the serial AND array, which facilitates computation of the match result.Type: GrantFiled: February 14, 2007Date of Patent: September 6, 2011Assignee: Core Networks LLCInventors: Jason Edward Podaima, Sanjay Gupta, Randall Gibson, Radu Avramescu