The search functionality is under construction.

The search functionality is under construction.

For the blind estimation of short-code direct sequence spread spectrum (DSSS) signal pseudo-noise (PN) sequences, the eigenvalue decomposition (EVD) algorithm, the singular value decomposition (SVD) algorithm and the double-periodic projection approximation subspace tracking with deflation (DPASTd) algorithm are often used to estimate the PN sequence. However, when the asynchronous time delay is unknown, the largest eigenvalue and the second largest eigenvalue may be very close, resulting in the estimated largest eigenvector being any non-zero linear combination of the really required largest eigenvector and the really required second largest eigenvector. In other words, the estimated largest eigenvector exhibits unitary ambiguity. This degrades the performance of any algorithm estimating the PN sequence from the estimated largest eigenvector. To tackle this problem, this paper proposes a spreading sequence blind estimation algorithm based on the rotation matrix. First of all, the received signal is divided into two-information-period-length temporal vectors overlapped by one-information-period. The SVD or DPASTd algorithm can then be applied to obtain the largest eigenvector and the second largest eigenvector. The matrix composed of the largest eigenvector and the second largest eigenvector can be rotated by the rotation matrix to eliminate any unitary ambiguity. In this way, the best estimation of the PN sequence can be obtained. Simulation results show that the proposed algorithm not only solves the problem of estimating the PN sequence when the largest eigenvalue and the second largest eigenvalue are close, but also performs well at low signal-to-noise ratio (SNR) values.

- Publication
- IEICE TRANSACTIONS on Communications Vol.E103-B No.9 pp.979-988

- Publication Date
- 2020/09/01

- Publicized
- 2020/03/03

- Online ISSN
- 1745-1345

- DOI
- 10.1587/transcom.2019EBP3147

- Type of Manuscript
- PAPER

- Category
- Wireless Communication Technologies

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.

Copy

Kejun LI, Yong GAO, "Using the Rotation Matrix to Eliminate the Unitary Ambiguity in the Blind Estimation of Short-Code DSSS Signal Pseudo-Code" in IEICE TRANSACTIONS on Communications,
vol. E103-B, no. 9, pp. 979-988, September 2020, doi: 10.1587/transcom.2019EBP3147.

Abstract: For the blind estimation of short-code direct sequence spread spectrum (DSSS) signal pseudo-noise (PN) sequences, the eigenvalue decomposition (EVD) algorithm, the singular value decomposition (SVD) algorithm and the double-periodic projection approximation subspace tracking with deflation (DPASTd) algorithm are often used to estimate the PN sequence. However, when the asynchronous time delay is unknown, the largest eigenvalue and the second largest eigenvalue may be very close, resulting in the estimated largest eigenvector being any non-zero linear combination of the really required largest eigenvector and the really required second largest eigenvector. In other words, the estimated largest eigenvector exhibits unitary ambiguity. This degrades the performance of any algorithm estimating the PN sequence from the estimated largest eigenvector. To tackle this problem, this paper proposes a spreading sequence blind estimation algorithm based on the rotation matrix. First of all, the received signal is divided into two-information-period-length temporal vectors overlapped by one-information-period. The SVD or DPASTd algorithm can then be applied to obtain the largest eigenvector and the second largest eigenvector. The matrix composed of the largest eigenvector and the second largest eigenvector can be rotated by the rotation matrix to eliminate any unitary ambiguity. In this way, the best estimation of the PN sequence can be obtained. Simulation results show that the proposed algorithm not only solves the problem of estimating the PN sequence when the largest eigenvalue and the second largest eigenvalue are close, but also performs well at low signal-to-noise ratio (SNR) values.

URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2019EBP3147/_p

Copy

@ARTICLE{e103-b_9_979,

author={Kejun LI, Yong GAO, },

journal={IEICE TRANSACTIONS on Communications},

title={Using the Rotation Matrix to Eliminate the Unitary Ambiguity in the Blind Estimation of Short-Code DSSS Signal Pseudo-Code},

year={2020},

volume={E103-B},

number={9},

pages={979-988},

abstract={For the blind estimation of short-code direct sequence spread spectrum (DSSS) signal pseudo-noise (PN) sequences, the eigenvalue decomposition (EVD) algorithm, the singular value decomposition (SVD) algorithm and the double-periodic projection approximation subspace tracking with deflation (DPASTd) algorithm are often used to estimate the PN sequence. However, when the asynchronous time delay is unknown, the largest eigenvalue and the second largest eigenvalue may be very close, resulting in the estimated largest eigenvector being any non-zero linear combination of the really required largest eigenvector and the really required second largest eigenvector. In other words, the estimated largest eigenvector exhibits unitary ambiguity. This degrades the performance of any algorithm estimating the PN sequence from the estimated largest eigenvector. To tackle this problem, this paper proposes a spreading sequence blind estimation algorithm based on the rotation matrix. First of all, the received signal is divided into two-information-period-length temporal vectors overlapped by one-information-period. The SVD or DPASTd algorithm can then be applied to obtain the largest eigenvector and the second largest eigenvector. The matrix composed of the largest eigenvector and the second largest eigenvector can be rotated by the rotation matrix to eliminate any unitary ambiguity. In this way, the best estimation of the PN sequence can be obtained. Simulation results show that the proposed algorithm not only solves the problem of estimating the PN sequence when the largest eigenvalue and the second largest eigenvalue are close, but also performs well at low signal-to-noise ratio (SNR) values.},

keywords={},

doi={10.1587/transcom.2019EBP3147},

ISSN={1745-1345},

month={September},}

Copy

TY - JOUR

TI - Using the Rotation Matrix to Eliminate the Unitary Ambiguity in the Blind Estimation of Short-Code DSSS Signal Pseudo-Code

T2 - IEICE TRANSACTIONS on Communications

SP - 979

EP - 988

AU - Kejun LI

AU - Yong GAO

PY - 2020

DO - 10.1587/transcom.2019EBP3147

JO - IEICE TRANSACTIONS on Communications

SN - 1745-1345

VL - E103-B

IS - 9

JA - IEICE TRANSACTIONS on Communications

Y1 - September 2020

AB - For the blind estimation of short-code direct sequence spread spectrum (DSSS) signal pseudo-noise (PN) sequences, the eigenvalue decomposition (EVD) algorithm, the singular value decomposition (SVD) algorithm and the double-periodic projection approximation subspace tracking with deflation (DPASTd) algorithm are often used to estimate the PN sequence. However, when the asynchronous time delay is unknown, the largest eigenvalue and the second largest eigenvalue may be very close, resulting in the estimated largest eigenvector being any non-zero linear combination of the really required largest eigenvector and the really required second largest eigenvector. In other words, the estimated largest eigenvector exhibits unitary ambiguity. This degrades the performance of any algorithm estimating the PN sequence from the estimated largest eigenvector. To tackle this problem, this paper proposes a spreading sequence blind estimation algorithm based on the rotation matrix. First of all, the received signal is divided into two-information-period-length temporal vectors overlapped by one-information-period. The SVD or DPASTd algorithm can then be applied to obtain the largest eigenvector and the second largest eigenvector. The matrix composed of the largest eigenvector and the second largest eigenvector can be rotated by the rotation matrix to eliminate any unitary ambiguity. In this way, the best estimation of the PN sequence can be obtained. Simulation results show that the proposed algorithm not only solves the problem of estimating the PN sequence when the largest eigenvalue and the second largest eigenvalue are close, but also performs well at low signal-to-noise ratio (SNR) values.

ER -