Rapid code acquisition algorithm employing PN matched filters

by: YT Su

Communications, IEEE Transactions on, Vol. 36, No. 6. (1988), pp. 724-733.

View FullText article

DOI, IEEE Explore

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

dcastro

Find related articles with these CiteULike tags

acquisition, code, fast, pn

Abstract

The performance of four algorithms using pseudonoise matched filters (PNMFs), for direct-sequence spread-spectrum systems, is analyzed. They are: parallel search with fix dwell detector (PL-FDD), parallel search with sequential detector (PL-SD), parallel-serial search with fix dwell detector (PS-FDD), and parallel-serial search with sequential detector (PS-SD). The operation characteristic for each detector and the mean acquisition time for each algorithm are derived. All the algorithms are studied in conjunction with the noncoherent integration technique, which enables the system to operate in the presence of data modulation. Several previous proposal using PNMF are seen as special cases of the present algorithms

@article{citeulike:2764009, abstract = {The performance of four algorithms using pseudonoise matched filters (PNMFs), for direct-sequence spread-spectrum systems, is analyzed. They are: parallel search with fix dwell detector (PL-FDD), parallel search with sequential detector (PL-SD), parallel-serial search with fix dwell detector (PS-FDD), and parallel-serial search with sequential detector (PS-SD). The operation characteristic for each detector and the mean acquisition time for each algorithm are derived. All the algorithms are studied in conjunction with the noncoherent integration technique, which enables the system to operate in the presence of data modulation. Several previous proposal using PNMF are seen as special cases of the present algorithms}, author = {Su, Y. T. }, booktitle = {Communications, IEEE Transactions on}, citeulike-article-id = {2764009}, doi = {10.1109/26.2793}, journal = {Communications, IEEE Transactions on}, keywords = {acquisition, code, fast, pn}, number = {6}, pages = {724--733}, posted-at = {2008-05-07 07:43:27}, priority = {2}, title = {Rapid code acquisition algorithm employing PN matched filters}, url = {http://dx.doi.org/10.1109/26.2793}, volume = {36}, year = {1988} }

RIS record

TY - JOUR ID - citeulike:2764009 L3 - citeulike-article-id:2764009 TI - Rapid code acquisition algorithm employing PN matched filters T2 - Communications, IEEE Transactions on JF - Communications, IEEE Transactions on VL - 36 IS - 6 SP - 724 EP - 733 N2 - The performance of four algorithms using pseudonoise matched filters (PNMFs), for direct-sequence spread-spectrum systems, is analyzed. They are: parallel search with fix dwell detector (PL-FDD), parallel search with sequential detector (PL-SD), parallel-serial search with fix dwell detector (PS-FDD), and parallel-serial search with sequential detector (PS-SD). The operation characteristic for each detector and the mean acquisition time for each algorithm are derived. All the algorithms are studied in conjunction with the noncoherent integration technique, which enables the system to operate in the presence of data modulation. Several previous proposal using PNMF are seen as special cases of the present algorithms KW - acquisition KW - code KW - fast KW - pn AU - Su, YT PY - 1988/// UR - http://dx.doi.org/10.1109/26.2793 ER -

RIS BibTeX