Patents by Inventor Manik Raina

Manik Raina 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: 7804803
    Abstract: Non-overlapping time slots are allocated to a plurality of nodes in a network by a mobile agent that moves from node to node of the network. At a current node of the network, the mobile agent accesses neighbor information that includes time slot information relative to neighbor nodes of the current node. The neighbor nodes are neighbors of the current node. At the current node of the network, the mobile agent also assigns mutually exclusive time slots for the neighbor nodes.
    Type: Grant
    Filed: July 25, 2005
    Date of Patent: September 28, 2010
    Assignee: Honeywell International Inc.
    Inventors: Kannan Perumal, Manik Raina, Subhas Kumar Ghosh, Ranicer Patro, Balamurugan Mohan
  • Publication number: 20090217126
    Abstract: A computer implemented method of communicating includes receiving systematic group codes representative of one or more messages. A Tanner graph is used to decode such systematic group codes. A method of forming a communication decoder includes obtaining a dual code for a systematic group code, obtaining a Tanner graph from the dual code, and reducing vertex complexity of the Tanner graph to provide a decoding Tanner graph for the communication decoder.
    Type: Application
    Filed: April 24, 2008
    Publication date: August 27, 2009
    Inventors: Manik Raina, Viswanath Ganapathy, Ranjeet Patro, Chandrashekhara PS Thejaswi
  • Patent number: 7468970
    Abstract: A single mobile agent, multiple mobile agents, or a query mobile agent traverse the nodes of a network. As the single mobile agent, multiple mobile agents, or a query mobile agent visits a nodes of a network, the mobile agent performs a function at the node such as depositing data or software at the node or collecting data from the node. The single mobile agent, multiple mobile agents, or a query mobile agent may be arranged so that all nodes of the network are visited.
    Type: Grant
    Filed: October 24, 2005
    Date of Patent: December 23, 2008
    Assignee: Honeywell International Inc.
    Inventors: Manik Raina, Subhas Kumar Ghosh, Ranjeet Kumar Patro
  • Publication number: 20080304552
    Abstract: A receiver includes a channel providing information received from wireless communications, including information from a selected user. A minimum mean square error combiner is coupled to the channel for receiving samples in a symbol duration and minimizes mean square error in such samples. The combiner has coefficients derived from a training sequence. Information of the selected user is extracted from a mixture consisting of information from unintended users, interference and noise.
    Type: Application
    Filed: June 5, 2007
    Publication date: December 11, 2008
    Inventors: Chandrashekhar Thejaswi Pataguppe, Viswanath Ganapathy, Manik Raina, Ranjeet Patro, Manohar Shamiah
  • Publication number: 20080267308
    Abstract: A method and system are used for constructing a minimal BCJR trellis for a block group code. A parity check matrix of a block group code is obtained, as is a generator matrix of the block group code. A root vertex is determined at a first time. Syndromes of the parity check matrix are determined at further times to determine distinct vertices at such further times until a null vector is encountered to obtain a minimal BCJR trellis for the block group code for storing or use in decoding received codes.
    Type: Application
    Filed: April 23, 2008
    Publication date: October 30, 2008
    Inventors: Manik Raina, Ranjeet Patro, Chandrashekhara Ps Thejaswi, Viswanath Ganapathy
  • Publication number: 20080267322
    Abstract: A method and system constructs a minimal trellis for decoding a block group code. A generator matrix of the code is obtained and converted into a row-reduced echelon matrix form. Vertices are determined from the row-reduced echelon matrix form at a first time. Further vertices at later times are also determined to obtain a minimal trellis for the block group code C for storing or use in decoding received codes.
    Type: Application
    Filed: April 18, 2008
    Publication date: October 30, 2008
    Inventors: Manik Raina, Ranjeet Patro, Chandrashekhara PS Thejaswi, Viswanath Ganapathy
  • Publication number: 20070091856
    Abstract: A single mobile agent, multiple mobile agents, or a query mobile agent traverse the nodes of a network. As the single mobile agent, multiple mobile agents, or a query mobile agent visits a nodes of a network, the mobile agent performs a function at the node such as depositing data or software at the node or collecting data from the node. The single mobile agent, multiple mobile agents, or a query mobile agent may be arranged so that all nodes of the network are visited.
    Type: Application
    Filed: October 24, 2005
    Publication date: April 26, 2007
    Inventors: Manik Raina, Subhas Ghosh, Ranjeet Patro
  • Publication number: 20070019594
    Abstract: Non-overlapping time slots are allocated to a plurality of nodes in a network by a mobile agent that moves from node to node of the network. At a current node of the network, the mobile agent accesses neighbor information that includes time slot information relative to neighbor nodes of the current node. The neighbor nodes are neighbors of the current node. At the current node of the network, the mobile agent also assigns mutually exclusive time slots for the neighbor nodes.
    Type: Application
    Filed: July 25, 2005
    Publication date: January 25, 2007
    Inventors: Kannan Perumal, Manik Raina, Subhas Ghosh, Ranicer Patro, Balamurugan Mohan