Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/115516
DC FieldValueLanguage
dc.contributorDepartment of Electrical and Electronic Engineering-
dc.creatorZheng, S-
dc.creatorZhang, S-
dc.date.accessioned2025-10-02T06:55:02Z-
dc.date.available2025-10-02T06:55:02Z-
dc.identifier.urihttp://hdl.handle.net/10397/115516-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.subjectBeyond diagonal intelligent reflecting surface (BD-IRS)en_US
dc.subjectBeyond diagonal reconfigurable intelligent surface (BD-RIS)en_US
dc.subjectIntegrated sensing and communication (ISAC)en_US
dc.subjectPosterior Cramér-Rao bound (PCRB)en_US
dc.titleBeyond diagonal intelligent reflecting surface aided integrated sensing and communicationen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.doi10.1109/TCCN.2025.3583699-
dcterms.abstractBeyond diagonal intelligent reflecting surface (BD-IRS) is a new promising IRS architecture for which the reflection matrix is not limited to the diagonal structure as for conventional IRS. In this paper, we study a BD-IRS aided uplink integrated sensing and communication (ISAC) system where sensing is performed in a device-based manner. Specifically, we aim to estimate the unknown and random location of an active target based on its uplink probing signals sent to a multi-antenna base station (BS) as well as the known prior distribution information of the target’s location. Multiple communication users also simultaneously send uplink signals, resulting in a challenging mutual interference issue between sensing and communication. We first characterize the sensing performance metric by deriving the posterior Cramér-Rao bound (PCRB) of the mean-squared error (MSE) when prior information is available. Then, we formulate a BD-IRS reflection matrix optimization problem to maximize the minimum expected achievable rate among the multiple users subject to a constraint on the PCRB as well as the lossless and reciprocal constraints on the BD-IRS reflection matrix. The formulated problem is non-convex and challenging to solve. To tackle this problem, we propose a penalty dual decomposition (PDD) based algorithm which can find a high-quality suboptimal solution with polynomial-time complexity. In addition, we propose and optimize a time-division multiple access (TDMA) based scheme which removes the sensing-communication mutual interference. Numerical results verify the effectiveness of the proposed designs and provide useful design insights such as the optimal choice of multiple access scheme.-
dcterms.accessRightsembargoed accessen_US
dcterms.bibliographicCitationIEEE transactions on cognitive communications and networking, Date of Publication: 27 June 2025, Early Access, https://doi.org/10.1109/TCCN.2025.3583699-
dcterms.isPartOfIEEE transactions on cognitive communications and networking-
dcterms.issued2025-
dc.identifier.scopus2-s2.0-105009420992-
dc.identifier.eissn2332-7731-
dc.description.validate202510 bcch-
dc.description.oaNot applicableen_US
dc.identifier.SubFormIDG000209/2025-07en_US
dc.description.fundingSourceRGCen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTexthis paper was supported in part by the National Natural Science Foundation of China (NSFC) under Grant 62471421, in part by the Hong Kong Research Grants Council (RGC) General Research Fund under Grant 15230022, and in part by the Hong Kong RGC Young Collaborative Research Grant under Grant PolyU C5002-23Y.en_US
dc.description.pubStatusEarly releaseen_US
dc.date.embargo0000-00-00 (to be updated)en_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Open Access Information
Status embargoed access
Embargo End Date 0000-00-00 (to be updated)
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Google ScholarTM

Check

Altmetric


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