Patents by Inventor Mitchell A. Thornton

Mitchell A. Thornton 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).

  • Publication number: 20180314969
    Abstract: Embodiments of quantum ring oscillator-based coherence preservation circuits including a cascaded set of stages are described. Embodiments of such quantum ring oscillator-based coherence preservation circuits allow the internal (superpositioned) quantum state information of stored qubits to be preserved over long periods of time and present options for the measurement and potential correction of both deterministic and non-deterministic errors without disturbing the quantum information stored in the structure itself.
    Type: Application
    Filed: April 27, 2018
    Publication date: November 1, 2018
    Inventors: Mitchell A. Thornton, Duncan L. MacFarlane, Timothy P. LaFave, JR., William V. Oxford
  • Publication number: 20180157986
    Abstract: Embodiments of feedback-based quantum circuits are described. Embodiments of such quantum circuits may be externally controlled using only basis or eigenstate (classically-observable) signals without triggering de-coherence. Additionally, embodiments of such quantum circuits allow the internal (superpositioned) quantum state information to be preserved over long periods of time and present options for quantum error-correction due to the basis-state controls. Moreover, a coupling of two such feedback-based quantum circuits allows for quantum-channel-based information exchange to a variety of ends.
    Type: Application
    Filed: December 5, 2017
    Publication date: June 7, 2018
    Inventors: William V. Oxford, Mitchell A. Thornton, Duncan L. MacFarlane, Timothy P. LaFave, JR.
  • Patent number: 9684489
    Abstract: Methods, apparatuses, and computer program products for squaring an operand include identifying a fixed-point value with a fixed word size and a substring size for substrings of the fixed-point value, wherein the fixed-point value comprises a binary bit string. A square of the fixed-point value can be determined using the fixed point value, the substring size, and least significant bits of the fixed-point value equal to the substring size.
    Type: Grant
    Filed: August 31, 2012
    Date of Patent: June 20, 2017
    Assignee: Southern Methodist University
    Inventors: Mitchell A. Thornton, Saurabh Gupta
  • Publication number: 20140067893
    Abstract: Methods, apparatuses, and computer program products for squaring an operand include identifying a fixed-point value with a fixed word size and a substring size for substrings of the fixed-point value, wherein the fixed-point value comprises a binary bit string. A square of the fixed-point value can be determined using the fixed point value, the substring size, and least significant bits of the fix-point value equal to the substring size.
    Type: Application
    Filed: August 31, 2012
    Publication date: March 6, 2014
    Inventors: Mitchell A. Thornton, Saurabh Gupta
  • Patent number: 7962537
    Abstract: Determining a table output of a table representing a hierarchical tree for an integer valued function includes determining an address from a table input. A subset of a memory is selected according to the address, where the memory represents the hierarchical tree and the subset represents a subtree of the hierarchical tree. Bit fields are selected from the subset, and bits are extracted from the bit fields. A table output is determined from the extracted bits.
    Type: Grant
    Filed: June 26, 2007
    Date of Patent: June 14, 2011
    Assignee: Southern Methodist University
    Inventors: David W. Matula, Mitchell A. Thornton, Alexandru Fit-Florea, Lun Li
  • Publication number: 20080005211
    Abstract: Determining a table output of a table representing a hierarchical tree for an integer valued function includes determining an address from a table input. A subset of a memory is selected according to the address, where the memory represents the hierarchical tree and the subset represents a subtree of the hierarchical tree. Bit fields are selected from the subset, and bits are extracted from the bit fields. A table output is determined from the extracted bits.
    Type: Application
    Filed: June 26, 2007
    Publication date: January 3, 2008
    Inventors: David Matula, Mitchell Thornton, Alexandru Fit-Florea, Lun Li
  • Patent number: 7043710
    Abstract: A system and method for early evaluation in micropipeline processors to improve performance is provided. The present invention presents a design methodology where a micropipeline processor block (e.g., a binary full adder) is capable of computing a result based on the arrival of only a subset of inputs. In general, early evaluation allows micropipeline processor blocks to operate in parallel, where they might otherwise operate sequentially because of data arrival dependencies; thereby improving performance of the micropipeline processors.
    Type: Grant
    Filed: February 10, 2004
    Date of Patent: May 9, 2006
    Assignee: Mississippi State University
    Inventors: Robert B. Reese, Mitchell A. Thornton
  • Publication number: 20040225699
    Abstract: A system and method for early evaluation in micropipeline processors to improve performance is provided. The present invention presents a design methodology where a micropipeline processor block (e.g., a binary full adder) is capable of computing a result based on the arrival of only a subset of inputs. In general, early evaluation allows micropipeline processor blocks to operate in parallel, where they might otherwise operate sequentially because of data arrival dependencies; thereby improving performance of the micropipeline processors.
    Type: Application
    Filed: February 10, 2004
    Publication date: November 11, 2004
    Inventors: Robert B. Reese, Mitchell A. Thornton