Patents by Inventor Ravi Kumar Jain
Ravi Kumar Jain 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: 20240088879Abstract: A multiphase digital frequency synthesizer including a multiphase ring oscillator that provides phased clock signals, a clock divider that divides a phased clock signal by an integer value and a carry value to provide a divided clock signal, positive select circuitry that determines and updates a positive select value with accumulation and a modulo function based on a fractional division factor updated with successive cycles of the divided clock signal, carry circuitry that determines the carry value based on a number of the phased clock signals, positive multiplex circuitry that selects from among the phased clock signal using the positive select value for providing a positive multiplexed clock signal, and fractional phase addition circuitry that provides a first output clock signal based on a selected phased clock signal, the divided clock signal, and the positive multiplexed clock signal. Similar negative select circuitry and duty cycle correction circuitry may be included.Type: ApplicationFiled: April 6, 2023Publication date: March 14, 2024Inventors: Ravi Kumar, Gaurav Agrawal, Deependra Kumar Jain, Krishna Thakur
-
Patent number: 8620729Abstract: A robust method for solving in a computer, optimization problems under uncertainty including the steps of: specifying the uncertainty as a hierarchical series of sets of constraints on parameters, with the parameters restricted to each constraint set forming an ensemble, and the hierarchy of constraints, represented as mathematical sets forming a hierarchy of ensembles, said hierarchy being based on subset, intersection or disjoint relationships amongst them; utilizing optimization techniques to create effective identify minimum and maximum bounds on the each objective function, said bounds depending on the constraints comprising each ensemble of parameters and being computed for each of the assumptions about the future; estimating a volume of candidate ensembles and relating the volume to one or more information theoretic measures; and utilizing information theoretic measures to analyze and improve the candidate iteratively refine the ensembles and associated by changing a specificity of the bounds on the obType: GrantFiled: July 7, 2006Date of Patent: December 31, 2013Assignee: International Institute of Information TechnologyInventors: Prasanna Gorur Narayana Srinivasa, Abhishek Bagchi, Ankit Agarwal, Debashree Sen, Jyotsna Chatradhi, Manjunath Appasaheb Sindagi, Harjindersingh Gurubaxsingh Mistry, Namrata Dureja, Nandish Jayaram, Neeraj Motwani, Neha Kanchan, Nidhi Rajshree, Pallavi Karan, Pradeep Puthuparampil, Priyanka Sriyapareddy, Ravi Kumar Jain, Raehan Ahsen, Silpa Uppalapati, Shruti Garg, Siddhartha Godbole, Siddhartha Pandey, Sougato Chakraborty
-
Patent number: 8256015Abstract: Methods, components, and systems for efficient authentication, either through a digital signature or message authentication codes, and verification of a digital stream sent from a source to a receiver via zero or more intermediaries, such that the source or intermediary (or both) can remove certain portions of the data stream without inhibiting the ability of the ultimate receiver to verify the authenticity and integrity of the data received. According to the invention, a source may sign an entire data stream once, but may permit either itself or an intermediary to efficiently remove certain portions of the stream before transmitting the stream to the ultimate recipient, without having to re-sign the entire stream. Applications may include the signing of media streams which often need to be further processed to accommodate the resource requirements of a particular environment. Another application allows an intermediary to choose an advertisement to include in a given slot.Type: GrantFiled: September 16, 2009Date of Patent: August 28, 2012Assignee: NTT DoCoMo, Inc.Inventors: Craig B. Gentry, Alejandro Hevia, Ravi Kumar Jain, Toshiro Kawahara, Zulfikar Amin Ramzan
-
Publication number: 20120035984Abstract: A robust method for solving in a computer, optimization problems under uncertainty including the steps of: specifying the uncertainty as a hierarchical series of sets of constraints on parameters, with the parameters restricted to each constraint set forming an ensemble, and the hierarchy of constraints, represented as mathematical sets forming a hierarchy of ensembles, said hierarchy being based on subset, intersection or disjoint relationships amongst them; utilizing optimization techniques to create effective identify minimum and maximum bounds on the each objective function, said bounds depending on the constraints comprising each ensemble of parameters and being computed for each of the assumptions about the future; estimating a volume of candidate ensembles and relating the volume to one or more information theoretic measures; and utilizing information theoretic measures to analyze and improve the candidate iteratively refine the ensembles and associated by changing a specificity of the bounds on the obType: ApplicationFiled: July 7, 2006Publication date: February 9, 2012Inventors: Prasanna Gorur Narayana Srinivasa, Abhishek Bagchi, Ankit Agarwal, Debashree Sen, Jyotsna Chatradhi, Manjunath Appasaheb Sindagi, Harjindersingh Gurubaxsingh Mistry, Namrata Dureja, Nandish Jayaram, Neeraj Motwani, Neha Kanchan, Nidhi Rajshree, Pallavi Karan, Pradeep Puthuparampil, Priyanka Sriyapareddy, Ravi Kumar Jain, Raehan Ahsen, Silpa Uppalapati, Shruti Garg, Siddhartha Godbole, Siddhartha Pandey, Sougato Chakraborty
-
Patent number: 7995462Abstract: A method supports scalable and reliable multicast in a wireless network with a large bandwidth-delay product. In this method, acknowledgement packets from different receivers experiencing the same number of data packets lost are assigned the same time slots. This method can be combined with other loss recovery techniques, such as forward error correction (FEC) recovery, proactive protection, feedback suppression and collision detection. Scalability is achieved as bandwidth usage relates only to the number of packets transmitted, rather than the number of receivers.Type: GrantFiled: October 12, 2007Date of Patent: August 9, 2011Assignee: NTT DoCoMo, Inc.Inventors: Xia Gao, Fujio Watanabe, Gang Wu, Ravi Kumar Jain, Toshiro Kawahara
-
Publication number: 20110125702Abstract: Modern decision support methods handle uncertainty or hypothesis about operating conditions, using one of two techniques viz. probabilistic formulation and constraints based method, which is the subject of the present invention. A large number of applications use linear constraints to specify uncertainty. These linear constraints are the set of linear inequalities, which are used to define the demand/supply in the area of supply chains. The set of linear inequalities forms a polytope, the volume of which represents the information content. The present invention deals with the application of computational geometrical methods to find the set theoretic relationship—subset, intersection and disjointness among the polytopes and then present a visualization technique to represent these relationships among polytopes. This invention proposes a decision support system and method to visualize the relationship among the polytopes to help with decision support.Type: ApplicationFiled: July 9, 2009Publication date: May 26, 2011Inventors: Prasanna Gorur Narayana Srinivasa, Abhilasha Aswal, Manjunath Appasaheb Sindagi, Ravi Kumar Jain, Jyotsna Chatradhi, Khyati Sanghvi, Reshma Ratnani
-
Patent number: 7916739Abstract: Cryptographically Protected Prefixes (“CPPs”) are used to create IP addresses, preventing any correlation between a CPP IP address and a host's geographic location. An IP address is subdivided into address prefixes of multiple segments. Each segment is encrypted with a cryptographic key known only to a subset of routers in the access network domain (or Privacy Domain). Therefore, each router obtains the information it needs to forward a packet of information, but not any additional information.Type: GrantFiled: May 20, 2004Date of Patent: March 29, 2011Assignee: NTT DoCoMo, Inc.Inventors: Jonathan Trostle, Muhammad Mukarran Bin Tariq, Hosei Matsuoka, James Kempf, Ravi Kumar Jain, Toshiro Kawahara
-
Publication number: 20100177643Abstract: A method of estimating bandwidth capacity, available bandwidth and utilization along a path in an IP network is disclosed. ICMP time-stamp requests are sent from a source host on the edge or inside the network to all routers on the end-to-end path to a desired destination. Differences between time-stamp values are used as indicators of QoS service at each router. The collected measurements are then processed at the sending host to infer QoS parameters in terms of path capacity in bit/sec, available bandwidth in bits/sec, individual link utilization and congestion at each router. These parameters can be combined to infer the QoS service in terms of bandwidth on the end-to-end path.Type: ApplicationFiled: March 23, 2010Publication date: July 15, 2010Inventors: Johnny Mikhael Matta, Ravi Kumar Jain
-
Patent number: 7729268Abstract: A method of estimating bandwidth capacity, available bandwidth and utilization along a path in an IP network is disclosed. ICMP time-stamp requests are sent from a source host on the edge or inside the network to all routers on the end-to-end path to a desired destination. Differences between time-stamp values are used as indicators of QoS service at each router. The collected measurements are then processed at the sending host to infer QoS parameters in terms of path capacity in bit/sec, available bandwidth in bits/sec, individual link utilization and congestion at each router. These parameters can be combined to infer the QoS service in terms of bandwidth on the end-to-end path.Type: GrantFiled: March 9, 2004Date of Patent: June 1, 2010Assignee: NTT DoCoMo, Inc.Inventors: Johnny Mikhael Matta, Ravi Kumar Jain
-
Publication number: 20100005309Abstract: Methods, components, and systems for efficient authentication, either through a digital signature or message authentication codes, and verification of a digital stream sent from a source to a receiver via zero or more intermediaries, such that the source or intermediary (or both) can remove certain portions of the data stream without inhibiting the ability of the ultimate receiver to verify the authenticity and integrity of the data received. According to the invention, a source may sign an entire data stream once, but may permit either itself or an intermediary to efficiently remove certain portions of the stream before transmitting the stream to the ultimate recipient, without having to re-sign the entire stream. Applications may include the signing of media streams which often need to be further processed to accommodate the resource requirements of a particular environment. Another application allows an intermediary to choose an advertisement to include in a given slot.Type: ApplicationFiled: September 16, 2009Publication date: January 7, 2010Inventors: Craig B. Gentry, Alejandro Hevia, Ravi Kumar Jain, Toshiro Kawahara, Zulfikar Amin Ramzan
-
Publication number: 20100005310Abstract: Methods, components, and systems for efficient authentication, either through a digital signature or message authentication codes, and verification of a digital stream sent from a source to a receiver via zero or more intermediaries, such that the source or intermediary (or both) can remove certain portions of the data stream without inhibiting the ability of the ultimate receiver to verify the authenticity and integrity of the data received. According to the invention, a source may sign an entire data stream once, but may permit either itself or an intermediary to efficiently remove certain portions of the stream before transmitting the stream to the ultimate recipient, without having to re-sign the entire stream. Applications may include the signing of media streams which often need to be further processed to accommodate the resource requirements of a particular environment. Another application allows an intermediary to choose an advertisement to include in a given slot.Type: ApplicationFiled: September 16, 2009Publication date: January 7, 2010Inventors: Craig B. Gentry, Alejandro Hevia, Ravi Kumar Jain, Toshiro Kawahara, Zulfikar Amin Ramzan
-
Patent number: 7447148Abstract: A method supports scalable and reliable multicast in a wireless network with a large bandwidth-delay product. In this method, acknowledgement packets from different receivers experiencing the same number of data packets lost are assigned the same time slots. This method can be combined with other loss recovery techniques, such as forward error correction (FEC) recovery, proactive protection, feedback suppression and collision detection. Scalability is achieved as bandwidth usage relates only to the number of packets transmitted, rather than the number of receivers.Type: GrantFiled: October 14, 2004Date of Patent: November 4, 2008Assignee: NTT DoCoMo, Inc.Inventors: Xia Gao, Fujio Watanabe, Gang Wu, Ravi Kumar Jain, Toshiro Kawahara
-
Publication number: 20080259813Abstract: A method of estimating bandwidth capacity, available bandwidth and utilization along a path in an IP network is disclosed. ICMP time-stamp requests are sent from a source host on the edge or inside the network to all routers on the end-to-end path to a desired destination. Differences between time-stamp values are used as indicators of QoS service at each router. The collected measurements are then processed at the sending host to infer QoS parameters in terms of path capacity in bit/sec, available bandwidth in bits/sec, individual link utilization and congestion at each router. These parameters can be combined to infer the QoS service in terms of bandwidth on the end-to-end path.Type: ApplicationFiled: April 29, 2008Publication date: October 23, 2008Inventors: Johnny Mikhael Matta, Ravi Kumar Jain
-
Patent number: 7395073Abstract: A method for location estimation employs filtering in both the radio signal domain and the space domain separately. The method filters raw values of the run-time radio signal measurements to reject distorted inputs. A region of confidence (RoC) is formed according to certain algorithms. Only location estimates falling within the RoC are considered for further processing. The location estimate candidates filtered by the RoC are put in a number of time-indexed bins. Each of the bins contains location estimate candidates obtained at similar times. A shortest route connecting a candidate from each bin is calculated to further improve the accuracy of the location estimation.Type: GrantFiled: March 2, 2004Date of Patent: July 1, 2008Assignee: NTT DoCoMo Inc.Inventors: Youngjune Lee Gwon, Ravi Kumar Jain, Toshiro Kawahara
-
Patent number: 7257411Abstract: In an RF environment serviced by 802.11, Bluetooth(™), or other network transmitters, or combinations, location-estimation methods and systems can advantageously use redundancy to refine an estimated location of an RF receiver. In one embodiment, a method for finding a receiver's location includes receiving signals from fixed transmitters, calculating preliminary location estimates, and combining the estimates using predetermined reference information on the RF environment. The reference information preferably includes minimum mean-squared error optimizing coefficients.Type: GrantFiled: December 27, 2002Date of Patent: August 14, 2007Assignee: NTT DoCoMo, Inc.Inventors: Youngjune Lee Gwon, Ravi Kumar Jain, Toshiro Kawahara
-
Publication number: 20040248589Abstract: A method for location estimation employs filtering in both the radio signal domain and the space domain separately. The method filters raw values of the run-time radio signal measurements to reject distorted inputs. A region of confidence (RoC) is formed according to certain algorithms. Only location estimates falling within the RoC are considered for further processing. The location estimate candidates filtered by the RoC are put in a number of time-indexed bins. Each of the bins contains location estimate candidates obtained at similar times. A shortest route connecting a candidate from each bin is calculated to further improve the accuracy of the location estimation.Type: ApplicationFiled: March 2, 2004Publication date: December 9, 2004Applicant: DoCoMo Communications Laboratories USA, Inc.Inventors: Youngjune Lee Gwon, Ravi Kumar Jain, Toshiro Kawahara
-
Publication number: 20040203904Abstract: In an RF environment serviced by 802.11, Bluetooth (TM), or other network transmitters, or combinations, location-estimation methods and systems can advantageously use redundancy to refine an estimated location of an RF receiver. In one embodiment, a method for finding a receiver's location includes receiving signals from fixed transmitters, calculating preliminary location estimates, and combining the estimates using predetermined reference information on the RF environment. The reference information preferably includes minimum mean-squared error optimizing coefficients.Type: ApplicationFiled: December 27, 2002Publication date: October 14, 2004Applicant: DoCoMo Communications Laboratories USA, Inc.Inventors: Youngjune Lee Gwon, Ravi Kumar Jain, Toshiro Kawahara
-
Patent number: 6526038Abstract: A periodic wireless data transmission has improved access latency obtaining information regarding users' interest in the information and by arranging the information on an transmission in order of descending popularity. In one embodiment, each adjacent pair of topics on the transmission. The topics' positions on the transmission are exchanged if the exchange decreases the average latency for all users. This may be repeated for all of the topics on the transmission. The transmission structure may also be arranged so that the transmission combines a number of transmission channels to obtain greater aggregate capacity. This may be done using, for example, an FDMA transmission structured to be theoretically comparable to a plurality of “striped” disks known as a RAID (redundant array of inexpensive disks).Type: GrantFiled: November 5, 1998Date of Patent: February 25, 2003Assignees: Telcordia Technologies, Inc., University of TexasInventors: Ravi Kumar Jain, John St. Clair Werth, Jr.
-
Patent number: 6463270Abstract: A communications network may include a translation server containing a NGPN-to-HLR mapping table. The translation server may be a single, centralized translation server; or several TSs may be on the network. When a number of translation servers are used, a VLR or other network entity receiving an NGPN determines which translation server contains the mapping for that NGPN. One way to do this is when a subscriber roams out of his “home” region, his NGPN is presented to the “foreign” service provider's TS. The foreign TS broadcasts a query to all other TSs in the network either simultaneously or in stages. Another way is that a VLR receiving a NGPN performs a hash function on the NGPN. The hash function identifies a translation server. The VLR may then query the translation server and obtain the NGPN-to-HLR mapping. Where a hash function is used, an extendable hash function to accommodate the addition of new TSs without changing the VLR operating systems.Type: GrantFiled: January 26, 1996Date of Patent: October 8, 2002Assignee: Telcordia Technologies, Inc.Inventors: Li-Fung Chang, Ravi Kumar Jain, Subhashini Rajagopalan
-
Patent number: 6085101Abstract: A communications network simultaneously transmits a single message to a number of recipients. This is called a "multicast" transmission. The communications network should have a recipient list database (1302) to receive a list of recipient addresses, a message database (1304) to receive and store the message, and a message delivery system (1306) to send the message to a number of recipients. The communications network may be adapted to collect acknowledgements or responses to a multicast message. If so, the communications network should have a calling record (1308) for storing message delivery information, a response record (1310) for receiving and storing recipient response information, a response processor (1312) for processing the response information, and a response delivery system (1314) for delivering the processed response.Type: GrantFiled: May 17, 1996Date of Patent: July 4, 2000Assignee: Telcordia Technologies, Inc.Inventors: Ravi Kumar Jain, Michael Kramer