File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Recursive all-lag reference-code correlator and its efficient implementation

TitleRecursive all-lag reference-code correlator and its efficient implementation
Authors
KeywordsAll-lag reference-code correlator
Recursive relationship
Low-complexity implementation
Spread spectrum
Parallel correlator
Issue Date2000
PublisherIEEE.
Citation
Proceedings - Ieee International Symposium On Circuits And Systems, 2000, v. 4, p. IV-473-IV-476 How to Cite?
AbstractAn all-lag reference-code correlator generates an all-lag correlation vector at a rate equal to the rate of incoming data samples. Direct implementation of an all-lag reference-code correlator requires N parallel correlators, and the resultant degree of complexity is of the order N2, where N is the length of the reference code. This paper derives a recursive form for the all-lag reference-code correlator. It is shown that the proposed recursive all-lag reference-code correlator can be implemented with a complexity approximately equal to that of a single parallel correlator. That is, the degree of complexity of the proposed recursive all-lag reference-code correlator is of the order N. Thus, substantial reduction in the implementation complexity is achieved.
Persistent Identifierhttp://hdl.handle.net/10722/46195
ISSN

 

DC FieldValueLanguage
dc.contributor.authorNg, Tony TSen_HK
dc.contributor.authorYip, KunWahen_HK
dc.contributor.authorCheng, ChinLongen_HK
dc.date.accessioned2007-10-30T06:44:33Z-
dc.date.available2007-10-30T06:44:33Z-
dc.date.issued2000en_HK
dc.identifier.citationProceedings - Ieee International Symposium On Circuits And Systems, 2000, v. 4, p. IV-473-IV-476en_HK
dc.identifier.issn0271-4310en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46195-
dc.description.abstractAn all-lag reference-code correlator generates an all-lag correlation vector at a rate equal to the rate of incoming data samples. Direct implementation of an all-lag reference-code correlator requires N parallel correlators, and the resultant degree of complexity is of the order N2, where N is the length of the reference code. This paper derives a recursive form for the all-lag reference-code correlator. It is shown that the proposed recursive all-lag reference-code correlator can be implemented with a complexity approximately equal to that of a single parallel correlator. That is, the degree of complexity of the proposed recursive all-lag reference-code correlator is of the order N. Thus, substantial reduction in the implementation complexity is achieved.en_HK
dc.format.extent293253 bytes-
dc.format.extent21012 bytes-
dc.format.extent21377 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofProceedings - IEEE International Symposium on Circuits and Systemsen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2000 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.subjectAll-lag reference-code correlatoren_HK
dc.subjectRecursive relationshipen_HK
dc.subjectLow-complexity implementationen_HK
dc.subjectSpread spectrumen_HK
dc.subjectParallel correlatoren_HK
dc.titleRecursive all-lag reference-code correlator and its efficient implementationen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0271-4302&volume=4&spage=473&epage=476&date=2000&atitle=Recursive+all-lag+reference-code+correlator+and+its+efficient+implementationen_HK
dc.identifier.emailNg, Tony TS:tsng@eee.hku.hken_HK
dc.identifier.authorityNg, Tony TS=rp00159en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/ISCAS.2000.858791en_HK
dc.identifier.scopuseid_2-s2.0-0033684524en_HK
dc.identifier.hkuros52737-
dc.identifier.volume4en_HK
dc.identifier.spageIVen_HK
dc.identifier.epage473en_HK
dc.identifier.scopusauthoridNg, Tony TS=7402229975en_HK
dc.identifier.scopusauthoridYip, KunWah=7101909909en_HK
dc.identifier.scopusauthoridCheng, ChinLong=7404797457en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats