• 제목/요약/키워드: Space communications

검색결과 2,127건 처리시간 0.028초

달 탐사를 위한 우주통신에서 텔레메트리 링크에 대한 최대 전송속도 성능분석 (Performance Analysis of Maximum Data Rate for Telemetry Links in Space Communications for Lunar Explorations)

  • 이우주;윤동원;이재윤
    • 한국항공우주학회지
    • /
    • 제39권1호
    • /
    • pp.42-49
    • /
    • 2011
  • 달 탐사를 위한 우주 통신 하향링크는 대용량 데이터의 전송을 위해 높은 전송속도를 요구한다. 따라서 본 논문에서는 달 탐사를 위한 하향링크 S, X, Ku, Ka 대역별로 CCSDS에서 권고하는 변조 및 채널 부호화 기법에 대하여 전송속도를 분석한다. 이를 통해 달 탐사를 위한 텔리메트리 링크에 대하여 최대 전송속도를 가지며 링크마진을 만족하는 변조 및 채널 부호화 기법을 제시한다.

Simple Signal Detection Algorithm for 4+12+16 APSK in Satellite and Space Communications

  • Lee, Jae-Yoon;Yoon, Dong-Weon;Hyun, Kwang-Min
    • Journal of Astronomy and Space Sciences
    • /
    • 제27권3호
    • /
    • pp.221-230
    • /
    • 2010
  • A 4+12+16 amplitude phase shift keying (APSK) modulation outperforms other 32-APSK modulations in a nonlinear additive white Gaussian noise (AWGN) channel because of its intrinsic robustness against AM/AM and AM/PM distortions caused by the nonlinear characteristics of a high-power amplifier. Thus, this modulation scheme has been adopted in the digital video broadcasting-satellite2 European standard. And it has been considered for high rate transmission of telemetry data on deep space communications in consultative committee for space data systems which provides a forum for discussion of common problems in the development and operation of space data systems. In this paper, we present an improved bits-to-symbol mapping scheme with a better bit error rate for a 4+12+16 APSK signal in a nonlinear AWGN channel and propose a simple signal detection algorithm for the 4+12+16 APSK from the presented bit mapping.

A New Multiuser Receiver for the Application Of Space-time Coded OFDM Systems

  • Pham, Van-Su;Le, Minh-Tuan;Mai, Linh;Lee, Jae-Young;Yoon, Gi-Wan
    • Journal of information and communication convergence engineering
    • /
    • 제4권4호
    • /
    • pp.151-154
    • /
    • 2006
  • In this work, a novel optimal multiuser detection (MUD) approach, which not only achieves the optimal maximum-likelihood (ML)-like performance but also has reasonably low computational complexity, for Space-time coded OFDM (ST-OFDM) systems is presented. In the proposed detection scheme, the signal model is firstly re-expressed into linearly equivalent one. Then, with the linearly equivalent signal model, a new jointly MUD algorithm is proposed to detect signals. The ML-like bit-error-rate (BER) performance and reasonably low complexity of the proposed detection are verified by computer simulations.

A Simplified Efficient Algorithm for Blind Detection of Orthogonal Space-Time Block Codes

  • Pham, Van Su;Mai, Linh;Lee, Jae-Young;Yoon, Gi-Wan
    • Journal of information and communication convergence engineering
    • /
    • 제6권3호
    • /
    • pp.261-265
    • /
    • 2008
  • This work presents a simplified efficient blind detection algorithm for orthogonal space-time codes(OSTBC). First, the proposed decoder exploits a proper decomposition approach of the upper triangular matrix R, which resulted from Cholesky-factorization of the composition channel matrix, to form an easy-to-solve blind detection equation. Secondly, in order to avoid suffering from the high computational load, the proposed decoder applies a sub-optimal QR-based decoder. Computer simulation results verify that the proposed decoder allows to significantly reduce computational complexity while still satisfying the bit-error-rate(BER) performance.

Performance Analysis of M-ary Optical Communication over Log-Normal Fading Channels for CubeSat Platforms

  • Lim, Hyung-Chul;Yu, Sung-Yeol;Sung, Ki-Pyoung;Park, Jong Uk;Choi, Chul-Sung;Choi, Mansoo
    • Journal of Astronomy and Space Sciences
    • /
    • 제37권4호
    • /
    • pp.219-228
    • /
    • 2020
  • A CubeSat platform has become a popular choice due to inexpensive commercial off-the-shelf (COTS) components and low launch cost. However, it requires more power-efficient and higher-data rate downlink capability for space applications related to remote sensing. In addition, the platform is limited by the size, weight and power (SWaP) constraints as well as the regulatory issue of licensing the radio frequency (RF) spectrum. The requirements and limitations have put optical communications on promising alternatives to RF communications for a CubeSat platform, owing to the power efficiency and high data rate as well as the license free spectrum. In this study, we analyzed the performance of optical downlink communications compatible with CubeSat platforms in terms of data rate, bit error rate (BER) and outage probability. Mathematical models of BER and outage probability were derived based on not only the log-normal model of atmospheric turbulence but also a transmitter with a finite extinction ratio. Given the fixed slot width, the optimal guard time and modulation orders were chosen to achieve the target data rate. And the two performance metrics, BER and outage data rate, were analyzed and discussed with respect to beam divergence angle, scintillation index and zenith angle.

Power-Space Functions in High Speed Railway Wireless Communications

  • Dong, Yunquan;Zhang, Chenshuang;Fan, Pingyi;Fan, Pingzhi
    • Journal of Communications and Networks
    • /
    • 제17권3호
    • /
    • pp.231-240
    • /
    • 2015
  • To facilitate the base station planning in high speed railway communication systems, it is necessary to consider the functional relationships between the base station transmit power and space parameters such as train velocity and cell radius. Since these functions are able to present some inherent system properties determined by its spatial topology, they will be referred to as the power-space functions in this paper. In light of the fact that the line-of-sight path persists the most power of the received signal of each passing train, this paper considers the average transmission rate and bounds on power-space functions based on the additive white Gaussian noise channel (AWGN) model. As shown by Monte Carlo simulations, using AWGN channel instead of Rician channel introduces very small approximation errors, but a tractable mathematical framework and insightful results. Particularly, lower bounds and upper bounds on the average transmission rate, as well as transmit power as functions of train velocity and cell radius are presented in this paper. It is also proved that to maintain a fixed amount of service or a fixed average transmission rate, the transmit power of a base station needs to be increased exponentially, if the train velocity or cell radius is increased, respectively.

A Study of Ordering Sphere Decoder Class for Space-Time Codes

  • Pham, Van-Su;Mai, Linh;Kabir, S.M. Humayun;Yoon, Gi-Wan
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2008년도 춘계종합학술대회 A
    • /
    • pp.567-571
    • /
    • 2008
  • In this paper, an overview on the ordering sphere decoder (SD) class for space-time codes (STC) will be presented. In SDs, the ordering techniques are considered as promising methods for reducing complexity by exploiting a sorted list of candidates, thus decreasing the number of tested points. First, we will present the current state of art of SD with their advantages and disadvantages. Then, the overview of simply geometrical approaches for ordering is presented to address the question to overcome the disadvantages. The computer simulation results shown that, thanks to the aid of ordering, the ordering SDs can achieve optimal bit-error-rate (BER) performance while requiring the very low complexity, which is comparable to that of linear sub-optimal decoders.

  • PDF

A Study on Complexity Reduction for Space-Time Block Codes Decoder in MIMO OFDM systems

  • Pham, Van-Su;Le, Minh-Tuan;Mai, Linh;Yoon, Gi-Wan
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2005년도 춘계종합학술대회
    • /
    • pp.117-121
    • /
    • 2005
  • In this work, we first present our study on the decoding schemes for space-time block code as well as our comments on their complexity. Then, we propose a new modified complex sphere decoding scheme, which has lower computational load than that of conventional complex sphere decoders. In the proposed scheme, the boundary for searching is defined by the intersection of an approximate polygon of searching circle and disk of lattice constellation. Therefore, the proposed scheme can reduce the searching boundary and it can avoid missing searching points as well. The performance of the proposed scheme, which is verified by computer simulations, consolidates our scheme.

  • PDF

Complexity Reduction for Space-Time Block Codes Decoder in MIMO OFDM Systems

  • Pham Van-Su;Le Minh-Tuan;Mai Linh;Yoon Giwan
    • Journal of information and communication convergence engineering
    • /
    • 제3권2호
    • /
    • pp.72-75
    • /
    • 2005
  • In this work, we first present our study on the decoding schemes for space-time block code as well as our comments on their complexity. Then, we propose a new modified complex sphere decoding scheme, which has lower computational load than that of conventional complex sphere decoders. In the proposed scheme, the boundary for searching is aided with the intersection of approximate polygon of searching circle and disk of constellation. Therefore, the proposed scheme can reduce the searching boundary while can avoid missing searching points. The performance of the proposed scheme is verified by computer simulation that consolidates our scheme.