OTFS-MDMA: An Elastic Multi-Domain Resource Utilization Mechanism for High Mobility Scenarios

By harnessing the delay-Doppler (DD) resource domain, orthogonal time-frequency space (OTFS) substantially improves the communication performance under high-mobility scenarios by maintaining quasi-time-invariant channel characteristics. However, conventional multiple access (MA) techniques fail to e...

Full description

Saved in:
Bibliographic Details
Published inIEEE journal on selected areas in communications Vol. 43; no. 4; pp. 1405 - 1420
Main Authors Chen, Jie, Wang, Xianbin, Hanzo, Lajos
Format Journal Article
LanguageEnglish
Published New York IEEE 01.04.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN0733-8716
1558-0008
DOI10.1109/JSAC.2025.3531568

Cover

Loading…
Abstract By harnessing the delay-Doppler (DD) resource domain, orthogonal time-frequency space (OTFS) substantially improves the communication performance under high-mobility scenarios by maintaining quasi-time-invariant channel characteristics. However, conventional multiple access (MA) techniques fail to efficiently support OTFS in the face of diverse communication requirements. Recently, multi-dimensional MA (MDMA) has emerged as a flexible channel access technique by elastically exploiting multi-domain resources for tailored service provision. Therefore, we conceive an elastic multi-domain resource utilization mechanism for a novel multi-user OTFS-MDMA system by leveraging user-specific channel characteristics across the DD, power, and spatial resource domains. Specifically, we divide all DD resource bins into separate subregions called DD resource slots (RSs), each of which supports a fraction of users, thus reducing the multi-user interference. Then, the most suitable MA, including orthogonal, non-orthogonal, or spatial division MA (OMA/ NOMA/ SDMA), will be selected with each RS based on the interference levels in the power and spatial domains, thus enhancing the spectrum efficiency. Then, we jointly optimize the user assignment, MA scheme selection, and power allocation in all DD RSs to maximize the weighted sum-rate subject to their minimum rate and various practical constraints. Since this results in a non-convex problem, we develop a dynamic programming and monotonic optimization (DPMO) method to find the globally optimal solution in the special case of disregarding rate constraints. Subsequently, we apply a low-complexity algorithm to find sub-optimal solutions in general cases.
AbstractList By harnessing the delay-Doppler (DD) resource domain, orthogonal time-frequency space (OTFS) substantially improves the communication performance under high-mobility scenarios by maintaining quasi-time-invariant channel characteristics. However, conventional multiple access (MA) techniques fail to efficiently support OTFS in the face of diverse communication requirements. Recently, multi-dimensional MA (MDMA) has emerged as a flexible channel access technique by elastically exploiting multi-domain resources for tailored service provision. Therefore, we conceive an elastic multi-domain resource utilization mechanism for a novel multi-user OTFS-MDMA system by leveraging user-specific channel characteristics across the DD, power, and spatial resource domains. Specifically, we divide all DD resource bins into separate subregions called DD resource slots (RSs), each of which supports a fraction of users, thus reducing the multi-user interference. Then, the most suitable MA, including orthogonal, non-orthogonal, or spatial division MA (OMA/ NOMA/ SDMA), will be selected with each RS based on the interference levels in the power and spatial domains, thus enhancing the spectrum efficiency. Then, we jointly optimize the user assignment, MA scheme selection, and power allocation in all DD RSs to maximize the weighted sum-rate subject to their minimum rate and various practical constraints. Since this results in a non-convex problem, we develop a dynamic programming and monotonic optimization (DPMO) method to find the globally optimal solution in the special case of disregarding rate constraints. Subsequently, we apply a low-complexity algorithm to find sub-optimal solutions in general cases.
Author Chen, Jie
Hanzo, Lajos
Wang, Xianbin
Author_xml – sequence: 1
  givenname: Jie
  orcidid: 0000-0002-2196-9799
  surname: Chen
  fullname: Chen, Jie
  email: jche2426@uwo.ca
  organization: Department of Electrical and Computer Engineering, Western University, London, ON, Canada
– sequence: 2
  givenname: Xianbin
  orcidid: 0000-0003-4890-0748
  surname: Wang
  fullname: Wang, Xianbin
  email: xianbin.wang@uwo.ca
  organization: Department of Electrical and Computer Engineering, Western University, London, ON, Canada
– sequence: 3
  givenname: Lajos
  orcidid: 0000-0002-2636-5214
  surname: Hanzo
  fullname: Hanzo, Lajos
  email: lh@ecs.soton.ac.uk
  organization: School of Electronics and Computer Science, University of Southampton, Southampton, U.K
BookMark eNpNkMtuwjAQRa2KSgXaD6jUhaWuQz1-YKe7iEdpRYRUYFlFxnGKUYhpHBb06xsEi65mMefeGZ0e6lS-sgg9AhkAkPjlY5mMBpRQMWCCgRiqG9QFIVRECFEd1CWSsUhJGN6hXgg7QoBzRbvoa7GaLqN0nCavOKnwpNShcQanx7Jx0djvtavwpw3-WBuL140r3a9unK9was1WVy7sceFrPHPfW5z6TbtvTnhpbKVr58M9ui10GezDdfbRejpZjWbRfPH2PkrmkWGgmkhyYXRMdcxNng_BSEqpzhkVXHIKMYMN42AKKW1OtQQpNrKQpmDMWsGVkKyPni-9h9r_HG1osl37cdWezBhIFQMITloKLpSpfQi1LbJD7fa6PmVAsrPF7GwxO1vMrhbbzNMl46y1_3jFhVKE_QGBH24X
CODEN ISACEM
Cites_doi 10.1109/TWC.2018.2860011
10.1109/WCNC.2017.7925924
10.1109/TWC.2021.3129975
10.1109/JSAC.2023.3280984
10.1109/TCOMM.2023.3280213
10.1109/JSAC.2023.3310104
10.1109/TWC.2020.3032631
10.1109/TWC.2021.3110125
10.1109/TGCN.2020.2976932
10.1109/MWC.001.2000408
10.1109/TCOMM.2023.3314861
10.1109/TVT.2022.3199478
10.1109/MVT.2019.2921208
10.1109/TCOMM.2023.3244251
10.1109/TCOMM.2019.2932934
10.1109/JSAC.2020.3018826
10.1109/TMC.2023.3301577
10.1109/TWC.2016.2606100
10.1109/TWC.2022.3158616
10.1109/TWC.2021.3098033
10.1109/TWC.2021.3097173
10.1109/TCOMM.2021.3051386
10.1109/TVT.2018.2878891
10.1109/TSP.2012.2184099
10.1109/LWC.2023.3255943
10.1109/MBITS.2022.3216536
10.1109/TVT.2023.3248119
10.1109/JSAC.2022.3145909
10.1109/TCOMM.2023.3342230
10.1109/TWC.2021.3087501
10.1109/LWC.2023.3319481
10.1109/TCOMM.2017.2650992
10.1109/TCOMM.2022.3211068
10.1109/TVT.2019.2960506
10.1561/1300000038
10.1109/JSAC.2017.2725618
10.1109/TCOMM.2023.3326494
10.1109/MNET.001.2200429
10.1109/TCOMM.2021.3059456
10.1109/TWC.2019.2893335
10.1109/LCOMM.2024.3424666
10.1109/TWC.2022.3188776
10.1109/TNSM.2024.3368471
10.1109/jstsp.2024.3468037
10.1109/TCOMM.2023.3332865
10.1109/TCCN.2019.2945802
10.1109/LWC.2018.2890643
10.1109/JPROC.2021.3061701
10.1109/JSAC.2020.3036969
10.1109/LCOMM.2019.2945564
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2025
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2025
DBID 97E
RIA
RIE
AAYXX
CITATION
7SP
8FD
L7M
DOI 10.1109/JSAC.2025.3531568
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Electronics & Communications Abstracts
Technology Research Database
Advanced Technologies Database with Aerospace
DatabaseTitle CrossRef
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
DatabaseTitleList
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-0008
EndPage 1420
ExternalDocumentID 10_1109_JSAC_2025_3531568
10845880
Genre orig-research
GrantInformation_xml – fundername: Engineering and Physical Sciences Research Council (EPSRC) Projects
  grantid: EP/Y037243/1; EP/W016605/1; EP/X01228X/1; EP/Y026721/1; EP/W032635/1; EP/X04047X/1
– fundername: Natural Sciences and Engineering Research Council of Canada (NSERC) Discovery Program
  grantid: RGPIN-2024-05720
  funderid: 10.13039/501100000038
– fundername: Canada Research Chair Program
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
41~
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
ACNCT
ADRHT
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
HZ~
H~9
IBMZZ
ICLAB
IES
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
O9-
OCL
P2P
RIA
RIE
RNS
TN5
VH1
AAYOK
AAYXX
CITATION
RIG
7SP
8FD
L7M
ID FETCH-LOGICAL-c318t-745ca92a94cdd61c7222ad32547421931b341cf77ed2a7175b7f7cf33ee548573
IEDL.DBID RIE
ISSN 0733-8716
IngestDate Mon Jun 30 10:18:01 EDT 2025
Sun Jul 06 05:07:48 EDT 2025
Wed Aug 27 01:45:29 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c318t-745ca92a94cdd61c7222ad32547421931b341cf77ed2a7175b7f7cf33ee548573
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-2636-5214
0000-0003-4890-0748
0000-0002-2196-9799
PQID 3178911540
PQPubID 85481
PageCount 16
ParticipantIDs proquest_journals_3178911540
crossref_primary_10_1109_JSAC_2025_3531568
ieee_primary_10845880
PublicationCentury 2000
PublicationDate 2025-04-01
PublicationDateYYYYMMDD 2025-04-01
PublicationDate_xml – month: 04
  year: 2025
  text: 2025-04-01
  day: 01
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE journal on selected areas in communications
PublicationTitleAbbrev J-SAC
PublicationYear 2025
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref15
ref14
ref52
ref11
ref10
ref17
ref16
ref19
ref18
ref50
ref46
ref45
ref48
ref42
ref41
ref44
ref43
Grant (ref47) 2014
ref49
ref8
ref7
ref9
ref4
ref3
ref6
ref5
ref40
ref35
ref34
ref37
ref36
ref31
ref30
ref33
ref32
ref2
ref1
ref39
ref38
Nemirovskii (ref51) 2004
ref24
ref23
ref26
ref25
ref20
ref22
ref21
ref28
ref27
ref29
References_xml – volume-title: Interior Point Polynomial Algorithms in Convex Programming
  year: 2004
  ident: ref51
– ident: ref16
  doi: 10.1109/TWC.2018.2860011
– ident: ref6
  doi: 10.1109/WCNC.2017.7925924
– ident: ref11
  doi: 10.1109/TWC.2021.3129975
– ident: ref27
  doi: 10.1109/JSAC.2023.3280984
– ident: ref39
  doi: 10.1109/TCOMM.2023.3280213
– ident: ref43
  doi: 10.1109/JSAC.2023.3310104
– ident: ref28
  doi: 10.1109/TWC.2020.3032631
– ident: ref36
  doi: 10.1109/TWC.2021.3110125
– ident: ref41
  doi: 10.1109/TGCN.2020.2976932
– ident: ref8
  doi: 10.1109/MWC.001.2000408
– ident: ref9
  doi: 10.1109/TCOMM.2023.3314861
– volume-title: CVX: MATLAB Software for Disciplined Convex Programming
  year: 2014
  ident: ref47
– ident: ref20
  doi: 10.1109/TVT.2022.3199478
– ident: ref2
  doi: 10.1109/MVT.2019.2921208
– ident: ref13
  doi: 10.1109/TCOMM.2023.3244251
– ident: ref22
  doi: 10.1109/TCOMM.2019.2932934
– ident: ref26
  doi: 10.1109/JSAC.2020.3018826
– ident: ref42
  doi: 10.1109/TMC.2023.3301577
– ident: ref48
  doi: 10.1109/TWC.2016.2606100
– ident: ref18
  doi: 10.1109/TWC.2022.3158616
– ident: ref25
  doi: 10.1109/TWC.2021.3098033
– ident: ref17
  doi: 10.1109/TWC.2021.3097173
– ident: ref33
  doi: 10.1109/TCOMM.2021.3051386
– ident: ref14
  doi: 10.1109/TVT.2018.2878891
– ident: ref46
  doi: 10.1109/TSP.2012.2184099
– ident: ref12
  doi: 10.1109/LWC.2023.3255943
– ident: ref5
  doi: 10.1109/MBITS.2022.3216536
– ident: ref24
  doi: 10.1109/TVT.2023.3248119
– ident: ref30
  doi: 10.1109/JSAC.2022.3145909
– ident: ref19
  doi: 10.1109/TCOMM.2023.3342230
– ident: ref35
  doi: 10.1109/TWC.2021.3087501
– ident: ref37
  doi: 10.1109/LWC.2023.3319481
– ident: ref31
  doi: 10.1109/TCOMM.2017.2650992
– ident: ref52
  doi: 10.1109/TCOMM.2022.3211068
– ident: ref32
  doi: 10.1109/TVT.2019.2960506
– ident: ref45
  doi: 10.1561/1300000038
– ident: ref40
  doi: 10.1109/JSAC.2017.2725618
– ident: ref4
  doi: 10.1109/TCOMM.2023.3326494
– ident: ref3
  doi: 10.1109/MNET.001.2200429
– ident: ref23
  doi: 10.1109/TCOMM.2021.3059456
– ident: ref50
  doi: 10.1109/TWC.2019.2893335
– ident: ref21
  doi: 10.1109/LCOMM.2024.3424666
– ident: ref10
  doi: 10.1109/TWC.2022.3188776
– ident: ref49
  doi: 10.1109/TNSM.2024.3368471
– ident: ref44
  doi: 10.1109/jstsp.2024.3468037
– ident: ref7
  doi: 10.1109/TCOMM.2023.3332865
– ident: ref38
  doi: 10.1109/TCCN.2019.2945802
– ident: ref34
  doi: 10.1109/LWC.2018.2890643
– ident: ref1
  doi: 10.1109/JPROC.2021.3061701
– ident: ref29
  doi: 10.1109/JSAC.2020.3036969
– ident: ref15
  doi: 10.1109/LCOMM.2019.2945564
SSID ssj0014482
Score 2.4762838
Snippet By harnessing the delay-Doppler (DD) resource domain, orthogonal time-frequency space (OTFS) substantially improves the communication performance under...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Index Database
Publisher
StartPage 1405
SubjectTerms Algorithms
Constraints
delay-Doppler
Delays
Doppler effect
Dynamic programming
Modulation
monotonic optimization
multi-dimensional multiple access (MDMA)
Multiaccess communication
NOMA
OFDM
Optimization
Orthogonal time frequency space (OTFS)
Resource management
Resource utilization
Symbols
Time-frequency analysis
Title OTFS-MDMA: An Elastic Multi-Domain Resource Utilization Mechanism for High Mobility Scenarios
URI https://ieeexplore.ieee.org/document/10845880
https://www.proquest.com/docview/3178911540
Volume 43
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1NS8MwGA66kx78nDidkoMnIbVd2qb1VvbBGHQetsEuUpI0haFrxXUH_fW-SVsZiuCth7SEPPl4nr7v8wahOxY4GQWdTPyQZ8QNFSPckdr6JLPMT5UnhBaK8dQfL9zJ0lvWZnXjhVFKmeQzZelHE8tPC7nVv8pghQfaWAkKfR-UW2XW-g4ZgM4wIQNGKdEqoA5hOnb4MJlFfZCCPc-iMOU8XVZ15xAyt6r82orN-TI6RtOmZ1VayYu1LYUlP38Ubfx310_QUc00cVRNjVO0p_IzdLhTf_AcPT_NRzMSD-LoEUc5HgKThsbYmHLJoFjzVY6b__t4Ua5ea9MmjpU2DK82awycF-tcERwXJs32A8-kykGAF5s2WoyG8_6Y1PctEAkruyTM9SQPezx0ZZr6jmTAHXhKQUKCfgai5wg48mTGmEp7HGSgJ1gGkFKqFOgej9EL1MqLXF0iDKqKO0woYAfSDWwuGAdcUtgeJGggITrovgEgeavKaiRGjthhotFKNFpJjVYHtfWA7jSsxrKDug1mSb3yNgnwoSDUNYbsqz9eu0YH-utV-k0Xtcr3rboBZlGKWzOjvgBG9shD
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV27TsMwFLVQGYCBZxGFAh6YkByS5uGGLepDpTRlaCt1QZHtOFIFTRBNB_h6rp0EVSAktgyOYvn4cU7uPdcI3dC2ldigk4nns4Q4vqSEWUJZn0SSeLF0OVdCMRx7g5kznLvz0qyuvTBSSp18Jg31qGP5cSbW6lcZrPC2MlaCQt92lRu3sGt9Bw1AaeigAbVtonRAGcS0TP9uOAk6IAZbrmHDpHNVYdWNY0jfq_JrM9YnTP8Ajau-FYklL8Y654b4_FG28d-dP0T7JdfEQTE5jtCWTI_R3kYFwhP0_DTtT0jYDYN7HKS4B1waGmNtyyXdbMkWKa7-8ONZvngtbZs4lMoyvFgtMbBerLJFcJjpRNsPPBEyBQmerepo1u9NOwNS3rhABKztnFDHFcxvMd8RcexZggJ7YLENIhIUNFA9i8OhJxJKZdxiIARdThMA1balBOXjUvsU1dIslWcIg65iFuUS-IFw2ibjlAEuMWwQAlQQ5w10WwEQvRWFNSItSEw_UmhFCq2oRKuB6mpANxoWY9lAzQqzqFx7qwgYUdtXVYbM8z9eu0Y7g2k4ikYP48cLtKu-VCTjNFEtf1_LS-AZOb_Ss-sL5unLiw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=OTFS-MDMA%3A+An+Elastic+Multi-Domain+Resource+Utilization+Mechanism+for+High+Mobility+Scenarios&rft.jtitle=IEEE+journal+on+selected+areas+in+communications&rft.au=Chen%2C+Jie&rft.au=Wang%2C+Xianbin&rft.au=Hanzo%2C+Lajos&rft.date=2025-04-01&rft.pub=IEEE&rft.issn=0733-8716&rft.volume=43&rft.issue=4&rft.spage=1405&rft.epage=1420&rft_id=info:doi/10.1109%2FJSAC.2025.3531568&rft.externalDocID=10845880
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0733-8716&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0733-8716&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0733-8716&client=summon