A Novel JFG Detection-Decoding Approach of a Vertical Shuffle Scheduling for Iterative MIMO Receivers with NB-LDPC Codes
| dc.rights.license | open | en_US |
| hal.structure.identifier | Laboratoire de l'intégration, du matériau au système [IMS] | |
| dc.contributor.author | HAROUN, Ali | |
| dc.contributor.author | AL-GHOUWAYEL, Ali Chamas | |
| dc.contributor.author | HIJAZI, Hussein | |
| hal.structure.identifier | Laboratoire de l'intégration, du matériau au système [IMS] | |
| dc.contributor.author | JEGO, Christophe | |
| dc.date.accessioned | 2022-07-05T14:20:46Z | |
| dc.date.available | 2022-07-05T14:20:46Z | |
| dc.date.issued | 2021-08 | |
| dc.identifier.issn | 0165-1684 | en_US |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/140379 | |
| dc.description.abstractEn | MIMO systems exploit multi-path propagation in a rich broadcast environment to improve throughput and performance of digital communication systems. The correspondent demappers require additional computational complexity. In this paper, a new detection-decoding approach based on vertical shuffle scheduling is proposed. Space exploration for the maximum likelihood detection is reduced to a dynamic region that surrounds the received symbol. Thus, a dynamic approach is proposed to detect the closest point of the channel observation without calculating all the candidate symbols in a constellation. In addition, a novel method based on EXIT chart study is proposed to find the sufficient number of neighboring points to search around a local minimum and then compute by recursion their Euclidean distances. Compared to the conventional Maximum Likelihood detector, the proposed algorithm allows a reduction in the computational complexity, in terms of number of multiplication, reaching 98%. The simulation results show that the proposed algorithm outperforms the state-of-the-art algorithms like MMSE, sphere decoding, DBTC and DaVinci codes. | |
| dc.language.iso | EN | en_US |
| dc.subject.en | MIMO Systems | |
| dc.subject.en | Iterative belief propagation | |
| dc.subject.en | Joint factor graph | |
| dc.subject.en | Vertical shuffle schedule | |
| dc.subject.en | Dynamic closest point | |
| dc.subject.en | EXIT Chart | |
| dc.title.en | A Novel JFG Detection-Decoding Approach of a Vertical Shuffle Scheduling for Iterative MIMO Receivers with NB-LDPC Codes | |
| dc.type | Article de revue | en_US |
| dc.identifier.doi | 10.1016/j.sigpro.2021.108287 | en_US |
| dc.subject.hal | Sciences de l'ingénieur [physics]/Electronique | en_US |
| bordeaux.journal | Signal Processing | en_US |
| bordeaux.page | 108287 | en_US |
| bordeaux.volume | 190 | en_US |
| bordeaux.hal.laboratories | Laboratoire d’Intégration du Matériau au Système (IMS) - UMR 5218 | en_US |
| bordeaux.institution | Université de Bordeaux | en_US |
| bordeaux.institution | Bordeaux INP | en_US |
| bordeaux.institution | CNRS | en_US |
| bordeaux.peerReviewed | oui | en_US |
| bordeaux.inpress | non | en_US |
| bordeaux.import.source | hal | |
| hal.identifier | hal-03340695 | |
| hal.version | 1 | |
| hal.export | false | |
| workflow.import.source | hal | |
| dc.rights.cc | Pas de Licence CC | en_US |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Signal%20Processing&rft.date=2021-08&rft.volume=190&rft.spage=108287&rft.epage=108287&rft.eissn=0165-1684&rft.issn=0165-1684&rft.au=HAROUN,%20Ali&AL-GHOUWAYEL,%20Ali%20Chamas&HIJAZI,%20Hussein&JEGO,%20Christophe&rft.genre=article |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||