A robust LU polynomial matrix decomposition for spatial multiplexing

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher
AI-generated summary by claude@2026-07, 2026-07-14

This paper modifies an LU polynomial matrix decomposition for MIMO spatial multiplexing to improve robustness against noise and channel errors by solving ill-conditioning problems in the post-filter.

One-sentence paraphrase of the abstract; not a substitute for reading it. No clinical advice. How this works

AI-generated deep summary by claude@2026-07, 2026-07-14 · read from full text

This paper studies time-domain spatial multiplexing for wideband MIMO systems using an LU-based polynomial matrix decomposition, comparing it to a QR-based approach in terms of noise behavior, robustness, and computational complexity. It finds that because the resulting pre- and post-filters are not paraunitary, noise output power is amplified and performance degrades relative to QR-based spatial multiplexing, with the degradation tied to an ill-conditioned post-filter polynomial matrix. The authors introduce simple transformations to the LU polynomial decomposition that resolve the ill-conditioning problem, yielding an LU-based scheme robust to noise and channel estimation errors, where the LU-based beamforming compares favorably to the QR counterpart for complexity and bit error rate. This paper does not explicitly discuss endometriosis or adenomyosis; it was included in the corpus via a keyword match in the upstream search index.

Read from the paper's body, not the abstract. Not a substitute for reading the paper. No clinical advice. How this works

Abstract

Abstract This paper considers time-domain spatial multiplexing in MIMO wideband system, using an LU-based polynomial matrix decomposition. Because the corresponding pre- and post-filters are not paraunitary, the noise output power is amplified and the performance of the system is degraded, compared to QR-based spatial multiplexing approach. Degradations are important as the post-filter polynomial matrix is ill-conditioned. In this paper, we introduce simple transformations on the decomposition that solve the ill-conditioning problem. We show that this results in a MIMO spatial multiplexing scheme that is robust to noise and channel estimation errors. In the latter context, the proposed LU-based beamforming compares favorably to the QR-based counterpart in terms of complexity and bit error rate.
Full text 19,137 characters · extracted from preprint-html · click to expand
A robust LU polynomial matrix decomposition for spatial multiplexing | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research A robust LU polynomial matrix decomposition for spatial multiplexing Moustapha Mbaye, Moussa Diallo, Mamadou Mboup This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-50211/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 10 Nov, 2020 Read the published version in EURASIP Journal on Advances in Signal Processing → Version 1 posted 12 You are reading this latest preprint version Abstract This paper considers time-domain spatial multiplexing in MIMO wideband system, using an LU-based polynomial matrix decomposition. Because the corresponding pre- and post-filters are not paraunitary, the noise output power is amplified and the performance of the system is degraded, compared to QR-based spatial multiplexing approach. Degradations are important as the post-filter polynomial matrix is ill-conditioned. In this paper, we introduce simple transformations on the decomposition that solve the ill-conditioning problem. We show that this results in a MIMO spatial multiplexing scheme that is robust to noise and channel estimation errors. In the latter context, the proposed LU-based beamforming compares favorably to the QR-based counterpart in terms of complexity and bit error rate. Electrical Engineering Polynomial matrix decomposition LU decomposition Beamforming MIMO wideband system time-domain spatial multiplexing Figures Figure 1 Figure 2 Figure 3 Figure 4 Figure 5 Figure 6 Figure 7 Figure 8 Figure 9 Figure 10 Figure 11 Figure 12 Full Text Due to technical limitations, full-text HTML conversion of this manuscript could not be completed. However, the latest manuscript can be downloaded and accessed as a PDF. Cite Share Download PDF Status: Published Journal Publication published 10 Nov, 2020 Read the published version in EURASIP Journal on Advances in Signal Processing → Version 1 posted Editorial decision: Minor revision 23 Sep, 2020 Review # 2 received at journal 22 Sep, 2020 Review # 1 received at journal 11 Sep, 2020 Reviewer # 4 agreed at journal 17 Aug, 2020 Reviewer # 1 agreed at journal 14 Aug, 2020 Reviewer # 2 agreed at journal 14 Aug, 2020 Reviewer # 3 agreed at journal 14 Aug, 2020 Reviewers invited by journal 03 Aug, 2020 Editor assigned by journal 30 Jul, 2020 First submitted to journal 29 Jul, 2020 Submission checks completed at journal 29 Jul, 2020 Editor invited by journal 29 Jul, 2020 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-50211","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research","associatedPublications":[],"authors":[{"id":1109101,"identity":"6a4ddc89-b683-4259-b34a-6d256f7bd419","order_by":0,"name":"Moustapha Mbaye","email":"","orcid":"","institution":"Universite Cheikh Anta Diop","correspondingAuthor":false,"prefix":"","firstName":"Moustapha","middleName":"","lastName":"Mbaye","suffix":""},{"id":1109102,"identity":"6fea7cc2-6575-454d-9dda-1fa0814c4a93","order_by":1,"name":"Moussa Diallo","email":"","orcid":"","institution":"Universite Cheikh Anta Diop","correspondingAuthor":false,"prefix":"","firstName":"Moussa","middleName":"","lastName":"Diallo","suffix":""},{"id":1109103,"identity":"0aada9a1-b76c-4076-afab-5d05b52a75b0","order_by":2,"name":"Mamadou Mboup","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABDUlEQVRIiWNgGAWjYLACHhAhASIqGBjYwEIGQMx8gBgtZ5C1sCUQoYWxDVkYhxbd9tOJH95UHGbQnd18TLpw3uE8PokEtg8fCrbZM7DxPsCmxexM7mbJOWcOM5jdOZYmPXPb4WI2iQTmmTMMbic2sLEbYNVyIHeDNG8bUMuNHDNp3m2HE9t4zn9m5jG4ncAg34ZNB4PZ+bebfyO0zAFpOcDM/MfgNtBhbNi13MjdhmRLA1ALewMzM4PBbcYGnFrebrOccyadB+iXZOsZx9LBWhh7gH5pw6XlfO7mG28qrOXMbjcfvF1QY504v5mBmeHHn9v2/Di0wAA4aphRhPBrgAJmwkpGwSgYBaNgJAIAfARb94zRSLIAAAAASUVORK5CYII=","orcid":"https://orcid.org/0000-0002-9212-7038","institution":"Universite de Reims Champagne-Ardenne","correspondingAuthor":true,"prefix":"","firstName":"Mamadou","middleName":"","lastName":"Mboup","suffix":""}],"badges":[],"createdAt":"2020-07-28 11:50:30","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-50211/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-50211/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1186/s13634-020-00705-3","type":"published","date":"2020-11-10T15:03:15+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":1784469,"identity":"f421ec35-eda0-4b19-8739-8eaa832995a4","added_by":"auto","created_at":"2020-08-04 21:35:27","extension":"png","order_by":1,"title":"Figure 1","display":"","copyAsset":false,"role":"figure","size":59299,"visible":true,"origin":"","legend":"Effect of the post-flter norm on the system's performance: BER vs SNR","description":"","filename":"Fig1.png","url":"https://assets-eu.researchsquare.com/files/rs-50211/v1/Fig1.png"},{"id":1784470,"identity":"c44c9b38-0e55-4fe0-af24-fda611c13b3d","added_by":"auto","created_at":"2020-08-04 21:35:27","extension":"png","order_by":2,"title":"Figure 2","display":"","copyAsset":false,"role":"figure","size":56397,"visible":true,"origin":"","legend":"Effect of the postcoder's condition number on the BER vs SNR — 3 x 3-MIMO channel","description":"","filename":"Fig2.png","url":"https://assets-eu.researchsquare.com/files/rs-50211/v1/Fig2.png"},{"id":1784471,"identity":"83e9a635-b9c4-4c5f-8abf-e4b6a797dbb3","added_by":"auto","created_at":"2020-08-04 21:35:27","extension":"png","order_by":3,"title":"Figure 3","display":"","copyAsset":false,"role":"figure","size":59724,"visible":true,"origin":"","legend":"Effect of the postcoder's condition number on the BER vs SNR — 4 x 4-MIMO channel.","description":"","filename":"Fig3.png","url":"https://assets-eu.researchsquare.com/files/rs-50211/v1/Fig3.png"},{"id":1784472,"identity":"2ab35b13-c31d-44e9-bf69-f72b37b5e81f","added_by":"auto","created_at":"2020-08-04 21:35:27","extension":"png","order_by":4,"title":"Figure 4","display":"","copyAsset":false,"role":"figure","size":59874,"visible":true,"origin":"","legend":"Effect of the postcoder's condition number on the BER vs SNR — 5 x 5-MIMO channel.","description":"","filename":"Fig4.png","url":"https://assets-eu.researchsquare.com/files/rs-50211/v1/Fig4.png"},{"id":1784473,"identity":"595936d1-2309-4223-a4ce-69300a8a213d","added_by":"auto","created_at":"2020-08-04 21:35:27","extension":"png","order_by":5,"title":"Figure 5","display":"","copyAsset":false,"role":"figure","size":51328,"visible":true,"origin":"","legend":"BER comparison of the two beamformers: Indoor ITU channel model.","description":"","filename":"Fig5.png","url":"https://assets-eu.researchsquare.com/files/rs-50211/v1/Fig5.png"},{"id":1784474,"identity":"8e355bef-da98-4476-9a78-567142b571ba","added_by":"auto","created_at":"2020-08-04 21:35:27","extension":"png","order_by":6,"title":"Figure 6","display":"","copyAsset":false,"role":"figure","size":49808,"visible":true,"origin":"","legend":"BER comparison of the two beamformers: Outdoor ITU channel model.","description":"","filename":"Fig6.png","url":"https://assets-eu.researchsquare.com/files/rs-50211/v1/Fig6.png"},{"id":1784475,"identity":"5d34d0f8-b157-429e-86a6-e555132127fb","added_by":"auto","created_at":"2020-08-04 21:35:28","extension":"png","order_by":7,"title":"Figure 7","display":"","copyAsset":false,"role":"figure","size":53613,"visible":true,"origin":"","legend":"BER comparison of LU-based scheme and QR-based scheme.","description":"","filename":"Fig7.png","url":"https://assets-eu.researchsquare.com/files/rs-50211/v1/Fig7.png"},{"id":1784476,"identity":"396a5ef7-5496-4a06-a934-81374c5e8c13","added_by":"auto","created_at":"2020-08-04 21:35:28","extension":"png","order_by":8,"title":"Figure 8","display":"","copyAsset":false,"role":"figure","size":52875,"visible":true,"origin":"","legend":"BER Performance in MIMO 3 x 3 by combining \"Row balancing\" and \"Left-right\nswapping\" methods.","description":"","filename":"Fig8.png","url":"https://assets-eu.researchsquare.com/files/rs-50211/v1/Fig8.png"},{"id":1784477,"identity":"d1c35b61-88ed-4ef8-8ab2-11a89a653d5a","added_by":"auto","created_at":"2020-08-04 21:35:28","extension":"png","order_by":9,"title":"Figure 9","display":"","copyAsset":false,"role":"figure","size":53390,"visible":true,"origin":"","legend":"BER Performance in MIMO 4 x 4 by combining \"Row balancing\" and \"Left-right\nswapping\" methods.","description":"","filename":"Fig9.png","url":"https://assets-eu.researchsquare.com/files/rs-50211/v1/Fig9.png"},{"id":1784478,"identity":"4dfed508-3ad5-4998-91dc-696ff261f525","added_by":"auto","created_at":"2020-08-04 21:35:28","extension":"png","order_by":10,"title":"Figure 10","display":"","copyAsset":false,"role":"figure","size":54261,"visible":true,"origin":"","legend":"BER Performance in MIMO 5 x 5 by combining \"Row balancing\" and \"Left-right\nswapping\" methods.","description":"","filename":"Fig10.png","url":"https://assets-eu.researchsquare.com/files/rs-50211/v1/Fig10.png"},{"id":1784479,"identity":"2afff9cd-47a6-4b73-b010-99a556ce26ab","added_by":"auto","created_at":"2020-08-04 21:35:28","extension":"png","order_by":11,"title":"Figure 11","display":"","copyAsset":false,"role":"figure","size":61521,"visible":true,"origin":"","legend":"LU-PMD: BER Performance with imperfect Channel estimation.","description":"","filename":"Fig11.png","url":"https://assets-eu.researchsquare.com/files/rs-50211/v1/Fig11.png"},{"id":1784480,"identity":"b06f0b9f-b1c9-4f59-96a5-1719519e71e1","added_by":"auto","created_at":"2020-08-04 21:35:28","extension":"png","order_by":12,"title":"Figure 12","display":"","copyAsset":false,"role":"figure","size":57026,"visible":true,"origin":"","legend":"QR: BER Performance with imperfect Channel estimation.","description":"","filename":"Fig12.png","url":"https://assets-eu.researchsquare.com/files/rs-50211/v1/Fig12.png"},{"id":13520086,"identity":"d0af4e43-cbdc-4419-b8cf-b9fc4edcf541","added_by":"auto","created_at":"2021-09-17 00:26:08","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":867851,"visible":true,"origin":"","legend":"","description":"","filename":"ImprovedPostfilterV7.pdf","url":"https://assets-eu.researchsquare.com/files/rs-50211/v1_covered.pdf"},{"id":1784490,"identity":"f1cf44af-8d08-4e8c-b5d2-228900d6da1d","added_by":"auto","created_at":"2020-08-04 21:36:31","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":748410,"visible":true,"origin":"","legend":"","description":"","filename":"ImprovedPostfilterV7.pdf","url":"https://assets-eu.researchsquare.com/files/rs-50211/v1_stamped.pdf"},{"id":1784481,"identity":"ad2be736-746c-4b51-94ba-98586975fed1","added_by":"auto","created_at":"2020-08-04 21:35:28","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":671743,"visible":true,"origin":"","legend":"","description":"","filename":"ImprovedPostfilterV7.pdf","url":"https://assets-eu.researchsquare.com/files/rs-50211/v1/ImprovedPostfilterV7.pdf"}],"financialInterests":"","formattedTitle":"A robust LU polynomial matrix decomposition for spatial multiplexing","fulltext":[{"header":"Full Text","content":"Due to technical limitations, full-text HTML conversion of this manuscript could not be completed. However, the latest manuscript can be downloaded and \u003ca href='/article/rs-50211/latest.pdf' target='_blank'\u003e accessed as a PDF.\u003c/a\u003e"}],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":false,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"eurasip-journal-on-advances-in-signal-processing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"jsig","sideBox":"Learn more about [EURASIP Journal on Advances in Signal Processing](https://asp-eurasipjournals.springeropen.com/)","snPcode":"13634","submissionUrl":"https://submission.nature.com/new-submission/13634/3","title":"EURASIP Journal on Advances in Signal Processing","twitterHandle":"@SpringerEng","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"BMC/SO AJ","inReviewEnabled":true,"inReviewRevisionsEnabled":true},"keywords":"Polynomial matrix decomposition, LU decomposition, Beamforming, MIMO wideband system, time-domain spatial multiplexing","lastPublishedDoi":"10.21203/rs.3.rs-50211/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-50211/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"This paper considers time-domain spatial multiplexing in MIMO wideband system, using an LU-based polynomial matrix decomposition. Because the corresponding pre- and post-filters are not paraunitary, the noise output power is amplified and the performance of the system is degraded, compared to QR-based spatial multiplexing approach. Degradations are important as the post-filter polynomial matrix is ill-conditioned. In this paper, we introduce simple transformations on the decomposition that solve the ill-conditioning problem. We show that this results in a MIMO spatial multiplexing scheme that is robust to noise and channel estimation errors. In the latter context, the proposed LU-based beamforming compares favorably to the QR-based counterpart in terms of complexity and bit error rate.","manuscriptTitle":"A robust LU polynomial matrix decomposition for spatial multiplexing","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2020-08-04 21:34:51","doi":"10.21203/rs.3.rs-50211/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Minor revision","date":"2020-09-23T12:00:00+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2020-09-22T12:00:00+00:00","index":2,"fulltext":"Recommendation: Reviewer's comments unavailable due to the journal's policy.\n"},{"type":"editorInvitedReview","content":"","date":"2020-09-11T12:00:00+00:00","index":1,"fulltext":"Recommendation: Reviewer's comments unavailable due to the journal's policy.\n"},{"type":"reviewerAgreed","content":"","date":"2020-08-17T12:00:00+00:00","index":4,"fulltext":""},{"type":"reviewerAgreed","content":"","date":"2020-08-14T12:00:00+00:00","index":1,"fulltext":""},{"type":"reviewerAgreed","content":"","date":"2020-08-14T12:00:00+00:00","index":2,"fulltext":""},{"type":"reviewerAgreed","content":"","date":"2020-08-14T12:00:00+00:00","index":3,"fulltext":""},{"type":"reviewersInvited","content":"","date":"2020-08-03T12:00:00+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2020-07-30T12:00:00+00:00","index":"","fulltext":""},{"type":"submitted","content":"","date":"2020-07-29T12:00:00+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2020-07-29T12:00:00+00:00","index":"","fulltext":""},{"type":"editorInvited","content":"","date":"2020-07-29T12:00:00+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"eurasip-journal-on-advances-in-signal-processing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"jsig","sideBox":"Learn more about [EURASIP Journal on Advances in Signal Processing](https://asp-eurasipjournals.springeropen.com/)","snPcode":"13634","submissionUrl":"https://submission.nature.com/new-submission/13634/3","title":"EURASIP Journal on Advances in Signal Processing","twitterHandle":"@SpringerEng","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"BMC/SO AJ","inReviewEnabled":true,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"b3aedfe2-9bd8-48f4-a7bd-774b8acbb09f","owner":[],"postedDate":"August 4th, 2020","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[{"id":240953,"name":"Electrical Engineering"}],"tags":[],"updatedAt":"2020-11-15T15:03:53+00:00","versionOfRecord":{"articleIdentity":"rs-50211","link":"https://doi.org/10.1186/s13634-020-00705-3","journal":{"identity":"eurasip-journal-on-advances-in-signal-processing","isVorOnly":false,"title":"EURASIP Journal on Advances in Signal Processing"},"publishedOn":"2020-11-10 15:03:15","publishedOnDateReadable":"November 10th, 2020"},"versionCreatedAt":"2020-08-04 21:34:51","video":"","vorDoi":"10.1186/s13634-020-00705-3","vorDoiUrl":"https://doi.org/10.1186/s13634-020-00705-3","workflowStages":[]},"version":"v1","identity":"rs-50211","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-50211","identity":"rs-50211","version":["v1"]},"buildId":"_2-kVJe1T_tPrBINL-cwx","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-05-24T02:00:01.246996+00:00
License: CC-BY-4.0