Invention Grant
US08112041B2 Systems and methods for generating sequences that are nearest to a set of sequences with minimum average cross-correlation 有权
用于产生最接近具有最小平均互相关的一组序列的序列的系统和方法

  • Patent Title: Systems and methods for generating sequences that are nearest to a set of sequences with minimum average cross-correlation
  • Patent Title (中): 用于产生最接近具有最小平均互相关的一组序列的序列的系统和方法
  • Application No.: US12530761
    Application Date: 2008-03-13
  • Publication No.: US08112041B2
    Publication Date: 2012-02-07
  • Inventor: John M. Kowalski
  • Applicant: John M. Kowalski
  • Applicant Address: JP Osaka
  • Assignee: Sharp Kabushiki Kaisha
  • Current Assignee: Sharp Kabushiki Kaisha
  • Current Assignee Address: JP Osaka
  • Agency: Austin Rapp & Hardman
  • International Application: PCT/JP2008/055154 WO 20080313
  • International Announcement: WO2008/114837 WO 20080925
  • Main IPC: H04B17/00
  • IPC: H04B17/00
Systems and methods for generating sequences that are nearest to a set of sequences with minimum average cross-correlation
Abstract:
A method for generating sequences that are nearest to a set of sequences with minimum average cross-correlation is described. Each element of a set of sequences is projected to a nearest constellation point. The set of sequences is converted into a time domain representation. An inverse discrete Fourier Transform (IDFT) is performed on the set of sequences. A cubic metric of each sequence of the set of sequences is evaluated. A sequence is removed from the set if the cubic metric exceeds a threshold. A minimum maximum cross-correlation is obtained for the set of sequences.
Information query
Patent Agency Ranking
0/0