Patents by Inventor Chandrakant R. Vora

Chandrakant R. Vora 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: 4228497
    Abstract: In a microprogrammed data processing pipeline system comprising a plurality of stages, microinstructions for controlling the stages are stored as templates in an addressable template micromemory store and are provided automatically and sequentially to the stage of the pipeline system. Each template is associated with an individual set of data and includes microinstructions for each stage, whether real or virtual, through which the associated set of data passes. The template micromemory store is segmented into a plurality of individually addressable micromemory units with each unit therein storing microinstructions for an individually associated stage in the data processing pipeline system.
    Type: Grant
    Filed: November 17, 1977
    Date of Patent: October 14, 1980
    Assignee: Burroughs Corporation
    Inventors: Ram K. Gupta, Chandrakant R. Vora
  • Patent number: 4168530
    Abstract: A high speed parallel operation, multiplication circuit is provided having a multiplier multiplexor which may function in combination with a column compressor for providing a resultant product, wherein, preferably, the multiplier multiplexor has been implemented using a modified Booth's algorithm, and wherein the column compressor operates to process every column within the same propagation delay whereby every input may create an output in essentially the same propagation time, i.e., true parallel operation requiring preferably no more than an average column propagation delay time.
    Type: Grant
    Filed: February 13, 1978
    Date of Patent: September 18, 1979
    Assignee: Burroughs Corporation
    Inventors: Daniel D. Gajski, Chandrakant R. Vora
  • Patent number: 3980874
    Abstract: Modulo M translation is performed on a large binary number of n bits by grouping the binary number in contiguous sets of approximately K bits each, storing the modulo M residues for each K bit set in an individually associated pre-stored ROM, reading the modulo M residues for a particular K bit segment of a binary number out of the ROMs, and performing modulo M addition on the read-out residues. Thus, modulo M translation of a positive number is accomplished in n/k modulo M additions and a table look-up, with the look-up table being stored in n/k ROMs. A subsequent modulo M subtraction is performed if the binary number is negative.
    Type: Grant
    Filed: May 9, 1975
    Date of Patent: September 14, 1976
    Assignee: Burroughs Corporation
    Inventor: Chandrakant R. Vora