SwePub
Tyck till om SwePub Sök här!
Sök i LIBRIS databas

  Extended search

id:"swepub:oai:DiVA.org:kth-337554"
 

Search: id:"swepub:oai:DiVA.org:kth-337554" > The Next Generation...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

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

Chen, Lin (author)
Ha, Vu Nguyen (author)
Lagunas, Eva (author)
show more...
Wu, Linlong (author)
Chatzinotas, Symeon (author)
Ottersten, Björn, 1961- (author)
University of Luxembourg, Interdisciplinary Centre for Security, Reliability and Trust (SnT), Luxembourg, 1855, Luxembourg
show less...
 (creator_code:org_t)
Institute of Electrical and Electronics Engineers (IEEE), 2023
2023
English.
In: IEEE Transactions on Wireless Communications. - : Institute of Electrical and Electronics Engineers (IEEE). - 1536-1276. ; 22:4, s. 2666-2682
  • Journal article (peer-reviewed)
Abstract Subject headings
Close  
  • 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.

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Signalbehandling (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Signal Processing (hsv//eng)

Keyword

binary quadratic programming
Dynamic beam illumination
selective precoding
user scheduling

Publication and Content Type

ref (subject category)
art (subject category)

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view