11. Appendix – Construction of Zadoff-Chu sequences
Let N be an odd number. Let M be an integer between 1 and N and prime with N. The Zadoff-Chu sequence {z k } of length N (k = 0...N –1) is a sequence of complex symbols z k defined as follows
with :
- j :
- ...
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
The Ultimate Scientific and Technical Reference
This article is included in
Networks and Telecommunications
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
Appendix – Construction of Zadoff-Chu sequences
Bibliography
Exclusive to subscribers. 97% yet to be discovered!
You do not have access to this resource.
Click here to request your free trial access!
Already subscribed? Log in!
The Ultimate Scientific and Technical Reference