Patents by Inventor Arun P Kannu

Arun P Kannu 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: 8503547
    Abstract: Systems and methodologies are described that facilitate employing a scrambling code from a set of scrambling codes, which is indexed by primary synchronization codes (PSCs), to scramble or descramble a secondary synchronization code (SSC). The scrambling codes in the set can be designed to optimize peak-to-average power ratios and/or mitigate cross correlation. For example, the scrambling codes can be based on different M-sequences generated from disparate polynomials. In accordance with another example, the scrambling codes can be based on different cyclic shifts of the same M-sequence. According to another example, the scrambling codes can be based upon binary approximations of possible primary synchronization codes utilized in a wireless communication environment. Pursuant to a further example, the scrambling codes can be based on different Golay complementary sequences.
    Type: Grant
    Filed: October 6, 2008
    Date of Patent: August 6, 2013
    Assignee: Qualcomm Incorporated
    Inventors: Tao Luo, Arun P. Kannu, Ke Liu, Peter Gaal
  • Publication number: 20090122839
    Abstract: Systems and methodologies are described that facilitate employing a scrambling code from a set of scrambling codes, which is indexed by primary synchronization codes (PSCs), to scramble or descramble a secondary synchronization code (SSC). The scrambling codes in the set can be designed to optimize peak-to-average power ratios and/or mitigate cross correlation. For example, the scrambling codes can be based on different M-sequences generated from disparate polynomials. In accordance with another example, the scrambling codes can be based on different cyclic shifts of the same M-sequence. According to another example, the scrambling codes can be based upon binary approximations of possible primary synchronization codes utilized in a wireless communication environment. Pursuant to a further example, the scrambling codes can be based on different Golay complementary sequences.
    Type: Application
    Filed: October 6, 2008
    Publication date: May 14, 2009
    Applicant: QUALCOMM Incorporated
    Inventors: Tao Luo, Arun P Kannu, Ke Liu, Peter Gaal