Efficient realization structure of the a priori lattice-ladder recursive least squares algorithm
An efficient pipelined realization structure of the a priori lattice-ladder least squares multichannel algorithm is introduced. The structure is shown to exhibit great modularity and high parallelism. The architecture is evaluated for cost and data throughput delay assuming pipelined operations. It...
Uloženo v:
| Vydáno v: | IEEE transactions on signal processing Ročník 39; číslo 4; s. 992 - 996 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
01.04.1991
|
| Témata: | |
| ISSN: | 1053-587X |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | An efficient pipelined realization structure of the a priori lattice-ladder least squares multichannel algorithm is introduced. The structure is shown to exhibit great modularity and high parallelism. The architecture is evaluated for cost and data throughput delay assuming pipelined operations. It is demonstrated that the throughput rate of the structure is O(1) and the cost is O(l/sup 2/N), where l is the number of channels and N is the order of the filter.< > |
|---|---|
| AbstractList | An efficient pipelined realization structure of the a priori lattice-ladder least squares multichannel algorithm is introduced. The structure is shown to exhibit great modularity and high parallelism. The architecture is evaluated for cost and data throughput delay assuming pipelined operations. It is demonstrated that the throughput rate of the structure is < e1 > O < /e1 > (1) and the cost is < e1 > O < /e1 > ( < e1 > l < /e1 > (2 ) < e1 > N < /e1 > ), where < e1 > l < /e1 > is the number of channels and < e1 > N < /e1 > is the order of the filter An efficient pipelined realization structure of the a priori lattice-ladder least squares multichannel algorithm is introduced. The structure is shown to exhibit great modularity and high parallelism. The architecture is evaluated for cost and data throughput delay assuming pipelined operations. It is demonstrated that the throughput rate of the structure is O(1) and the cost is O(l/sup 2/N), where l is the number of channels and N is the order of the filter.< > |
| Author | Petropulu, A.P. Proakis, J.G. Nikias, C.L. |
| Author_xml | – sequence: 1 givenname: A.P. surname: Petropulu fullname: Petropulu, A.P. organization: Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA – sequence: 2 givenname: C.L. surname: Nikias fullname: Nikias, C.L. organization: Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA – sequence: 3 givenname: J.G. surname: Proakis fullname: Proakis, J.G. organization: Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA |
| BookMark | eNptkD1PwzAQQD0UibYgsbJ5QiwpdmLX9oiq8iFVYgGJLVycCzVyk9Z2kODXE1rEgJhuuPdOujcho7ZrkZAzzmacM3Ol9EwzU4gRGXMmi0xq9XxMJjG-McaFMPMxeVk2jbMO20QDgnefkFzX0phCb1MfkHYNTWukQLfBdcFRDyk5i5mHusYwSLYP0b0j9Qgx0bjrIWCk4F8HOq03J-SoAR_x9GdOydPN8nFxl60ebu8X16vM5kqkTFQMCgWGW8mlgBzzQkgxt3UlubAytwKUEQx1XeWNYLUyNa8sgtUobVXNiym5ONzdhm7XY0zlxkWL3kOLXR_LXOdGMaMHcHYAbehiDNiU1qX91ymA8yVn5Xe8UulyH28QLv8IQ4oNhI__0PMD6hDxFzvsvgDWrH0Q |
| CODEN | ITPRED |
| CitedBy_id | crossref_primary_10_1016_0165_1684_95_00071_K |
| Cites_doi | 10.1109/TASSP.1987.1165158 10.1109/TASSP.1984.1164325 10.1109/TASSP.1983.1164024 10.1109/TASSP.1986.1164878 10.1109/ICASSP.1980.1170850 10.1109/TASSP.1984.1164334 10.1109/TASSP.1986.1164877 10.1049/ip-f-1.1984.0012 10.1109/ICASSP.1977.1170231 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1109/78.80934 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EndPage | 996 |
| ExternalDocumentID | 10_1109_78_80934 80934 |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 53G 5GY 5VS 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACIWK ACKIV ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AJQPL AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 E.L EBS EJD F5P HZ~ H~9 ICLAB IFIPE IFJZH IPLJI JAVBF LAI MS~ O9- OCL P2P RIA RIE RNS TAE TN5 VH1 AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c274t-4b0a37a91c5154a2e234546cdb514c52c4a7940e8db2f40d79d1bceac8e5cbb63 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10_1109_78_80934&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1053-587X |
| IngestDate | Sat Sep 27 18:57:05 EDT 2025 Sat Nov 29 02:30:38 EST 2025 Tue Nov 18 22:45:15 EST 2025 Tue Aug 26 16:39:14 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c274t-4b0a37a91c5154a2e234546cdb514c52c4a7940e8db2f40d79d1bceac8e5cbb63 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| PQID | 28297098 |
| PQPubID | 23500 |
| PageCount | 5 |
| ParticipantIDs | ieee_primary_80934 proquest_miscellaneous_28297098 crossref_primary_10_1109_78_80934 crossref_citationtrail_10_1109_78_80934 |
| PublicationCentury | 1900 |
| PublicationDate | 1991-04-01 |
| PublicationDateYYYYMMDD | 1991-04-01 |
| PublicationDate_xml | – month: 04 year: 1991 text: 1991-04-01 day: 01 |
| PublicationDecade | 1990 |
| PublicationTitle | IEEE transactions on signal processing |
| PublicationTitleAbbrev | TSP |
| PublicationYear | 1991 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| References | ref8 ref7 ref9 ref4 ref3 ref6 ref11 ref10 ref5 proakis (ref2) 1983 (ref1) 1986 |
| References_xml | – ident: ref9 doi: 10.1109/TASSP.1987.1165158 – ident: ref6 doi: 10.1109/TASSP.1984.1164325 – ident: ref11 doi: 10.1109/TASSP.1983.1164024 – year: 1986 ident: ref1 publication-title: Adaptive Filter Theory – ident: ref8 doi: 10.1109/TASSP.1986.1164878 – ident: ref5 doi: 10.1109/ICASSP.1980.1170850 – ident: ref3 doi: 10.1109/TASSP.1984.1164334 – year: 1983 ident: ref2 publication-title: Digital Communications – ident: ref7 doi: 10.1109/TASSP.1986.1164877 – ident: ref10 doi: 10.1049/ip-f-1.1984.0012 – ident: ref4 doi: 10.1109/ICASSP.1977.1170231 |
| SSID | ssj0014496 |
| Score | 1.3993564 |
| Snippet | An efficient pipelined realization structure of the a priori lattice-ladder least squares multichannel algorithm is introduced. The structure is shown to... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 992 |
| SubjectTerms | Array signal processing Costs Delay Filters Least squares methods Parallel processing Roundoff errors Signal processing algorithms Throughput Very large scale integration |
| Title | Efficient realization structure of the a priori lattice-ladder recursive least squares algorithm |
| URI | https://ieeexplore.ieee.org/document/80934 https://www.proquest.com/docview/28297098 |
| Volume | 39 |
| WOSCitedRecordID | wos10_1109_78_80934&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Xplore (IEEE/IET Electronic Library - IEL) issn: 1053-587X databaseCode: RIE dateStart: 19910101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://ieeexplore.ieee.org/ omitProxy: false ssIdentifier: ssj0014496 providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDI7YxAEOvBFvgoTEqZAtSZMeEdrEASEOgHYrqevCpNJC1-33k6TdBIILt6q1pcpOHDu2PxNy3hMgU8wgCNG35AAPEi7cEAEGErgUmQf1eb5T9_d6NIoeWpgc3wuDiL74DC_do8_lpyVM3VXZlbbht-iQjlJh06m1yBcI4SdxWWeBB1KrUQsz22PRldKXnu_HweMnqfwyv_5MGa7_5282yFrrOdLrRtWbZAmLLbL6DU9wm7wMPCCEZaPWF8zbFkvaYMROK6RlRq3DRw39qMZlNaa5qV3xW5A7-1NZJnCXBzOkuRvpQyefU9eeRE3-aqnrt_cd8jQcPN7cBu0IhQBsuFkHImGGKxP1wPotwvSxz4UUIaSJdFrqgzB2QzLUadLPBEtVlPYSsMZYo4QkCfku6RZlgXuEGgdUFUrQTKEQDHTKUqYS1DzLmMz4PrmYyzeGFl_cjbnIYx9nsChWOvYy2ydnC8qPBlPjD5pNJ_HF9_bl6Vxhsd0FLrVhCiynk9jlgxWL9MFfbIdkpSnwcvU2R6RrhY7HZBlm9XhSnfiF9AWlJ8pQ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDI54ScCBN2I8g4TEqSxrkiU9IgQCMSYOgHYrqevCpLJC9_j9JGmZQHDhVrW2VNmJY8f2Z0JOWgJkihkEbfQtOcCDhAs3RICBBC5F5kF9njqq29W9XnRfw-T4XhhE9MVneOYefS4_LWDsrsqa2obfYpbMSyFCVvVqTTMGQvhZXNZd4IHUqlcDzbZY1FT6zHP-OHr8LJVfBtifKler__mfNbJS-470vFL2OpnBwQZZ_oYouEmeLz0khGWj1hvM6yZLWqHEjkukRUaty0cNfS_7RdmnuRm58rcgdxaotEzgrg8mSHM31IcOP8auQYma_MVSj17ftsjj1eXDxXVQD1EIwAaco0AkzHBlohZYz0WYEEMupGhDmkinpxCEsVuSoU6TMBMsVVHaSsCaY40SkqTNt8ncoBjgDqHGQVW1JWimUAgGOmUpUwlqnmVMZrxBTr_kG0ONMO4GXeSxjzRYFCsde5k1yPGU8r1C1fiDZt1JfPq9fnn0pbDY7gOX3DADLMbD2GWEFYv07l9sR2Tx-uGuE3duurd7ZKkq93LVN_tkzioAD8gCTEb9YXnoF9UnTn3Nlw |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficient+realization+structure+of+the+a+priori+lattice-ladder+recursive+least+squares+algorithm&rft.jtitle=IEEE+transactions+on+signal+processing&rft.au=Petropulu%2C+A.P.&rft.au=Nikias%2C+C.L.&rft.au=Proakis%2C+J.G.&rft.date=1991-04-01&rft.issn=1053-587X&rft.volume=39&rft.issue=4&rft.spage=992&rft.epage=996&rft_id=info:doi/10.1109%2F78.80934&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_78_80934 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1053-587X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1053-587X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1053-587X&client=summon |