Please use this identifier to cite or link to this item: https://dspace.upt.ro/xmlui/handle/123456789/4055
Full metadata record
DC FieldValueLanguage
dc.contributor.authorEnescu, Andrei Alexandru-
dc.contributor.authorPaleologu, Constantin-
dc.contributor.authorCiochină, Silviu-
dc.date.accessioned2021-12-08T14:33:31Z-
dc.date.available2021-12-08T14:33:31Z-
dc.date.issued2004-
dc.identifier.citationEnescu, Andrei Alexandru. QRD-LSL algorithm suitable for implementation on D.S.P. . Timişoara: Editura Politehnica, 2004en_US
dc.identifier.urihttp://primo.upt.ro:1701/primo-explore/search?query=any,contains,QRD-LSL%20algorithm%20suitable%20for%20implementation%20on%20D.S.P.&tab=default_tab&search_scope=40TUT&vid=40TUT_V1&lang=ro_RO&offset=0 Link Primo-
dc.description.abstractThis paper deals with modifications brought to the QRD-LSL algorithm presented in [5], in order to implement it on Digital Signal Processor (DSP). It is necessary to choose a powerful processor, with a parallel architecture that allows several instructions to be executed simultaneously. This is the main reason for choosing Motorola SC140 processor. In addition, we have structured the algorithm in a way to allow a high complexity algorithm to be run in real-time in a specific application. The paper presents the main features of this DSP and then makes comparisons between the original algorithm, described in [1] and the improved version with low complexity.en_US
dc.language.isoenen_US
dc.publisherTimişoara : Editura Politehnicaen_US
dc.relation.ispartofseriesSeria electronică şi telecomunicaţii, Tom 49(63), fasc. 2 (2004)-
dc.subjectAdaptive lattice algorithmen_US
dc.subjectLeast squaresen_US
dc.subjectDigital Signal Processor (DSP)en_US
dc.titleQRD-LSL algorithm suitable for implementation on D.S.P. [articol]en_US
dc.typeArticleen_US
Appears in Collections:Articole științifice/Scientific articles

Files in This Item:
File Description SizeFormat 
BUPT_ART_Enescu_f.pdf642.81 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.