Einzeltreffer — DigiBib

The present invention generates exponents of elements of a Zadoff-Chu sequence representing a preamble for uplink synchronization of mobile stations or a mobile station reference signal by first obtaining (S1) a preamble index defining the Zadoff-Chu sequence. Then it determines an initial exponent (S3) of the first element in the Zadoff-Chu sequence and an initial first difference (S2, S4) between exponents of consecutive elements of the Zadoff-Chu sequence. Finally it determines (S5-S9) exponents of the remaining elements in the Zad-off-Chu sequence from the initial first difference and the initial exponent in an iterative procedure that avoids multiplication operations.

Titel:	Efficient Zadoff-Chu Sequence Generation
Autor/in / Beteiligte Person:	Mauritz, Oskar
Link:	View record in USPTO Patent Applications (Volltext)
Veröffentlichung:	2011
Medientyp:	Patent
Sonstiges:	Nachgewiesen in: USPTO Patent Applications Sprachen: English Document Number: 20110176406 Publication Date: July 21, 2011 Appl. No: 13/060024 Application Filed: August 22, 2008 Assignees: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) (Stockholm, SE) Claim: 1-20. (canceled) Claim: 21. A method of generating exponents of elements of a Zadoff-Chu sequence that represents either a mobile station reference signal or a preamble for uplink synchronization of mobile stations, wherein the Zadoff-Chu sequence is of length N, where N is odd, said method comprising: obtaining an index defining the Zadoff-Chu sequence; determining an initial exponent of the first element in the Zadoff-Chu sequence; determining an initial first difference between exponents of consecutive elements of the Zadoff-Chu sequence; and determining exponents of the remaining elements in the Zadoff-Chu sequence from the initial first difference and the initial exponent in an iterative procedure that avoids multiplication operations. Claim: 22. The method of claim 21, wherein the initial exponent a(0) and the initial first difference d(1)(0) are determined as: [mathematical expression included] [mathematical expression included] where u−1 is the modulo N inverse of the obtained index u; and wherein the iterative procedure for determining exponents a(k), k=1 . . . N−1 of the remaining elements in the Zadoff-Chu sequence is defined as: for k=1 . . . N−1 d(1)(k)=(d(1)(k−1)−u−1)mod N a(k)=(a(k−1)+d(1)(k))mod N end. Claim: 23. The method of claim 21, wherein the initial exponent a(0) and the initial first difference d(1)(0) are determined as: [mathematical expression included] [mathematical expression included] where u−1 is the modulo N inverse of the obtained index u; and wherein the iterative procedure for determining exponents a(k), k=1 . . . N−1 of the remaining elements in the Zadoff-Chu sequence is defined as: for k=1 . . . N−1 d(1)(k)=d(1)(k−1)−u−1 if d(1)(k)<0 then d(1)(k)=d(1)(k)+N a(k)=a(k−1)+d(1)(k) if a(k)>N−1 then a(k)=a(k)−N end. Claim: 24. The method of claim 21, wherein the initial exponent a(0) and the initial first difference d(1)(0) are set to zero; and wherein the iterative procedure for determining exponents a(n), n=1 . . . N−1 of the remaining elements in the Zadoff-Chu sequence is defined as: for n=1 . . . N−1 d(1)(n)=(d(1)(n−1)+u)mod N a(n)=(a(n−1)+d(1)(n))mod N end where u is the obtained index. Claim: 25. The method of claim 21, wherein the initial exponent a(0) and the initial first difference d(1)(0) are set to zero; and wherein the iterative procedure for determining exponents a(n), n=1 . . . N−1 of the remaining elements in the Zadoff-Chu sequence is defined as: for n=1 . . . N−1 d(1)(n)=d(1)(n−1)+u if d(1)(n)<0 then d(1)(n)=d(1)(n)+N a(n)=a(n−1)+d(1)(n) if a(n)>N−1 then a(n)=a(n)−N end where u is the obtained index. Claim: 26. An apparatus configured to generate exponents of elements of a Zadoff-Chu sequence that represents either a mobile station reference signal or a preamble for uplink synchronization of mobile stations, wherein the Zadoff-Chu sequence is of length N, where N is odd, said apparatus comprising: an initial value provider configured to determine an initial exponent of the first element of the Zadoff-Chu sequence, and an initial first difference between exponents of consecutive elements of the same Zadoff-Chu sequence; and an iteration unit configured to determine exponents of the remaining elements in the Zadoff-Chu sequence from the initial first difference and the initial exponent in an iterative procedure that avoids multiplication operations. Claim: 27. The apparatus of claim 26, wherein the initial value provider is configured to determine the initial exponent a(0) and the initial first difference d(1)(0) as: [mathematical expression included] [mathematical expression included] where u−1 is the modulo N inverse of an index u defining the Zadoff-Chu sequence; and wherein the iteration unit is configured to determine exponents a(k), k=1 . . . N−1 of the remaining elements in the Zadoff-Chu sequence accordance with the iterative procedure: for k=1 . . . N−1 d(1)(k)=(d(1)(k−1)−u−1)mod N a(k)=(a(k−1)+d(1)(k))mod N end. Claim: 28. The apparatus of claim 26, wherein the initial value provider is configured to determine the initial exponent a(0) and the initial first difference d(1)(0) as: [mathematical expression included] [mathematical expression included] where u−1 is the modulo N inverse of an index u defining the Zadoff-Chu sequence; and wherein the iteration unit is configured to determine exponents a(k), k=1 . . . N−1 of the remaining elements in the Zadoff-Chu sequence in accordance with the iterative procedure: for k=1 . . . N−1 d(1)(k)=d(1)(k−1)−u−1 if d(1)(k)<0 then d(1)(k)=d(1)(k)+N a(k)=a(k−1)+d(1)(k) if a(k)>N−1 then a(k)=a(k)−N end. Claim: 29. The apparatus of claim 26, wherein the initial value provider is configured to set the initial exponent a(0) and the initial first difference d(1)(0) to zero; and wherein the iteration unit is configured to determine exponents a(n), n=1 . . . N−1 of the remaining elements in the Zadoff-Chu sequence accordance with the iterative procedure: for n=1 . . . N−1 d(1)(n)=d(1)(n−1)+u)mod N a(n)=(a(n−1)+d(1)(n))mod N end where u is an index defining the Zadoff-Chu sequence. Claim: 30. The apparatus of claim 29, wherein the apparatus is configured to generate exponents of elements of a Zadoff-Chu sequence that represents a preamble for uplink synchronization of mobile stations, and wherein the apparatus is included in a Zadoff-Chu sequence generator. Claim: 31. The apparatus of claim 30, wherein said Zadoff-Chu sequence generator is included in a mobile station. Claim: 32. The apparatus of claim 29, wherein the apparatus is configured to generate exponents of elements of a Zadoff-Chu sequence that represents a mobile station reference signal, and wherein the apparatus is included in a Zadoff-Chu sequence generator. Claim: 33. The apparatus of claim 32, wherein said Zadoff-Chu sequence generator is included in a mobile station. Claim: 34. The apparatus of claim 32, wherein said Zadoff-Chu sequence generator is included in a base station. Claim: 35. The apparatus of claim 26, wherein the initial value provider is configured to set the initial exponent a(0) and the initial first difference d(1)(0) to zero; and wherein the iteration unit is configured to determine exponents a(n), n=1 . . . N−1 of the remaining elements in the Zadoff-Chu sequence in accordance with the iterative procedure: for n=1 . . . N−1 d(1)(k)=d(1)(n−1)+u if d(1)(n)<0 then d(1)(n)=d(1)(n)+N a(n)=a(n−1)+d(1)(n) if a(n)>N−1 then a(n)=a(n)−N end. where u is an index defining the Zadoff-Chu sequence. Claim: 36. The apparatus of claim 35, wherein the apparatus is configured to generate exponents of elements of a Zadoff-Chu sequence that represents a preamble for uplink synchronization of mobile stations, and wherein the apparatus is included in a Zadoff-Chu sequence generator. Claim: 37. The apparatus of claim 36, wherein said Zadoff-Chu sequence generator is included in a mobile station. Claim: 38. The apparatus of claim 35, wherein the apparatus is configured to generate exponents of elements of a Zadoff-Chu sequence that represents a mobile station reference signal, and wherein the apparatus is included in a Zadoff-Chu sequence generator. Claim: 39. The apparatus of claim 38, wherein said Zadoff-Chu sequence generator is included in a mobile station. Claim: 40. The apparatus of claim 38, wherein said Zadoff-Chu sequence generator is included in a base station. Claim: 41. The apparatus of claim 26, wherein the apparatus is configured to generate exponents of elements of a Zadoff-Chu sequence that represents a preamble for uplink synchronization of mobile stations, and wherein the apparatus is included in a Zadoff-Chu sequence generator. Claim: 42. The apparatus of claim 41, wherein said Zadoff-Chu sequence generator is included in a mobile station. Claim: 43. A random access preamble receiver including a set of Zadoff-Chu sequence generators, each Zadoff-Chu sequence generator including an apparatus configured to generate exponents of elements of a Zadoff-Chu sequence that represents a preamble for uplink synchronization of mobile stations, wherein the Zadoff-Chu sequence is of length N, where N is odd, and wherein said apparatus comprises: an initial value provider configured to determine an initial exponent of the first element of the Zadoff-Chu sequence, and an initial first difference between exponents of consecutive elements of the same Zadoff-Chu sequence; and an iteration unit configured to determine exponents of the remaining elements in the Zadoff-Chu sequence from the initial first difference and the initial exponent in an iterative procedure that avoids multiplication operations. Claim: 44. The random access preamble receiver of claim 43, wherein the random access preamble receiver is included in a base station. Current U.S. Class: 370/208 Current International Class: 04

Klicken Sie ein Format an und speichern Sie dann die Daten oder geben Sie eine Empfänger-Adresse ein und lassen Sie sich per Email zusenden.

BibTeX Citavi, JabRef, u.a.
(Literaturverwaltung)

PDF kein Volltext!
(Merkzettel, Notizen)

RIS Endnote, Citavi u.a.
(Literaturverwaltung)

MODS
(XML zur Weiterverarbeitung)

oder

Wählen Sie das für Sie passende Zitationsformat und kopieren Sie es dann in die Zwischenablage, lassen es sich per Mail zusenden oder speichern es als PDF-Datei.

Gewünschter Zitations-Stil:

oder

Bitte prüfen Sie, ob die Zitation formal korrekt ist, bevor Sie sie in einer Arbeit verwenden. Benutzen Sie gegebenenfalls den "Exportieren"-Dialog, wenn Sie ein Literaturverwaltungsprogramm verwenden und die Zitat-Angaben selbst formatieren wollen.

Efficient Zadoff-Chu Sequence Generation