Phase Offsets for Binary Sequences Using Order and Index
Summary :
When a zero offset reference sequence is defined, the i-bit shifted sequence has phase offset i with respect to the reference sequence. In this letter, we propose a new algorithm to compute phase offsets for a periodic binary sequence using the concept of order and index of an integer based on the number theoretical approach. We define an offset evaluation function that is used to calculate the phase offset, and derive properties of the function. Once the function is computed, the phase offset of the sequence is simply obtained by taking the index of it. The new algorithm overcomes the restrictions found in conventional methods on the length and the number of '0's and '1's in binary codes. Its application to the code acquisition is also investigated to show the proposed method is useful.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E93-A No.9 pp.1697-1699
- Publication Date
- 2010/09/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E93.A.1697
- Type of Manuscript
- LETTER
- Category
- Coding Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Young-Joon SONG, "Phase Offsets for Binary Sequences Using Order and Index" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 9, pp. 1697-1699, September 2010, doi: 10.1587/transfun.E93.A.1697.
Abstract: When a zero offset reference sequence is defined, the i-bit shifted sequence has phase offset i with respect to the reference sequence. In this letter, we propose a new algorithm to compute phase offsets for a periodic binary sequence using the concept of order and index of an integer based on the number theoretical approach. We define an offset evaluation function that is used to calculate the phase offset, and derive properties of the function. Once the function is computed, the phase offset of the sequence is simply obtained by taking the index of it. The new algorithm overcomes the restrictions found in conventional methods on the length and the number of '0's and '1's in binary codes. Its application to the code acquisition is also investigated to show the proposed method is useful.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.1697/_p
Copy
@ARTICLE{e93-a_9_1697,
author={Young-Joon SONG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Phase Offsets for Binary Sequences Using Order and Index},
year={2010},
volume={E93-A},
number={9},
pages={1697-1699},
abstract={When a zero offset reference sequence is defined, the i-bit shifted sequence has phase offset i with respect to the reference sequence. In this letter, we propose a new algorithm to compute phase offsets for a periodic binary sequence using the concept of order and index of an integer based on the number theoretical approach. We define an offset evaluation function that is used to calculate the phase offset, and derive properties of the function. Once the function is computed, the phase offset of the sequence is simply obtained by taking the index of it. The new algorithm overcomes the restrictions found in conventional methods on the length and the number of '0's and '1's in binary codes. Its application to the code acquisition is also investigated to show the proposed method is useful.},
keywords={},
doi={10.1587/transfun.E93.A.1697},
ISSN={1745-1337},
month={September},}
Copy
TY - JOUR
TI - Phase Offsets for Binary Sequences Using Order and Index
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1697
EP - 1699
AU - Young-Joon SONG
PY - 2010
DO - 10.1587/transfun.E93.A.1697
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2010
AB - When a zero offset reference sequence is defined, the i-bit shifted sequence has phase offset i with respect to the reference sequence. In this letter, we propose a new algorithm to compute phase offsets for a periodic binary sequence using the concept of order and index of an integer based on the number theoretical approach. We define an offset evaluation function that is used to calculate the phase offset, and derive properties of the function. Once the function is computed, the phase offset of the sequence is simply obtained by taking the index of it. The new algorithm overcomes the restrictions found in conventional methods on the length and the number of '0's and '1's in binary codes. Its application to the code acquisition is also investigated to show the proposed method is useful.
ER -
English
