kth.sePublications KTH
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Multi-Objective Optimization Framework for URLLC With Decoding Complexity Constraints
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0001-5988-2763
Ericsson AB, S-16480 Stockholm, Sweden..
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0002-7926-5081
2022 (English)In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 21, no 4, p. 2786-2798Article in journal (Refereed) Published
Abstract [en]

Stringent constraints on both reliability and latency must be guaranteed in ultra-reliable low-latency communication (URLLC). To fulfill these constraints with computationally constrained receivers, such as low-budget IoT receivers, optimal transmission parameters need to be studied in detail. In this paper, we introduce a multi-objective optimization framework for the optimal design of URLLC in the presence of decoding complexity constraints. We consider transmission of short-blocklength codewords that are encoded with linear block encoders, transmitted over a binary-input AWGN channel, and finally decoded with order-statistics (OS) decoder. We investigate the optimal selection of a transmission rate and power pair, while satisfying the constraints. For this purpose, a multi-objective optimization problem (MOOP) is formulated. Based on the empirical model that accurately quantifies the trade-off between the performance of an OS decoder and its computational complexity, the MOOP is solved and the Pareto boundary is derived. In order to assess the overall performance among several Pareto-optimal transmission pairs, two scalarization methods are investigated. To exemplify the importance of the MOOP, a case study on a battery-powered communication system is provided. It is shown that, compared to the classical fixed rate-power transmissions, the MOOP provides the optimum usage of the battery and increases the energy efficiency of the communication system while maintaining the constraints.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2022. Vol. 21, no 4, p. 2786-2798
Keywords [en]
Decoding, Ultra reliable low latency communication, Complexity theory, Reliability, Wireless communication, Receivers, Optimization, URLLC, low-complexity receivers, channel coding, Internet-of-Things, order statistics decoder, multi-objective optimization
National Category
Telecommunications Communication Systems Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-311637DOI: 10.1109/TWC.2021.3115983ISI: 000779826500047Scopus ID: 2-s2.0-85119582416OAI: oai:DiVA.org:kth-311637DiVA, id: diva2:1655252
Note

QC 20220502

Available from: 2022-05-02 Created: 2022-05-02 Last updated: 2022-06-25Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Celebi, Hasan BasriSkoglund, Mikael

Search in DiVA

By author/editor
Celebi, Hasan BasriSkoglund, Mikael
By organisation
Information Science and Engineering
In the same journal
IEEE Transactions on Wireless Communications
TelecommunicationsCommunication SystemsSignal Processing

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 192 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf