Byte-word Rearranging, Bit-field Insertion Or Extraction, String Length Detecting, Or Sequence Detecting Patents (Class 712/300)
  • Publication number: 20040019775
    Abstract: A pipeline video decoder and decompression system handles a plurality of separately encoded bit streams arranged as a single serial bit stream of digital bits and having separately encoded pairs of control codes and corresponding data carried in the serial bit stream. The pipeline system employs a plurality of interconnected stages to decode and decompress the single bit stream, including a start code detector. When in a search mode, the start code detector searches for a specific start code corresponding to one of multiple compression standards. The start code detector responding to the single serial bit stream generates control tokens and data tokens. A respective one of the tokens includes a plurality of data words. Each data word has an extension bit which indicates a presence of additional words therein. The data words are thereby unlimited in number.
    Type: Application
    Filed: January 26, 2001
    Publication date: January 29, 2004
    Inventors: Adrian P. Wise, Martin W. Sotheran, William P. Robbins, Anthony M. Jones, Helen R. Finch, Kevin J. Boyd, Anthony Peter J. Claydon
  • Patent number: 6671219
    Abstract: In a storage device from which n bits of data are read at a time, data pieces whose logical bit positions are 0*8+k, 1*8+k, 2*8+k, 3*8+k, . . . , m*8+k (where k and m are natural numbers satisfying 0≦k≦7, 0 ≦m≦n/8−1) are stored in memory cells close to one another in a memory cell array, and the bit positions are shifted by a predetermined number of bits when data having a small number of significant bits is read from the memory cell array.
    Type: Grant
    Filed: November 27, 2001
    Date of Patent: December 30, 2003
    Assignees: Hitachi, Ltd., Hitachi ULSI Systems Co., Ltd.
    Inventors: Yasuhisa Shimazaki, Tsuyoshi Koike, Makoto Mizoguchi
  • Patent number: 6671882
    Abstract: A translator for converting items of interactive program guide data to data structures that are more universal to handle with popular platforms, operating systems, tools, utilities and other hardware and software processors and resources. The invention uses C++ class objects and structures. The objects and structures are placed into a Common Object Request Broker Architecture (CORBA) “wrapper.” This allows the objects to be handled by platform-independent interfaces so that the system is easily adaptable to different hardware devices and software functionality. Aspects of the invention include the translation from custom IPG formats to CORBA-wrapped C++ objects, the storage of the objects, transmission of the objects among devices, and data entry and error handling of information represented by the objects.
    Type: Grant
    Filed: July 21, 1999
    Date of Patent: December 30, 2003
    Assignee: General Instrument Corporation
    Inventors: Pat Murphy, Cathy Crofts, Jason Mahan, Jeff Hopper, John Harrington, Chuck Datte
  • Patent number: 6671797
    Abstract: A data processing system is provided with a digital signal processor which has an instruction for expanding one bit to form a mask field. In one form of the instruction, a first bit from a two-bit mask in a source operand is replicated and placed in an least significant half word of a destination operand while a second bit from the two-bit mask in the source operand is replicated and placed in a most significant half word of the destination operand. In another form of the instruction, a first bit from a four bit mask in a source operand is replicated and placed in a least significant byte of a destination operand, a second bit from the four-bit mask in the source operand is replicated and placed in a second least significant byte of the destination operand, a third bit from the four-bit mask is replicated and placed in a second most significant byte of the destination operand and a fourth bit form the four-bit mask is replicated and placed in a most significant byte of the destination operand.
    Type: Grant
    Filed: October 31, 2000
    Date of Patent: December 30, 2003
    Assignee: Texas Instruments Incorporated
    Inventor: Jeremiah E. Golston
  • Patent number: 6665794
    Abstract: A device to change the ordering of datums in a packet from a storage device to a pre-determined ordering according to their addresses. The device has a first circuit to receive and process address information to determine a data ordering of data associated with the address information; and a second circuit to reorder the data into ordered packets in the predetermined ordering. This device can be used to efficiently transfer graphic data through the AGP bus in a computer.
    Type: Grant
    Filed: September 24, 2002
    Date of Patent: December 16, 2003
    Assignee: Intel Corporation
    Inventors: Altug Koker, Russell W. Dyer
  • Patent number: 6658561
    Abstract: The present invention is directed to a hardware device for parallel processing a determined instruction of a set of programmable instructions having a same format with an operand field defining the execution steps of the instruction corresponding to the execution of micro-instructions, comprising decision blocks (12—20) being each associated with a specific instruction of the set of programmable instructions, only one decision block being selected by the determined instruction in order to define which are the specific micro-instructions to be processed for executing the determined instruction, activation blocks (22-30) respectively associated with the decision blocks for running one or several specific micro-instructions, only the activation block associated with said selected decision block being activated to run the specific micro-instructions, and a micro-instruction selection block (46) connected to each activation block for selecting the specific micro-instructions to be executed.
    Type: Grant
    Filed: April 20, 2000
    Date of Patent: December 2, 2003
    Assignee: International Business Machines Corporation
    Inventors: Alain Benayoun, Jean-Francois Le Pennec, Claude Pin, Patrick Michel
  • Patent number: 6654874
    Abstract: Microcomputer systems include an instruction processor therein that can process both normal length instructions and compressed instructions. The normal length instructions and the compressed instructions are provided from memory to an instruction register and then passed through decoding circuitry to a processor core. The decoding circuitry preferably comprises a demultiplexer having a data input that receives a first multi-bit instruction from the instruction register and a select input that receives a first select signal (SEL1). A compressed instruction decoder is also provided. The compressed instruction decoder has a data input electrically coupled to a first data output of the demultiplexer and a select input that receives a second select signal (SEL2). A multiplexer is also provided.
    Type: Grant
    Filed: March 27, 2000
    Date of Patent: November 25, 2003
    Assignee: Samsung Electronics Co., Ltd.
    Inventor: Yun-Tae Lee
  • Publication number: 20030196078
    Abstract: A pipeline video decoder and decompression system handles a plurality of separately encoded bit streams arranged as a single serial bit stream of digital bits and having separately encoded pairs of control codes and corresponding data carried in the serial bit stream. The pipeline system employs a plurality of interconnected stages to decode and decompress the single bit stream, including a start code detector. When in a search mode, the start code detector searches for a specific start code corresponding to one of multiple compression standards. The start code detector responding to the single serial bit stream generates control tokens and data tokens. A respective one of the tokens includes a plurality of data words. Each data word has an extension bit which indicates a presence of additional words therein. The data words are thereby unlimited in number.
    Type: Application
    Filed: February 8, 2001
    Publication date: October 16, 2003
    Inventors: Adrian P. Wise, Martin W. Sotheran, William P. Robbins, Anthony M. Jones, Helen R. Finch, Kevin J. Boyd, Anthony Peter J. Claydon
  • Patent number: 6631466
    Abstract: A high-speed parallel pattern searching system is disclosed. The high-speed parallel pattern searching system allows the body of a data packet to be searched for one or more patterns such as a string or a series of strings. These string patterns can be defined by the grammar of regular expressions. In the invention, one or more patterns are loaded into one or more nanocomputers that operate in parallel. A control system then feeds a packet body into the participating nanocomputers such that each participating nanocomputer tests for a match. The various tests performed by the nanocomputers may be combined to perform complex searches. These nanocomputer searches are performed in parallel. Furthermore, several different searches may be combined together using control statements. A combination of these searches engines can be supported such that data is also looked at in parallel.
    Type: Grant
    Filed: May 9, 2000
    Date of Patent: October 7, 2003
    Assignee: PMC-Sierra
    Inventors: Vikram Chopra, Ajay Desai, Raghunath Iyer, Sundar Iyer, Moti Jiandani, Ajit Shelat, Navneet Yadav
  • Patent number: 6631459
    Abstract: An apparatus includes an instruction word storage for storing a plurality of general instruction words and extended instruction words, a temporary storage unit including a plurality of buffers for pre-fetching and storing the plurality of instruction words from the instruction word storage, an instruction word search unit for receiving and decoding the plurality of instruction words pre-fetched and outputting a position signal of a general instruction word and the positions of one or more successive extended instruction words stored in the temporary storage a selector for selecting a buffer in which a general instruction word is stored and outputting the general instruction word sequentially, according to the position signal a general instruction word parser for receiving a general instruction word from the selector and outputting a plurality of control signals for executing the general instruction word simultaneously, an extended data parser is provided for performing an operational processing of operands of
    Type: Grant
    Filed: August 24, 2000
    Date of Patent: October 7, 2003
    Assignee: Asia Design Co., Ltd.
    Inventors: Kyung Youn Cho, Jong Yoon Lim, Geun Taek Lee, Hyeong Cheol Oh, Hyun Gyu Kim, Byung Gueon Min, Heui Lee
  • Patent number: 6629239
    Abstract: A system is described for rearranging an input data word in relation to a mask word, the data word comprising a plurality of input data units in a series of input data unit positions, each associated with a respective one of a plurality of bits of the mask word in a series of mask bit positions, each mask bit having one of a plurality of conditions, to provide an output data word comprising a plurality of output data units in a series of output data unit positions. The system comprises a control module and a shift module. The control module is configured to identify, for each output data unit position, the number of bits in bit positions in the mask word to one end of that bit position which have one of the conditions, and the number of bits in bit positions to another end of the mask word have another of the conditions.
    Type: Grant
    Filed: April 7, 2000
    Date of Patent: September 30, 2003
    Assignee: Sun Microsystems, Inc.
    Inventor: Guy L. Steele, Jr.
  • Patent number: 6629115
    Abstract: A method and apparatus is disclosed for manipulating vectored data. The method includes shifting bits of packed data comprising M N-bit elements using a bit-level shift step followed by a byte-level shift step. A mask is generated and applied to the intermediate shifted result to produce the final result. A method is disclosed for conditionally transferring data from one general purpose register to another based on data in yet a third general purpose register.
    Type: Grant
    Filed: October 1, 1999
    Date of Patent: September 30, 2003
    Assignee: Hitachi, Ltd.
    Inventor: Stephane Rossignol
  • Publication number: 20030182544
    Abstract: A pipeline video decoder and decompression system handles a plurality of separately encoded bit streams arranged as a single serial bit stream of digital bits and having separately encoded pairs of control codes and corresponding data carried in the serial bit stream. The pipeline system employs a plurality of interconnected stages to decode and decompress the single bit stream, including a start code detector. When in a search mode, the start code detector searches for a specific start code corresponding to one of multiple compression standards. The start code detector responding to the single serial bit stream generates control tokens and data tokens. A respective one of the tokens includes a plurality of data words. Each data word has an extension bit which indicates a presence of additional words therein. The data words are thereby unlimited in number.
    Type: Application
    Filed: February 6, 2001
    Publication date: September 25, 2003
    Inventors: Adrian P. Wise, Martin W. Sotheran, William P. Robbins, Anthony M. Jones, Helen R. Finch, Kevin J. Boyd, Anthony Peter J. Claydon
  • Patent number: 6622239
    Abstract: A method, system and computer program product for optimizing processing of single byte characters employed within a multibyte character encoding scheme in association with an underlying data encoding scheme employed within an operating system. The method includes: (1) receiving a data string, (2) passing the data string in its entirety to a first processing routine and (3) evaluating the data string to determine if any character in the data string is an excluded character of a host font. The method further includes (4) transferring the data string in its entirety to a second processing routine and (5) assessing a limited number of characters in the data string to determine if the data string can be converted under an underlying encoding scheme.
    Type: Grant
    Filed: June 25, 1999
    Date of Patent: September 16, 2003
    Assignee: International Business Machines Corporation
    Inventors: Wai Yee Peter Wong, Bruce Lee Worthington
  • Patent number: 6622242
    Abstract: A functional unit is described for selectively performing a number of types of bit rearrangement operations, including a generalized bit reverse operation and a generalized shuffle/unshuffle operation, and in addition left and right unsigned shift operations and an arithmetic shift right operation. The functional unit includes a shifter array and a control signal generator. The shifter array includes a plurality of selector circuits arrayed in a number of stages for shifting bits of an input data word in accordance with control signals, the output of the last stage corresponding to a rearranged output data word. The control signal generator generates control signals in response to rearrangement operation type and pattern information.
    Type: Grant
    Filed: April 7, 2000
    Date of Patent: September 16, 2003
    Assignee: Sun Microsystems, Inc.
    Inventor: Guy L. Steele, Jr.
  • Patent number: 6618804
    Abstract: A system is disclosed for rearranging data units of a data word in accordance with a mask word, the mask word having a plurality of mask bits each associated with a data unit, each mask bit having one of a set condition and a clear condition. The system includes an array of interconnected swap modules organized in a series of swap stages, each swap module having two inputs and two outputs. Each swap module is configured to receive at each input a data unit and associated mask bits and couple the data units to the respective outputs in relation to the associated mask bit's condition.
    Type: Grant
    Filed: April 7, 2000
    Date of Patent: September 9, 2003
    Assignee: Sun Microsystems, Inc.
    Inventors: Guy L. Steele, Jr., Peter Lawrence
  • Publication number: 20030167390
    Abstract: A data byte insertion circuit includes circuitry to generate derivative intermediate data words from input data words of a current and a preceding cycle, repositioning data bytes of the input data words before and after data byte insertion points of the current and preceding cycles, and circuitry to generate re-aligned variants of insertion data bytes of the current cycle. The data byte insertion circuit further includes circuitry to generate a number of multi-bit data bit selection masks, and circuitry to generate an output data word by conditionally using selected parts of the derivate intermediate data words and the re-aligned variants of the insertion data bytes, in accordance with the multi-bit data bit selection masks.
    Type: Application
    Filed: March 1, 2002
    Publication date: September 4, 2003
    Inventors: J. Zachary Gorman, Richard S. Willardson
  • Patent number: 6609218
    Abstract: A method and device for analyzing data reads unstructured data into a data memory and compares it with a structure description contained in a structure description memory to identify components of the unstructured data. An addressing logic is initiated in accordance with the identified components of the unstructured data. A register is coupled to the addressing logic to serve as an interface for access to the unstructured data based on the identified components.
    Type: Grant
    Filed: February 27, 2001
    Date of Patent: August 19, 2003
    Assignee: Tektronix International Sales GmbH
    Inventor: Torsten Jäkel
  • Publication number: 20030135725
    Abstract: A system, method, and processor readable medium including processor readable code embodied therein are provided that enable a user to refine a search query using a graphical user interface. A user may be presented with a graphical user interface (GUI). The GUI may enable the user to input parameters into a first search query. The first search query may be run in a database. The system may determine whether any documents stored in the database satisfy the first search query. If the system determines that one or more documents satisfy the first search query, the system may retrieve a search results that includes the one or more documents. The system may then determine what type of information is included in the search result. Based on the type of information determination, the system may identify a search refinement option that may enable the user to limit the search result. The user may select a search refinement option to limit the search.
    Type: Application
    Filed: January 14, 2002
    Publication date: July 17, 2003
    Inventors: Andrew Lewis Schirmer, Cynthia Jeanne Regnante, James Scott Fitzgerald
  • Patent number: 6587939
    Abstract: An information processing apparatus is provided with a executable instruction extracting unit which is reconfigured by means of a executable instruction extracting unit reconfiguration unit with reference to a compressed/executable instruction correspondence table optimized for the respective executable program, which has been made up with an compressed instruction. The compressed instruction is extended into the corresponding executable instructions by means of the executable instruction extracting unit as reconfigured.
    Type: Grant
    Filed: January 13, 2000
    Date of Patent: July 1, 2003
    Assignee: Kabushiki Kaisha Toshiba
    Inventor: Hiroyuki Takano
  • Patent number: 6583735
    Abstract: The power consumption of interconnects starts to have a significant impact on a system's total power consumption. Besides increasing buses (length, width) etc. this is mostly due to deep sub-micron effects where coupling capacitances between bus lines (wire-to-wire) are in the same order of magnitude as the base capacitances (wire-to-metal-layer). At that point, encoding schemes that solely address the minimization of transitions for the purpose of power reduction do not effectively work any more. Using a physical bus model that accurately models coupling capacitances, a signal bus encoding/decoding apparatus with encoding schemes that are partially adaptive and that take coupling effects into consideration is presented. The encoding schemes do not assume any a priori knowledge that is particular to a specific application.
    Type: Grant
    Filed: August 3, 2001
    Date of Patent: June 24, 2003
    Assignee: NEC Corporation
    Inventors: Jörg Henkel, Haris Lekatsas
  • Patent number: 6581026
    Abstract: The objective of the invention is to detect a characteristic in a technical system with reference to model checking. A comparison is made, involving the coordination of several comparative processes, whereby the comparison leads to a result. The comparison is terminated as soon as a comparative process proves that the characteristic is present or not in the appropriate system.
    Type: Grant
    Filed: May 3, 2001
    Date of Patent: June 17, 2003
    Assignee: Infineon Technologies AG
    Inventors: Joerg Lohse, Peter Warkentin
  • Patent number: 6557096
    Abstract: A signal processor with an instruction set architecture (ISA) for flexible data typing, permutation, and type matching of operands. The signal processor includes a data typer and aligner to support flexible data typing, permutation and type matching of operands of the instruction set architecture. The data typer and aligner is selectively configued to align and select one of more sets of data bits from one or more data buses as operands for functional blocks of the signal processor in response to fields of an instruction.
    Type: Grant
    Filed: August 31, 2000
    Date of Patent: April 29, 2003
    Assignee: Intel Corporation
    Inventors: Kumar Ganapathy, Ruban Kanapathipillai
  • Publication number: 20030079118
    Abstract: A bit-synchronous HDLC engine that processes data in parallel, during a single clock cycle is provided. The HDLC engine of the invention is significantly faster than previous bit-synchronous HDLC engines and, thus, is capable of handling greater bandwidths.
    Type: Application
    Filed: October 19, 2001
    Publication date: April 24, 2003
    Inventor: Felix Chow
  • Publication number: 20030079117
    Abstract: A pipeline video decoder and decompression system handles a plurality of separately encoded bit streams arranged as a single serial bit stream of digital bits and having separately encoded pairs of control codes and corresponding data carried in the serial bit stream. The pipeline system employs a plurality of interconnected stages to decode and decompress the single bit stream, including a start code detector. When in a search mode, the start code detector searches for a specific start code corresponding to one of multiple compression standards. The start code detector responding to the single serial bit stream generates control tokens and data tokens. A respective one of the tokens includes a plurality of data words. Each data word has an extension bit which indicates a presence of additional words therein. The data words are thereby unlimited in number.
    Type: Application
    Filed: February 7, 2001
    Publication date: April 24, 2003
    Inventors: Adrian P. Wise, Martin W. Sotheran, William P. Robbins, Anthony M. Jones, Helen R. Finch, Kevin J. Boyd, Anthony Peter J. Claydon
  • Patent number: 6535584
    Abstract: A method and apparatus are provided for reducing the number of cache line data transfers among components of a computer system, thus reducing the amount of traffic on a bus and increasing overall system performance. A sideband communication line is provided to transfer information from a source cache agent pertaining to redundant data strings occurring in a cache line to a destination cache agent. If redundant data strings occur in a cache line, the transfer of one or more portions of a cache line from the source to the destination can be canceled. Redundancy logic is provided to detect occurrences of redundant data strings located in a given cache line, generate and transfer redundancy bits when predetermined redundant data strings occur and decode redundancy bits at a destination cache agent to determine whether redundant data strings occur in subsequent cache lines to be transferred.
    Type: Grant
    Filed: August 6, 1999
    Date of Patent: March 18, 2003
    Assignee: Intel Corporation
    Inventor: James Reinders
  • Patent number: 6529554
    Abstract: A technique to provide low branch-mispredict for MPEG run length encoding. Packed data instructions are used to reorder data when loading into registers. A bitmask is then created to identify zero and non-zero values. An index is generated from the bitmask and locations of the non-zero values are determined. Subsequently, the run-length of the zeros are calculated to encode the data for output based on one of the MPEG standards.
    Type: Grant
    Filed: June 29, 2000
    Date of Patent: March 4, 2003
    Assignee: Intel Corporation
    Inventor: Thomas R. Craver
  • Patent number: 6523108
    Abstract: Deposit and extract instructions include an opcode, a source address, a destination address, a shift number, and a K-bit mask string. The opcode describes the operations to be performed upon a J-bit source string and an N-bit destination string. The source address points to the memory location of the J-bit source string. The destination address points to the memory location of the N-bit destination string. The shift number indicates the number of bits the J-bit source string is to be shifted to generate a shifted bit string. The combination of the shifted bit string with the N-bit destination string is conducted under the control of the K-bit mask string. The invention is useful for high speed digital data processing, such as that performed by devices operating under the IEEE 1394 protocol.
    Type: Grant
    Filed: November 23, 1999
    Date of Patent: February 18, 2003
    Assignees: Sony Corporation, Sony Electronics, Inc.
    Inventors: David James, Jung-Jen Liu
  • Patent number: 6516406
    Abstract: An apparatus includes an instruction decoder, first and second source registers and a circuit coupled to the decoder to receive packed data from the source registers and to unpack the packed data responsive to an unpack instruction received by the decoder. A first packed data element and a third packed data element are received from the first source register. A second packed data element and a fourth packed data element are received from the second source register. The circuit copies the packed data elements into a destination register resulting with the second packed data element adjacent to the first packed data element, the third packed data element adjacent to the second packed data element, and the fourth packed data element adjacent to the third packed data element.
    Type: Grant
    Filed: September 8, 2000
    Date of Patent: February 4, 2003
    Assignee: Intel Corporation
    Inventors: Alexander Peleg, Yaakov Yaari, Millind Mittal, Larry M. Mennemeier, Benny Eitan
  • Publication number: 20030018884
    Abstract: A pipeline video decoder and decompression system handles a plurality of separately encoded bit streams arranged as a single serial bit stream of digital bits and having separately encoded pairs of control codes and corresponding data carried in the serial bit stream. The pipeline system employs a plurality of interconnected stages to decode and decompress the single bit stream, including a start code detector. When in a search mode, the start code detector searches for a specific start code corresponding to one of multiple compression standards. The start code detector responding to the single serial bit stream generates control tokens and data tokens. A respective one of the tokens includes a plurality of data words. Each data word has an extension bit which indicates a presence of additional words therein. The data words are thereby unlimited in number.
    Type: Application
    Filed: January 31, 2001
    Publication date: January 23, 2003
    Inventors: Adrian P. Wise, Martin W. Sotheran, William P. Robbins, Anthony M. Jones, Helen R. Finch, Kevin J. Boyd, Anthony Peter J. Claydon
  • Publication number: 20030014616
    Abstract: A computer pre-processes data collections for use by a big-endian operating system. Pre-processing may include byte swapping, unpacking, bit reversal, or a combination thereof. In one exemplary embodiment, the data collections comprise Advanced Configuration and Power Interface (ACPI) tables.
    Type: Application
    Filed: July 2, 2001
    Publication date: January 16, 2003
    Inventors: Thavatchai Makphaibulchoke, Subramanian Ramesh, Matthew Fischer
  • Patent number: 6507866
    Abstract: A method and apparatus for identifying undesired e-mail messages by receiving e-mail messages, storing fields from the headers of the received e-mail messages and analyzing the stored fields for patterns indicative of undesired e-mail messages. The pattern recognition performed includes counting the number of e-mails received which have the same or similar field content within the headers. This number can be compared to an absolute threshold number, or to the total number of messages in a sample of e-mail messages. The sample may be composed of a predetermined number of received e-mail messages, or may include e-mail messages received during a predetermined time interval. Exceeding thresholds or certain ratios will trigger alarms to alert monitoring functions and update lists of known sources and types of undesired e-mail messages for filtering.
    Type: Grant
    Filed: July 19, 1999
    Date of Patent: January 14, 2003
    Assignee: AT&T Wireless Services, Inc.
    Inventor: Ronald S. Barchi
  • Publication number: 20020184480
    Abstract: A lookup operation is carried out on a data table by logically dividing the data table into a number of smaller sets of data that can be indexed with a single byte of data. Each set of data consists of two vectors, which constitute the operands for a permute instruction. Only a limited number of bits are required to index into the table during the execution of this instruction. The remaining bits of each index are used as masks into a series of select instructions. The select instruction chooses between two vector components, based on the mask, and places the selected components into a new vector. The mask is generated by shifting one of the higher order bits of the index to the most significant position, and then propagating that bit throughout a byte, for example by means of an arithmetic shift. This procedure is carried out for all of the index bytes in the vector, to generate a select mask.
    Type: Application
    Filed: July 9, 2002
    Publication date: December 5, 2002
    Inventor: Ali Sazegari
  • Patent number: 6480913
    Abstract: A system converts an input data stream in a first format (identified by a first stream code having at least two bits) into an output data stream in a second format. The system includes, among other things, a data sequencer for sequencing the input data stream and a counter. The sequencer includes a select input having a first number of selection input locations, a data input for receiving the digital data stream, and output for transmitting the output data stream. The counter includes the first number of selection outputs. A first logic element and a second logic element are coupled to a number of the selection inputs of the sequencer and a number of the selection outputs of the counter. The first and second logic elements control the data sequencer such that the input data stream in converted into the second format.
    Type: Grant
    Filed: July 15, 1999
    Date of Patent: November 12, 2002
    Assignee: 3Dlabs Inc. Led.
    Inventor: Anand C. Monteiro
  • Publication number: 20020152369
    Abstract: A pipeline video decoder and decompression system handles a plurality of separately encoded bit streams arranged as a single serial bit stream of digital bits and having separately encoded pairs of control codes and corresponding data carried in the serial bit stream. The pipeline system employs a plurality of interconnected stages to decode and decompress the single bit stream, including a start code detector. When in a search mode, the start code detector searches for a specific start code corresponding to one of multiple compression standards. The start code detector responding to the single serial bit stream generates control tokens and data tokens. A respective one of the tokens includes a plurality of data words. Each data word has an extension bit which indicates a presence of additional words therein. The data words are thereby unlimited in number.
    Type: Application
    Filed: January 29, 2001
    Publication date: October 17, 2002
    Inventors: Adrian P. Wise, Martin W. Sotheran, Willam P. Robbins, Anthony M. Jones, Helen R. Finch, Kevin J. Boyd, Anthony Peter J. Claydon
  • Publication number: 20020147825
    Abstract: A parallel bit correlator for recognizing a predetermined bit pattern including a predefined number m of bits in a stream of data bits including identifying successive sets of m bits in a stream of data bits and simultaneously comparing each of the sets of m bits to the predetermined bit pattern for detecting the presence of the predetermined bit pattern in the stream of data.
    Type: Application
    Filed: April 10, 2001
    Publication date: October 10, 2002
    Inventors: Yosef Stein, Haim Primo
  • Patent number: 6457121
    Abstract: A device to change the ordering of datums in a packet from a storage device to a pre-determined ordering according to their addresses. The device has a first circuit to receive and process address information to determine a data ordering of data associated with the address information; and a second circuit to reorder the data into ordered packets in the predetermined ordering. This device can be used to efficiently transfer graphic data through the AGP bus in a computer.
    Type: Grant
    Filed: March 17, 1999
    Date of Patent: September 24, 2002
    Assignee: Intel Corporation
    Inventors: Altug Koker, Russell W. Dyer
  • Patent number: 6453358
    Abstract: A switching device for forwarding network traffic to a desired destination on a network, such as a telephone or computer network. The switching device includes multiple ports and uses a lookup table to determine which port to forward network traffic over. The lookup table includes network addresses that are maintained in ascending or descending order. The switching device includes multiple binary search engines coupled in series including one or more precursor binary search engines and a final stage binary search engine. Together, the binary search engines perform an N iteration binary search. Additionally, a single search engine can perform multiple concurrent searches so that source and destination addresses can be obtained simultaneously and without wasted memory cycles.
    Type: Grant
    Filed: September 6, 2000
    Date of Patent: September 17, 2002
    Assignee: Alcatel Internetworking (PE), Inc.
    Inventors: Timothy Scott Michels, James E. Cathey, Greg W. Davis, Bernard N. Daines
  • Publication number: 20020129224
    Abstract: A method for operating a processor having an architecture of a larger bitlength with a program comprising instructions compiled to produce instruction results of at least one smaller bitlength having the steps of detecting when in program order a first smaller bitlength instruction is to be dispatched which does not have a target register address as one of its sources, and adding a so_extract_instruction into an instruction stream before the smaller bitlength instruction.
    Type: Application
    Filed: December 18, 2001
    Publication date: September 12, 2002
    Applicant: IBM
    Inventors: Petra Leber, Jens Leenstra, Wolfram Sauer, Dieter Wendel
  • Patent number: 6446198
    Abstract: A lookup operation is carried out on a data table by logically dividing the data table into a number of smaller sets of data that can be indexed with a single byte of data. Each set of data consists of two vectors, which constitute the operands for a permute instruction. Only a limited number of bits are required to index into the table during the execution of this instruction. The remaining bits of each index are used as masks into a series of select instructions. The select instruction chooses between two vector components, based on the mask, and places the selected components into a new vector. The mask is generated by shifting one of the higher order bits of the index to the most significant position, and then propagating that bit throughout a byte, for example by means of an arithmetic shift. This procedure is carried out for all of the index bytes in the vector, to generate a select mask.
    Type: Grant
    Filed: September 30, 1999
    Date of Patent: September 3, 2002
    Assignee: Apple Computer, Inc.
    Inventor: Ali Sazegari
  • Patent number: 6442178
    Abstract: A parallel-to-serial-to-parallel circuit are disclosed, the circuit interfacing with a data bus, preferably with a processor for byte alignment and other operations. The parallel-to-serial-to-parallel circuit includes an input bit shift register having a predetermined number of register positions and an output bit shift register with the same number of register positions. The output of the input bit shift register is fed into the output bit shift register through a multiplexer. The input bit shift register may receive a bit write from a bit bus, a partial parallel write from a data bus with corresponding data validity data received on a shadow bus, and full parallel write from the data bus. The output bit shift register may transmit a bit read to the bit bus or a full parallel read to the data bus. Data received is shifted to the output bit shift register and compiled into full parallel data or read out as single bits. Offset bits may be introduced in the data stream for data alignment.
    Type: Grant
    Filed: October 1, 1998
    Date of Patent: August 27, 2002
    Assignee: GlobespanVirata Inc.
    Inventors: Laszlo Arato, Emile G. Massaad
  • Patent number: 6438676
    Abstract: A data processor uses storage units that are subdivisible into predetermined fields for executing instructions that cause the data processor to handle numbers from respective ones of the fields separately. The processor has an instruction that addresses a first and a second one of the storage units. In response the data processor takes a first and second group of successive bits from a first and second one of the fields of the first one of the storage units, places the first and second groups of successive bits at respective shifted positions both in the same field in a result storage unit, a bit position distance between the shifted positions being controlled by a content of the second one of the storage units.
    Type: Grant
    Filed: August 4, 1999
    Date of Patent: August 20, 2002
    Assignee: TriMedia Technologies
    Inventor: Fransiscus W. Sijstermans
  • Patent number: 6434625
    Abstract: A computer system and method for use with the computer system to dynamically adapt to a data structure layout other than its own. The data may be an incoming data stream from outside or may be stored within its main memory. Between the transmitting and the receiving CPU there must be an understanding of the conceptual level and format of the data which is transferred. A prefix word in which details of the data structure layout is encoded is generated. The prefix word is appended to the data and transmitted to another CPU or used by the same CPU. Upon receipt of the data, the prefix word is read and decoded and the receiving CPU can dynamically adapt to details of the data structure layout in order to use the data which was generated and transmitted in a heretofore unknown data structure layout.
    Type: Grant
    Filed: July 13, 1999
    Date of Patent: August 13, 2002
    Assignee: International Business Machines Corporation
    Inventor: Larry Wayne Loen
  • Patent number: 6434635
    Abstract: A scatter-gather list is used to control the transfer of a buffer of data of length L from a first memory to a second memory, such that a pad of length P is inserted after each of successive portions of length S of the data are transferred.
    Type: Grant
    Filed: April 29, 1999
    Date of Patent: August 13, 2002
    Assignee: Unisys Corporation
    Inventors: Timothy Case, Richard Coffman
  • Publication number: 20020108030
    Abstract: The present invention provides permutation instructions which can be used in software executed in a programmable processor for solving permutation problems in cryptography, multimedia and other applications. The permute instructions are based on an omega-flip network comprising at least two stages in which each stage can perform the function of either an omega network stage or a flip network stage. Intermediate sequences of bits are defined that an initial sequence of bits from a source register are transformed into. Each intermediate sequence of bits is used as input to a subsequent permutation instruction. Permutation instructions are determined for permuting the initial source sequence of bits into one or more intermediate sequence of bits until a desired sequence is obtained. The intermediate sequences of bits are determined by configuration bits. The permutation instructions form a permutation instruction sequence, of at least one instruction.
    Type: Application
    Filed: May 7, 2001
    Publication date: August 8, 2002
    Inventors: Ruby B. Lee, Xiao Yang
  • Patent number: 6430684
    Abstract: A method of operating a processor (30). The method comprises a first step of fetching an instruction (20). The instruction includes an instruction opcode, a first data operand bit group corresponding to a first data operand (D1′), and a second data operand bit group corresponding to a second data operand (D2′). At least one of the first data operand and the second data operand consists of an integer number N bits (e.g., N=32). The instruction also comprises at least one immediate bit manipulation operand consisting of an integer number M bits, wherein 2M is less than the integer number N. The method further includes a second step of executing the instruction, comprising the step of manipulating a number of bits of one of the first data operand and the second data operand. Finally, the number of manipulated bits is in response to the at least one immediate bit manipulation operand, and the manipulating step is further in response to the instruction opcode.
    Type: Grant
    Filed: October 29, 1999
    Date of Patent: August 6, 2002
    Assignee: Texas Instruments Incorporated
    Inventor: Patrick W. Bosshart
  • Patent number: 6427179
    Abstract: The present invention entails a programmable data communications protocol conversion unit (PCU) and method. The PCU is a processor circuit which includes a means for performing full parallel, partial parallel, and bit data transfers. In particular, a bit assembly register is employed to assemble partial parallel data blocks which comprise data with a number of bits that is less than the order of the data bus of the PCU. The bit assembly register further includes the capability of writing the partial parallel data block to predetermined locations using a full parallel transfer and a shadow bus with bits indicating the validity of the particular bits in the data block transferred. The particular circuits receiving partial parallel writes include a register for receiving data and a register for receiving the corresponding shadow bits. Invalid data written to these registers is ignored while valid data is shifted accordingly, for example, out to a serial interface.
    Type: Grant
    Filed: October 1, 1998
    Date of Patent: July 30, 2002
    Assignee: GlobespanVirata, Inc.
    Inventors: Daniel Amrany, Lazslo Arato
  • Patent number: 6412066
    Abstract: A microprocessor is configured to fetch a compressed instruction set which comprises a subset of a corresponding non-compressed instruction set. The compressed instruction set is a variable length instruction set including 16-bit and 32-bit instructions. The 32-bit instructions are coded using an extend opcode, which indicates that the instruction being fetched is an extended (e.g. 32 bit) instruction. The compressed instruction set further includes multiple sets of register mappings from the compressed register fields to the decompressed register fields. Certain select instructions are assigned two opcode encodings, one for each of two mappings of the corresponding register fields. The compressed register field is directly copied into a portion of the decompressed register field while the remaining portion of the decompressed register field is created using a small number of logic gates.
    Type: Grant
    Filed: April 5, 2001
    Date of Patent: June 25, 2002
    Assignee: LSI Logic Corporation
    Inventors: Frank Worrell, Hartvig Ekner
  • Publication number: 20020071367
    Abstract: An apparatus for detecting a predetermined pattern of bits in a data bitstream includes a series of detecting elements (2-6), each detecting element in the series corresponding to a predetermined bit in the predetermined pattern. Each detecting element receives a data bit from the data bitstream (8), the corresponding predetermined bit in the predetermined pattern and an error signal from a previous detecting element in the series. The output of each detecting element is an error signal indicative of the number of mismatches between the data bit and the corresponding predetermined bit in the predetermined pattern, both in previous detecting elements in the series in previous clock cycles and in the current detecting element in the current clock cycle. The error signal of the final detecting element (6) of the series is coupled to a logic control element (18) for detecting that a maximum allowed level of mismatches has been detected.
    Type: Application
    Filed: May 22, 2001
    Publication date: June 13, 2002
    Applicant: LSI LOGIC CORPORATION
    Inventor: Paul A. Brierley
  • Patent number: 6401144
    Abstract: A method and apparatus for ensuring that information transfers from memory to a peripheral device are complete prior to the peripheral device executing instructions responsive to the content of the information is described. The method includes identifying lines of data to be written, determining a unique start code to be used for that data, and embedding that start code into that data. When the proper number of lines of data have arrived in peripheral device memory, the pending operation is executed.
    Type: Grant
    Filed: February 26, 1999
    Date of Patent: June 4, 2002
    Assignee: Intel Corporation
    Inventor: Morris Jones