在第六代行動通訊( 6G )，行動通訊與各種近端傳輸技術、低軌道衛星通訊系統以及包括毫米波在內等創新通信技術等將融合為一體，逐步實現不管是何時何地皆可以無縫式接收及覆蓋。然而，低軌道衛星通訊系統在第六代（6G）行動通訊中是一項新興的候選技術。 本文中，我們提出大規模多輸入多輸出（MIMO）低地球軌道（LEO）衛星通訊（SATCOM）基於全連接架構的混合波束成形。假設已知通道狀態資訊（CSI），我們可以透過已知的通道狀態資訊，設計混合發射器及混合接收器。先前有學者針對類比端進行波束設計，建立編碼簿，以波束形成增益 (Beamforming Gain) 達到最大為出發點，配置波束，指向訊號方向。前面學者所提的配置波束方法，複雜度較高。本文主要提出低複雜波束配置演算法，以達到最高傳送資料速率為出發點，配置波束。最後，選擇接下來要服務的使用者，是以SINR的大小做挑選，以確保本文提出的演算法選出的使用者與前面學者所提出之結果不會相差甚遠。這代表接下來須服務的使用者是有良好的通道，可以帶來較佳的通訊環境。總結，在本文所提出的演算法，與先前學者所提出的方法挑選接下來要服務的使用者的結果並沒有相差甚遠，且降低複雜度。 ;The sixth generation of mobile communications (6G) will integrate mobile communications with Near Field Communication (NFC), the Low Earth Orbit (LEO) satellite communications systems (SATCOM), and innovative communications technologies including millimeter waves, and gradually achieve seamless reception and coverage no matter when and where. LEO satellite communication systems are increasingly considered as a potential technology for the sixth generation (6G) of mobile communications. In the paper, we introduced a hybrid beamforming approach based on a fully connected architecture for massive Multiple-Input Multiple-Output (MIMO) Low Earth Orbit (LEO) satellite communications. Assuming that the channel state information (CSI) is known, we can design hybrid precoders and combiners based on the known channel status information. Previously, some scholars conducted analog beamformer design, making a beamforming codebook, based on the maximum beamforming gain to allocate analog beamformer and point the signal direction. The beam allocation algorithm proposed by previous scholars, but the complexity is high. This article mainly proposed a low-complexity beam allocation algorithm, based on achieving the highest transmission data rate, proposing an algorithm to allocate beamformer, and finally selecting the users to be served next based on the Signal to Interference plus Noise Ratio (SINR), to ensure that there will not a big gap between our algorithm and previous algorithm of results. This means that the users to be served next have a better channel, which can bring about a better communication environment. The proposed algorithm is not far different from the algorithm proposed by scholars in selecting the users to be served next, it reduces the complexity.
