Patents by Inventor Ajay Bhaskaran

Ajay Bhaskaran 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: 20190277339
    Abstract: The present invention relates to a Zinc free High Performance bearing oil composition for Lubrication of Bearings, Gears & Allied Equipments in Wire Rod Mill (WRM) for Steel Plants.
    Type: Application
    Filed: March 6, 2019
    Publication date: September 12, 2019
    Applicant: INDIAN OIL CORPORATION LIMITED
    Inventors: Anil Kumar JAISWAL, Kannan SETHURAMAN, Sumit BHASKARAN, Rameshwar CHAUDHARY, Rajendra MAHAPATRA, Ajay Kumar HARINARAIN, Deepak SAXENA, Sanjiv Kumar MAZUMDAR, Sankara Sri Venkata RAMAKUMAR
  • Patent number: 8068549
    Abstract: A trellis decoder decodes a stream of encoded symbols, including symbols of a first type (e.g. symbols encoded with a first trellis code) and symbols of a second type (e.g. encoded with a second, more robust, trellis code), without storing path indicators along a trellis for symbols of the first type. In this way, limited memory may be used to store path indicators along the trellis for symbols of the second type. This allows for more accurate decoding of the symbols of the second type. For transitions from symbols of the second type to symbols of the first type, states of the trellis decoder may be stored. In this way, paths may be traced back along the trellis for trellis decoding, without the path indicators for the symbols of the first type.
    Type: Grant
    Filed: June 8, 2010
    Date of Patent: November 29, 2011
    Assignee: Broadcom Corporation
    Inventors: Haosong Fu, Azzedine Touzni, Raghuram Behara, Ajay Bhaskaran, Samir N. Hulyalkar
  • Patent number: 7873101
    Abstract: A digital filter pre-calculates C(1)*S(n?1), C(2)*S(n?2) . . . C(p?1)*S(n?p+1), prior to the arrival of sample S(n). As such y ? ( n ) = ? k = 0 k = p - 1 ? C ? ( k ) * S ? ( n - k ) may be calculated as a result of a single further multiply and accumulate operation, upon arrival of the symbol S(n). This, significantly reduces the latency of the filter.
    Type: Grant
    Filed: March 25, 2005
    Date of Patent: January 18, 2011
    Assignee: Broadcom Corporation
    Inventors: Raghuram P. Behara, Thomas J. Meyer, Yiwen Yu, Ajay Bhaskaran, Raul A. Casas
  • Publication number: 20100246733
    Abstract: A trellis decoder decodes a stream of encoded symbols, including symbols of a first type (e.g. symbols encoded with a first trellis code) and symbols of a second type (e.g. encoded with a second, more robust, trellis code), without storing path indicators along a trellis for symbols of the first type. In this way, limited memory may be used to store path indicators along the trellis for symbols of the second type. This allows for more accurate decoding of the symbols of the second type. For transitions from symbols of the second type to symbols of the first type, states of the trellis decoder may be stored. In this way, paths may be traced back along the trellis for trellis decoding, without the path indicators for the symbols of the first type.
    Type: Application
    Filed: June 8, 2010
    Publication date: September 30, 2010
    Inventors: Haosong Fu, Azzedine Touzni, Raghuram Behara, Ajay Bhaskaran, Samir N. Hulyalkar
  • Patent number: 7733972
    Abstract: A trellis decoder decodes a stream of encoded symbols, including symbols of a first type (e.g. symbols encoded with a first trellis code) and symbols of a second type (e.g. encoded with a second, more robust, trellis code), without storing path indicators along a trellis for symbols of the first type. In this way, limited memory may be used to store path indicators along the trellis for symbols of the second type. This allows for more accurate decoding of the symbols of the second type. For transitions from symbols of the second type to symbols of the first type, states of the trellis decoder may be stored. In this way, paths may be traced back along the trellis for trellis decoding, without the path indicators for the symbols of the first type.
    Type: Grant
    Filed: October 26, 2004
    Date of Patent: June 8, 2010
    Inventors: Haosong Fu, Azzedine Touzni, Raghuram Behara, Ajay Bhaskaran, Samir N. Hulyalkar
  • Publication number: 20060215746
    Abstract: A digital filter pre-calculates C(1)*S(n?1), C(2)*S(n?2) . . . C(p?1)*S(n?p+1), prior to the arrival of sample S(n). As such y ? ( n ) = ? k = 0 k = p - 1 ? C ? ( k ) * S ? ( n - k ) may be calculated as a result of a single further multiply and accumulate operation, upon arrival of the symbol S(n). This, significantly reduces the latency of the filter.
    Type: Application
    Filed: March 25, 2005
    Publication date: September 28, 2006
    Applicant: ATI Technologies Inc.
    Inventors: Raghuram Behara, Thomas Meyer, Yiwen Yu, Ajay Bhaskaran, Raul Casas
  • Publication number: 20060088119
    Abstract: A trellis decoder decodes a stream of encoded symbols, including symbols of a first type (e.g. symbols encoded with a first trellis code) and symbols of a second type (e.g. encoded with a second, more robust, trellis code), without storing path indicators along a trellis for symbols of the first type. In this way, limited memory may be used to store path indicators along the trellis for symbols of the second type. This allows for more accurate decoding of the symbols of the second type. For transitions from symbols of the second type to symbols of the first type, states of the trellis decoder may be stored. In this way, paths may be traced back along the trellis for trellis decoding, without the path indicators for the symbols of the first type.
    Type: Application
    Filed: October 26, 2004
    Publication date: April 27, 2006
    Applicant: ATI Technologies Inc.
    Inventors: Haosong Fu, Azzedine Touzni, Raghuram Behara, Ajay Bhaskaran, Samir Hulyalkar