Patents by Inventor Richard Karp

Richard Karp has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 9240810
    Abstract: A method for processing a chain reaction code includes first selecting a source symbol which is associated with an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.
    Type: Grant
    Filed: August 28, 2009
    Date of Patent: January 19, 2016
    Assignee: Digital Fountain, Inc.
    Inventors: Amin Shokrollahi, Soren Lassen, Richard Karp
  • Patent number: 9053272
    Abstract: Disclosed is a hardware accelerator for development engineering processes for a programmable logic device, such as for an FPGA.
    Type: Grant
    Filed: March 14, 2012
    Date of Patent: June 9, 2015
    Assignee: TicTran Corp.
    Inventors: Edward F. Panofsky, Richard A. Karp
  • Publication number: 20130019213
    Abstract: Disclosed is a hardware accelerator for development engineering processes for a programmable logic device, such as for an FPGA.
    Type: Application
    Filed: March 14, 2012
    Publication date: January 17, 2013
    Applicant: TicTran Corp
    Inventors: Edward F. Panofsky, Richard A. Karp
  • Patent number: 8229416
    Abstract: Methods, systems, and computer readable media for stress testing mobile network equipment using CPRI are disclosed. According to one method, a plurality of messages is generated for simulating a plurality of user equipment (UE) devices. The plurality of messages is transmitted over a common public radio interface (CPRI) link to a radio equipment controller (REC) in order to stress test the REC component.
    Type: Grant
    Filed: December 17, 2008
    Date of Patent: July 24, 2012
    Assignee: Ixia
    Inventors: Arda Akman, Matthew Balkwill, David Hammond, Richard Karp, Edward Panofsky, Glenn Stewart, Kalyan Sundhar
  • Publication number: 20110103519
    Abstract: A method for processing a chain reaction code includes first selecting a source symbol which is associated with an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.
    Type: Application
    Filed: August 28, 2009
    Publication date: May 5, 2011
    Applicant: QUALCOMM Incorporated
    Inventors: M. Amin Shokrollahi, Soren Lassen, Richard Karp
  • Publication number: 20100075678
    Abstract: Methods, systems, and computer readable media for stress testing mobile network equipment using CPRI are disclosed. According to one method, a plurality of messages is generated for simulating a plurality of user equipment (UE) devices. The plurality of messages is transmitted over a common public radio interface (CPRI) link to a radio equipment controller (REC) in order to stress test the REC component.
    Type: Application
    Filed: December 17, 2008
    Publication date: March 25, 2010
    Inventors: Arda Akman, Matthew Balkwill, David Hammond, Richard Karp, Edward Panofsky, Glenn Stewart, Kalyan Sundhar
  • Patent number: 7633413
    Abstract: A method for processing a chain reaction codes includes first selecting a source symbol which is associated an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.
    Type: Grant
    Filed: August 20, 2007
    Date of Patent: December 15, 2009
    Assignee: QUALCOMM Incorporated
    Inventors: M. Amin Shokrollahi, Soren Lassen, Richard Karp
  • Publication number: 20080169945
    Abstract: A method for processing a chain reaction codes includes first selecting a source symbol which is associated an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.
    Type: Application
    Filed: August 20, 2007
    Publication date: July 17, 2008
    Applicant: Digital Fountain, Inc.
    Inventors: M. Amin Shokrollahi, Richard Karp, Soren Lassen
  • Patent number: 7265688
    Abstract: A method for processing a chain reaction codes includes first selecting a source symbol which is associated an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.
    Type: Grant
    Filed: February 15, 2006
    Date of Patent: September 4, 2007
    Assignee: Digital Fountain, Inc.
    Inventors: M. Amin Shokrollahi, Soren Lassen, Richard Karp
  • Publication number: 20060227022
    Abstract: A method for processing a chain reaction codes includes first selecting a source symbol which is associated an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.
    Type: Application
    Filed: February 15, 2006
    Publication date: October 12, 2006
    Applicant: Digital Fountain, Inc.
    Inventors: M. Shokrollahi, Soren Lassen, Richard Karp
  • Patent number: 7030785
    Abstract: A method for processing a chain reaction codes includes first selecting a source symbol which is associated an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.
    Type: Grant
    Filed: January 7, 2005
    Date of Patent: April 18, 2006
    Assignee: Digital Fountain, Inc.
    Inventors: M. Amin Shokrollahi, Soren Lassen, Richard Karp
  • Publication number: 20050206537
    Abstract: A method for processing a chain reaction codes includes first selecting a source symbol which is associated an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.
    Type: Application
    Filed: January 7, 2005
    Publication date: September 22, 2005
    Applicant: Digital Fountain, Inc.
    Inventors: M. Shokrollahi, Soren Lassen, Richard Karp
  • Patent number: 6856263
    Abstract: A method for processing a chain reaction codes includes first selecting a source symbol which is associated an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.
    Type: Grant
    Filed: June 10, 2003
    Date of Patent: February 15, 2005
    Assignee: Digital Fountain, Inc.
    Inventors: M. Amin Shokrollahi, Soren Lassen, Richard Karp
  • Publication number: 20040075592
    Abstract: A method for processing a chain reaction codes includes first selecting a source symbol which is associated an output symbol of degree two or higher (i.e., an output symbol which is itself associated with two or more input symbols), and subsequently deactivating the selected source symbol in an attempt to produce an output symbol of degree one. The inactivation process can be repeated either successively until an output symbol of degree one is identified, and/or whenever the decoding process is unable to locate an output symbol of degree one.
    Type: Application
    Filed: June 10, 2003
    Publication date: April 22, 2004
    Applicant: Digital Fountain, Inc.
    Inventors: M. Amin Shokrollahi, Soren Lassen, Richard Karp
  • Patent number: 4608631
    Abstract: A multi-processor computer system is disclosed in which processing elements, memory elements and peripheral units can be physically added and removed from the system without disrupting its operation or necessitating any reprogramming of software running on the system. The processing units, memory units and peripheral units are all coupled to a common system bus by specialized interface units. The processing elements are organized into partially independent groups each of which has dedicated interface units, but the processing units share system resources including peripherals and the entire memory space. Within each processing element group at any one time, group supervisory tasks are performed by one of the processors, but the supervisor function is passed among the processors in the group in a sequence to prevent a fault in one processor from disabling the entire group. Communication between groups is accomplished via the common memory areas.
    Type: Grant
    Filed: November 19, 1984
    Date of Patent: August 26, 1986
    Assignee: Sequoia Systems, Inc.
    Inventors: Jack J. Stiffler, Richard A. Karp, James M. Nolan, Jr., Michael J. Budwey, David A. Wallace
  • Patent number: 4484273
    Abstract: A multi-processor computer system is disclosed in which processing elements, memory elements and peripheral units can be physically added and removed from the system without disrupting its operation or necessitating any reprogramming of software running on the system. The processing units, memory units and peripheral units are all coupled to a common system bus by specialized interface units. The processing elements are organized into partially independent groups each of which has dedicated interface units, but the processing units share system resources including peripherals and the entire memory space. Within each processing element group at any one time, group supervisory tasks are performed by one of the processors, but the supervisor function is passed among the processors in the group in a sequence to prevent a fault in one processor from disabling the entire group. Communication between groups is accomplished via the common memory areas.
    Type: Grant
    Filed: September 3, 1982
    Date of Patent: November 20, 1984
    Assignee: Sequoia Systems, Inc.
    Inventors: Jack J. Stiffler, Richard A. Karp, James M. Nolan, Jr., Michael J. Budwey, David A. Wallace