File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A recursive all-lag reference-code correlator for generating odd correlations

TitleA recursive all-lag reference-code correlator for generating odd correlations
Authors
Issue Date2000
PublisherIEEE, Computer Society.
Citation
Ieee Asia-Pacific Conference On Circuits And Systems - Proceedings, 2000, p. 666-669 How to Cite?
AbstractAn all-lag reference-code correlator generates an all-lag even- or odd-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 N 2, where N is the length of the reference code. In a previous paper, a recursive form for generating all-lag even correlations was derived. In this paper, we derive the recursive form for generating all-lag odd correlations. It is shown that the corresponding 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/46230
References

 

DC FieldValueLanguage
dc.contributor.authorNg, TSen_HK
dc.contributor.authorYip, KWen_HK
dc.contributor.authorCheng, CLen_HK
dc.date.accessioned2007-10-30T06:45:17Z-
dc.date.available2007-10-30T06:45:17Z-
dc.date.issued2000en_HK
dc.identifier.citationIeee Asia-Pacific Conference On Circuits And Systems - Proceedings, 2000, p. 666-669en_HK
dc.identifier.urihttp://hdl.handle.net/10722/46230-
dc.description.abstractAn all-lag reference-code correlator generates an all-lag even- or odd-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 N 2, where N is the length of the reference code. In a previous paper, a recursive form for generating all-lag even correlations was derived. In this paper, we derive the recursive form for generating all-lag odd correlations. It is shown that the corresponding 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.extent317281 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, Computer Society.en_HK
dc.relation.ispartofIEEE Asia-Pacific Conference on Circuits and Systems - Proceedingsen_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.titleA recursive all-lag reference-code correlator for generating odd correlationsen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailNg, TS:tsng@eee.hku.hken_HK
dc.identifier.authorityNg, TS=rp00159en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/APCCAS.2000.913608en_HK
dc.identifier.scopuseid_2-s2.0-2342557230en_HK
dc.identifier.hkuros58772-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-2342557230&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage666en_HK
dc.identifier.epage669en_HK
dc.identifier.scopusauthoridNg, TS=7402229975en_HK
dc.identifier.scopusauthoridYip, KW=7101909909en_HK
dc.identifier.scopusauthoridCheng, CL=7404797457en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats