The Next Generation of Beam Hopping Satellite Systems: Dynamic Beam Illumination With Selective Precoding

Beam Hopping (BH) is a popular technique considered for next-generation multi-beam satellite communication system which allows a satellite focusing its resources on where they are needed by selectively illuminating beams. While beam illumination plan can be adjusted according to its needs, the main...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on wireless communications Jg. 22; H. 4; S. 2666 - 2682
Hauptverfasser: Chen, Lin, Ha, Vu Nguyen, Lagunas, Eva, Wu, Linlong, Chatzinotas, Symeon, Ottersten, Bjorn
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.04.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
binary quadratic programming
Communications systems
Demand
Dynamic beam illumination
Greedy algorithms
High-temperature superconductors
Illumination
Interference
Lighting
Mathematical models
Optimization
Payloads
Penalty function
Precoding
Quadratic programming
Satellite broadcasting
Satellite communications
Satellites
selective precoding
user scheduling
ISSN:1536-1276, 1558-2248
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Beam Hopping (BH) is a popular technique considered for next-generation multi-beam satellite communication system which allows a satellite focusing its resources on where they are needed by selectively illuminating beams. While beam illumination plan can be adjusted according to its needs, the main limitation of convectional BH is the adjacent beam avoidance requirement needed to maintain acceptable levels of interference. With the recent maturity of precoding technique, a natural way forward is to consider a dynamic beam illumination scheme with selective precoding, where large areas with high-demand can be covered by multiple active precoded beams. In this paper, we mathematically model such beam illumination design problem employing an interference-based penalty function whose goal is to avoid precoding whenever possible subject to beam demand satisfaction constraints. The problem can be written as a binary quadratic programming (BQP). Next, two convexification frameworks are considered namely: (i) A Semi-Definition Programming (SDP) approach particularly targeting BQP type of problems, and (ii) Multiplier Penalty and Majorization-Minimization (MPMM) based method which guarantees to converge to a local optimum. Finally, a greedy algorithm is proposed to alleviate complexity with minimal impact on the final performance. Supporting results based on numerical simulations show that the proposed schemes outperform the relevant benchmarks in terms of demand matching performance while minimizing the use of precoding.
AbstractList Beam Hopping (BH) is a popular technique considered for next-generation multi-beam satellite communication system which allows a satellite focusing its resources on where they are needed by selectively illuminating beams. While beam illumination plan can be adjusted according to its needs, the main limitation of convectional BH is the adjacent beam avoidance requirement needed to maintain acceptable levels of interference. With the recent maturity of precoding technique, a natural way forward is to consider a dynamic beam illumination scheme with selective precoding, where large areas with high-demand can be covered by multiple active precoded beams. In this paper, we mathematically model such beam illumination design problem employing an interference-based penalty function whose goal is to avoid precoding whenever possible subject to beam demand satisfaction constraints. The problem can be written as a binary quadratic programming (BQP). Next, two convexification frameworks are considered namely: (i) A Semi-Definition Programming (SDP) approach particularly targeting BQP type of problems, and (ii) Multiplier Penalty and Majorization-Minimization (MPMM) based method which guarantees to converge to a local optimum. Finally, a greedy algorithm is proposed to alleviate complexity with minimal impact on the final performance. Supporting results based on numerical simulations show that the proposed schemes outperform the relevant benchmarks in terms of demand matching performance while minimizing the use of precoding.
Author Lagunas, Eva
Wu, Linlong
Ha, Vu Nguyen
Ottersten, Bjorn
Chen, Lin
Chatzinotas, Symeon
Author_xml – sequence: 1
  givenname: Lin
  orcidid: 0000-0002-9375-4113
  surname: Chen
  fullname: Chen, Lin
  email: lin.chen@uni.lu
  organization: Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg, Luxembourg
– sequence: 2
  givenname: Vu Nguyen
  orcidid: 0000-0003-1325-3480
  surname: Ha
  fullname: Ha, Vu Nguyen
  organization: Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg, Luxembourg
– sequence: 3
  givenname: Eva
  orcidid: 0000-0002-9936-7245
  surname: Lagunas
  fullname: Lagunas, Eva
  organization: Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg, Luxembourg
– sequence: 4
  givenname: Linlong
  orcidid: 0000-0003-4521-2026
  surname: Wu
  fullname: Wu, Linlong
  organization: Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg, Luxembourg
– sequence: 5
  givenname: Symeon
  orcidid: 0000-0001-5122-0001
  surname: Chatzinotas
  fullname: Chatzinotas, Symeon
  organization: Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg, Luxembourg
– sequence: 6
  givenname: Bjorn
  orcidid: 0000-0003-2298-6774
  surname: Ottersten
  fullname: Ottersten, Bjorn
  organization: Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg, Luxembourg
BackLink https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-337554$$DView record from Swedish Publication Index (Kungliga Tekniska Högskolan)
BookMark eNp9kUtP3DAURq0KpPLovlI3lrrOEL-d7mB4SggqzbQsLY_nhjFN4mB7gPn3ZAhi0QUre3HOZ9_77aOdLnSA0HdSTggpq6P53XRCS0onjBLGif6C9ogQuqCU653tncmCUCW_ov2UHsqSKCnEHvLzFeAbeMn4AjqINvvQ4VDjE7Atvgx977t7PLMZmsZnwLNNytCmX_h009nWu5G7app167tRvvN5hWfQgMv-CfDvCC4sh5RDtFvbJsG39_MA_Tk_m08vi-vbi6vp8XXhmCK5UFw5uVDccc3rhWKOg1T1MAooy23lLCydU3oYWSntrLZARS2WcslrXYtKsQNUjLnpGfr1wvTRtzZuTLDenPq_xybEe_MvrwxjSgg-8D9Hvo_hcQ0pm4ewjt3wRUNVVWkupawGqhwpF0NKEeqPXFKabQFmKMBsCzDvBQyK_E9xPr_tKEfrm8_EH6PoAeDjnaqiTBLFXgHreZVv
CODEN ITWCAX
CitedBy_id crossref_primary_10_1109_TVT_2024_3393924
crossref_primary_10_1109_OJCOMS_2025_3602090
crossref_primary_10_4108_eettti_6812
crossref_primary_10_3390_s25010199
crossref_primary_10_1109_TWC_2024_3368689
crossref_primary_10_1109_TWC_2024_3508741
crossref_primary_10_1109_TCCN_2024_3516034
crossref_primary_10_1016_j_comnet_2025_111152
crossref_primary_10_1109_TCOMM_2023_3334815
crossref_primary_10_34133_space_0199
crossref_primary_10_1016_j_neucom_2024_129278
crossref_primary_10_1109_JIOT_2025_3532928
crossref_primary_10_1109_ACCESS_2025_3563252
crossref_primary_10_1109_JIOT_2023_3333332
crossref_primary_10_3390_s23042116
crossref_primary_10_1109_TWC_2024_3417707
crossref_primary_10_1109_TWC_2024_3463002
crossref_primary_10_1002_sat_70000
crossref_primary_10_1109_JIOT_2025_3575950
crossref_primary_10_1109_TVT_2023_3332142
crossref_primary_10_1109_COMST_2024_3450292
crossref_primary_10_1109_TWC_2025_3528964
crossref_primary_10_1109_ACCESS_2023_3322445
crossref_primary_10_1109_LWC_2025_3544635
crossref_primary_10_1109_JIOT_2024_3432901
crossref_primary_10_1109_TVT_2023_3292554
crossref_primary_10_1016_j_swevo_2025_102039
crossref_primary_10_1002_sat_1548
Cites_doi 10.1109/TBC.2017.2755263
10.1016/B978-0-444-59507-2.50064-0
10.1109/TCOMM.2004.840638
10.1017/CBO9780511804441
10.1049/cp.2018.1711
10.1137/0314017
10.1137/120891009
10.1109/ACCESS.2021.3064980
10.1109/ACCESS.2020.3011746
10.3389/frsip.2021.721682
10.1007/978-3-319-76571-6_5
10.1109/MSP.2010.936019
10.1109/GLOBECOM38437.2019.9013589
10.1002/sat.1122
10.1080/10556788.2017.1322081
10.1109/VTC2021-Fall52928.2021.9625524
10.1109/COMST.2020.3028247
10.2514/6.2015-4318
10.1017/S0962492913000032
10.1109/MSP.2019.2894391
10.23919/EUSIPCO54536.2021.9616240
10.1109/TSP.2016.2621723
10.1109/ASMS-SPSC.2010.5586860
10.1007/0-387-30528-9_7
10.1016/0005-1098(76)90077-7
10.1109/TWC.2021.3088609
10.1109/TPAMI.2016.2541146
10.2514/6.2006-5376
10.1109/WCNC51071.2022.9771918
10.1109/ICC.2012.6364414
10.1051/ro:2008011
10.1109/MCOM.001.1900411
10.1109/JCN.2011.6112304
10.1109/MWC.2016.1500047WC
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
DBID 97E
ESBDL
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
ADTPV
AFDQA
AOWAS
D8T
D8V
ZZAVC
DOI 10.1109/TWC.2022.3213418
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005-present
IEEE Open Access Journals
IEEE All-Society Periodicals Package (ASPP) 1998-Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
SwePub
SWEPUB Kungliga Tekniska Högskolan full text
SwePub Articles
SWEPUB Freely available online
SWEPUB Kungliga Tekniska Högskolan
SwePub Articles full text
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-2248
EndPage 2682
ExternalDocumentID oai_DiVA_org_kth_337554
10_1109_TWC_2022_3213418
9923617
Genre orig-research
GrantInformation_xml – fundername: “FlexSAT: Resource Optimization for Next Generation of Flexible SATellite Payloads”
  grantid: C19/IS/13696663
  funderid: 10.13039/501100001866
– fundername: Luxembourg National Research Fund (FNR)
GroupedDBID -~X
0R~
29I
4.4
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AIBXA
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
ESBDL
HZ~
H~9
IES
IFIPE
IPLJI
JAVBF
LAI
M43
O9-
OCL
P2P
RIA
RIE
RNS
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
ADTPV
AFDQA
AOWAS
D8T
D8V
ZZAVC
ID FETCH-LOGICAL-c371t-747c6b74c484fb73c4e67f155e7a4a9caedcc78109778ca8ae25f5d6d4f8f5973
IEDL.DBID RIE
ISICitedReferencesCount 38
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000970604800033&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1536-1276
IngestDate Tue Nov 04 16:30:31 EST 2025
Fri Jul 25 12:25:11 EDT 2025
Sat Nov 29 06:23:55 EST 2025
Tue Nov 18 22:33:26 EST 2025
Wed Aug 27 02:14:27 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
License https://creativecommons.org/licenses/by/4.0/legalcode
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c371t-747c6b74c484fb73c4e67f155e7a4a9caedcc78109778ca8ae25f5d6d4f8f5973
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-2298-6774
0000-0001-5122-0001
0000-0002-9936-7245
0000-0003-1325-3480
0000-0003-4521-2026
0000-0002-9375-4113
OpenAccessLink https://ieeexplore.ieee.org/document/9923617
PQID 2799846669
PQPubID 105736
PageCount 17
ParticipantIDs swepub_primary_oai_DiVA_org_kth_337554
crossref_primary_10_1109_TWC_2022_3213418
crossref_citationtrail_10_1109_TWC_2022_3213418
proquest_journals_2799846669
ieee_primary_9923617
PublicationCentury 2000
PublicationDate 2023-04-01
PublicationDateYYYYMMDD 2023-04-01
PublicationDate_xml – month: 04
  year: 2023
  text: 2023-04-01
  day: 01
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on wireless communications
PublicationTitleAbbrev TWC
PublicationYear 2023
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
ref15
ref14
(ref49) 2017
ref16
ref19
ref18
Bishop (ref38) 2006; 128
(ref17) 2020
Nissfolk (ref39) 2016
ref46
ref45
ref47
ref42
ref41
ref44
(ref7) 2022
(ref10) 2022
ref4
ref6
ref5
ref40
ref35
ref34
ref37
ref36
Jain (ref48) 1984
(ref28) 2020
ref31
ref30
ref33
ref32
ref2
ref1
(ref11) 2020
(ref8) 2021
ref24
ref23
ref26
ref25
(ref12) 2020
ref22
ref21
(ref3) 2020
ref27
ref29
Freedman (ref20)
(ref43) 2021
(ref9) 2022
References_xml – ident: ref23
  doi: 10.1109/TBC.2017.2755263
– ident: ref32
  doi: 10.1016/B978-0-444-59507-2.50064-0
– ident: ref36
  doi: 10.1109/TCOMM.2004.840638
– volume: 128
  start-page: 1
  issue: 9
  year: 2006
  ident: ref38
  article-title: Pattern recognition and machine learning
  publication-title: Mach. Learn.
– ident: ref47
  doi: 10.1017/CBO9780511804441
– ident: ref19
  doi: 10.1049/cp.2018.1711
– ident: ref33
  doi: 10.1137/0314017
– volume-title: How to Solve Binary Quadratic Problems With Mosek
  year: 2021
  ident: ref43
– ident: ref45
  doi: 10.1137/120891009
– ident: ref16
  doi: 10.1109/ACCESS.2021.3064980
– volume-title: Physical and MAC Layer Performance Estimation of the Selected Techniques
  year: 2017
  ident: ref49
– start-page: 1
  volume-title: Proc. Ka Broadband Commun. Conf.
  ident: ref20
  article-title: Beam hopping how to make it possible
– volume-title: Dynamic Spectrum Sharing and Bandwidth-Efficient Techniques for High Throughput MIMO Satellite Systems
  year: 2020
  ident: ref11
– ident: ref27
  doi: 10.1109/ACCESS.2020.3011746
– ident: ref30
  doi: 10.3389/frsip.2021.721682
– ident: ref37
  doi: 10.1007/978-3-319-76571-6_5
– ident: ref46
  doi: 10.1109/MSP.2010.936019
– ident: ref29
  doi: 10.1109/GLOBECOM38437.2019.9013589
– ident: ref13
  doi: 10.1002/sat.1122
– volume-title: SES-17 Satellite
  year: 2022
  ident: ref10
– volume-title: Technical Capabilities of Eutelsat Quantum
  year: 2022
  ident: ref9
– ident: ref42
  doi: 10.1080/10556788.2017.1322081
– volume-title: Demonstrator of Precoding Techniques for Flexible Broadband Satellite Systems
  year: 2020
  ident: ref28
– volume-title: NetWorld2020—Satellite Working Group, White Paper
  year: 2022
  ident: ref7
– ident: ref35
  doi: 10.1109/VTC2021-Fall52928.2021.9625524
– ident: ref4
  doi: 10.1109/COMST.2020.3028247
– year: 2016
  ident: ref39
  article-title: Binary quadratic optimization
– ident: ref18
  doi: 10.2514/6.2015-4318
– ident: ref21
  doi: 10.1017/S0962492913000032
– ident: ref5
  doi: 10.1109/MSP.2019.2894391
– ident: ref1
  doi: 10.23919/EUSIPCO54536.2021.9616240
– ident: ref34
  doi: 10.1109/TSP.2016.2621723
– volume-title: Eastern Research Laboratory, Digital Equipment Corporation
  year: 1984
  ident: ref48
  article-title: A quantitative measure of fairness and discrimination
– ident: ref25
  doi: 10.1109/ASMS-SPSC.2010.5586860
– volume-title: Eutelsat Quantum
  year: 2021
  ident: ref8
– ident: ref41
  doi: 10.1007/0-387-30528-9_7
– volume-title: AI Powered Ground Segment Control for Flexible Payloads
  year: 2020
  ident: ref12
– ident: ref44
  doi: 10.1016/0005-1098(76)90077-7
– ident: ref6
  doi: 10.1109/TWC.2021.3088609
– ident: ref31
  doi: 10.1109/TPAMI.2016.2541146
– ident: ref22
  doi: 10.2514/6.2006-5376
– volume-title: Deputy Secretary-General Remarks at the General Assembly
  year: 2020
  ident: ref3
– ident: ref15
  doi: 10.1109/WCNC51071.2022.9771918
– ident: ref24
  doi: 10.1109/ICC.2012.6364414
– ident: ref40
  doi: 10.1051/ro:2008011
– ident: ref2
  doi: 10.1109/MCOM.001.1900411
– volume-title: Beam Hopping: Ready Technology
  year: 2020
  ident: ref17
– ident: ref26
  doi: 10.1109/JCN.2011.6112304
– ident: ref14
  doi: 10.1109/MWC.2016.1500047WC
SSID ssj0017655
Score 2.593248
Snippet Beam Hopping (BH) is a popular technique considered for next-generation multi-beam satellite communication system which allows a satellite focusing its...
SourceID swepub
proquest
crossref
ieee
SourceType Open Access Repository
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 2666
SubjectTerms binary quadratic programming
Communications systems
Demand
Dynamic beam illumination
Greedy algorithms
High-temperature superconductors
Illumination
Interference
Lighting
Mathematical models
Optimization
Payloads
Penalty function
Precoding
Quadratic programming
Satellite broadcasting
Satellite communications
Satellites
selective precoding
user scheduling
Title The Next Generation of Beam Hopping Satellite Systems: Dynamic Beam Illumination With Selective Precoding
URI https://ieeexplore.ieee.org/document/9923617
https://www.proquest.com/docview/2799846669
https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-337554
Volume 22
WOSCitedRecordID wos000970604800033&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE/IET Electronic Library
  customDbUrl:
  eissn: 1558-2248
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0017655
  issn: 1536-1276
  databaseCode: RIE
  dateStart: 20020101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NT9wwEB0B6oEeoC1UXT4qH6pKlQi7JN6MzY2PInpZIUELN8uxJxAVdhEEfj8eO0QgVUi95WBbVp4_5nns9wC-aVl4LXPJL3rGmbTkMuVrnTmSPF7QjpyKZhM4maiLC30yB1v9WxgiipfPaJs_Yy7fz9wDH5UNtWapEJyHeURMb7X6jAGW0eE0TGD2lcE-JTnSw7Pzg0AE83y7iPJl6tUWFD1VXoeXLyVD4zZztPx_HfwAS104KfYS_h9hjqaf4P0LkcEVaMJIEJOwBoskMc1IiFkt9sneiOMZ6zNcilMblTlbEp2E-a44TF71qdwvNkRu0smhOG_aK3EaDXTCWilOmFTzFrgKv49-nh0cZ53BQuYK3GmzQCVcWaF0Usm6wsJJKrEOEQahlVY7S945VJykRuWsspSP67EvvaxVHZhI8RkWprMpfQHh62rHU16NKyslUaEoNKNs7mVJlS_lAIbP_9y4Tn2cTTCuTWQhI20CSoZRMh1KA_jR17hNyhtvlF1hMPpyHQ4D2HiG1XRT897kGBimDKxND-B7grqvx1rbh82fPRNQNX_bK1MUGOKttX83vw6LbD6f7vFswEJ790Cb8M49ts393dc4PJ8AK7Xjog
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Nb9QwEB2VggQc-CqIhQI-ICQk0t1NJrHNrbRUW1FWlbrQ3izHntAI2EVtyu_HY6dRKyEkbjnYVpQ3tudl7PcAXmssvMYc-UZPmaEllynf6MwRcrxIO3Eqmk3I-VydnOjDNXg33IUhonj4jLb4Mdby_cpd8K-ysdYsFSJvwM0SMZ-m21pDzUBW0eM0TGF2lpFDUXKix4vjnUAF83yriAJm6tomFF1VrieYV0VD40azd___XvEB3OsTSrGdIuAhrNHyEdy9IjO4AW2IBTEPq7BIItOMhVg14gPZn2K2YoWGb-LIRm3OjkQvYv5e7Ca3-tRuny2R2_TvUBy33ak4ihY6YbUUh0yreRN8DF_2Pi52ZllvsZC5Qk67LJAJV9USHSpsalk4pEo2IccgadFqZ8k7JxWXqaVyVlnKy6b0lcdGNYGLFE9gfbla0lMQvqmnnvK6rC0iUaEoDKNs7rGi2lc4gvHlNzeu1x9nG4wfJvKQiTYBJcMomR6lEbwdevxK2hv_aLvBYAztehxGsHkJq-kn57nJZeCYGHibHsGbBPXQj9W2d9uv2yagar53p6YoZMi4nv19-Fdwe7b4fGAO9uefnsMdtqJPp3o2Yb07u6AXcMv97trzs5cxVP8AJYbm6Q
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=The+Next+Generation+of+Beam+Hopping+Satellite+Systems%3A+Dynamic+Beam+Illumination+With+Selective+Precoding&rft.jtitle=IEEE+transactions+on+wireless+communications&rft.au=Chen%2C+Lin&rft.au=Ha%2C+Vu+Nguyen&rft.au=Lagunas%2C+Eva&rft.au=Wu%2C+Linlong&rft.date=2023-04-01&rft.issn=1536-1276&rft.eissn=1558-2248&rft.volume=22&rft.issue=4&rft.spage=2666&rft.epage=2682&rft_id=info:doi/10.1109%2FTWC.2022.3213418&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TWC_2022_3213418
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1536-1276&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1536-1276&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1536-1276&client=summon