• Title/Summary/Keyword: Minimization of delays

Search Result 12, Processing Time 0.122 seconds

Near-Optimal Low-Complexity Hybrid Precoding for THz Massive MIMO Systems

  • Yuke Sun;Aihua Zhang;Hao Yang;Di Tian;Haowen Xia
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.4
    • /
    • pp.1042-1058
    • /
    • 2024
  • Terahertz (THz) communication is becoming a key technology for future 6G wireless networks because of its ultra-wide band. However, the implementation of THz communication systems confronts formidable challenges, notably beam splitting effects and high computational complexity associated with them. Our primary objective is to design a hybrid precoder that minimizes the Euclidean distance from the fully digital precoder. The analog precoding part adopts the delay-phase alternating minimization (DP-AltMin) algorithm, which divides the analog precoder into phase shifters and time delayers. This effectively addresses the beam splitting effects within THz communication by incorporating time delays. The traditional digital precoding solution, however, needs matrix inversion in THz massive multiple-input multiple-output (MIMO) communication systems, resulting in significant computational complexity and complicating the design of the analog precoder. To address this issue, we exploit the characteristics of THz massive MIMO communication systems and construct the digital precoder as a product of scale factors and semi-unitary matrices. We utilize Schatten norm and Hölder's inequality to create semi-unitary matrices after initializing the scale factors depending on the power allocation. Finally, the analog precoder and digital precoder are alternately optimized to obtain the ultimate hybrid precoding scheme. Extensive numerical simulations have demonstrated that our proposed algorithm outperforms existing methods in mitigating the beam splitting issue, improving system performance, and exhibiting lower complexity. Furthermore, our approach exhibits a more favorable alignment with practical application requirements, underlying its practicality and efficiency.

Determination of Optimal Locations for the Variable Message Signs by The Genetic Algorithm (유전자 알고리즘을 이용한 VMS의 최적위치 선정에 관한 연구)

  • Lee, Sooil;Oh, Seung-hoon;Lee, Byeong-saeng
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.26 no.6D
    • /
    • pp.927-933
    • /
    • 2006
  • The Variable Message Signs (VMS) are useful way to reduce the socio-economic costs due to the traffic congestions and delays by providing the information on traffic condition to drivers. This study provided a methodology to determine the locations of VMS's in terms of the minimization of the delay by applying the genetic algorithm. The optimal number of VMS's was also derived by the economic analysis based on the cost and the benefit. The simulation considered the variation of traffic volume, the frequency and duration of the incident, and the traffic conversion in order to reflect the real situation. I've made a scenario to consider traffic volume and incident, and it can undergo through changing different traffic volume and incident in time and days and seasons. And I've comprised two kinds of result, one is based on empirical studies, the other is based on Genetic Algorithm about optimal allocation VMS. This result of using optimal location VMS, reduce total travel time rather than preceding study based on normal location VMS and we can estimate optimal location VMS each one.