Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Article

Download file Download BibTeX

Title

BICM-ID Labeling-Based Recipient Identification in a Heterogeneous Network

Authors

[ 1 ] Instytut Radiokomunikacji, Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | [ P ] employee

Scientific discipline (Law 2.0)

[2.3] Information and communication technology

Year of publication

2023

Published in

Sensors

Journal year: 2023 | Journal volume: vol. 23 | Journal number: iss. 7

Article type

scientific article

Publication language

english

Keywords
EN
  • coded modulation
  • iterative decoding
  • physical layer
  • turbo codes
  • wireless networks
Abstract

EN The concept of labeling-based recipient identification (LABRID) for bit-interleaved coded modulation with iterative decoding (BICM-ID) is revisited. LABRID allows addressing a message recipient station in a wireless network by using an individual labeling map without compromising error performance. This eliminates the need to use any byte of the data frame to carry the recipient address explicitly. In addition, the destination of the frame can be determined in parallel with a BICM-ID decoding procedure in the receiver’s physical layer. Therefore, the MAC layer is not involved in processing the vast majority of frames transmitted in a network. Previously, it was shown that LABRID works fine if there are only LABRID-compatible stations within the network, and every receiver can reject frames destined for other receivers. This paper considers a scenario in which LABRID-compatible BICM-ID stations and legacy BICM stations coexist in the same network. A few experiments show that the LABRID receiver can reject an old-fashioned BICM frame by judging the convergence of the iterative decoding process. It also turns out that the legacy BICM receiver can identify and dismiss the LABRID-type frames thanks to the standard cyclic redundancy check (CRC) procedure.

Pages (from - to)

3605-1 - 3605-11

DOI

10.3390/s23073605

URL

https://www.mdpi.com/1424-8220/23/7/3605

Comments

article number: 3605

License type

CC BY (attribution alone)

Open Access Mode

open journal

Open Access Text Version

final published version

Date of Open Access to the publication

at the time of publication

Full text of article

Download file

Access level to full text

public

Ministry points / journal

100

Impact Factor

3,9 [List 2022]

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.