• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.1
• /
• pp.42-49
• /
• 2011

Telemetry link requires high data rate to transmit the multimedia data for lunar explorations in space communications. In this paper, we analyze a data rate with the modulation and channel coding schemes based on Consultative Committee for Space Data Systems (CCSDS) in S, X, Ku and Ka bands, respectively. Then, we suggests modulation and channel coding schemes to meet the link margins and have a maximum data rate for lunar explorations in telemetry links.

• Bulletin of the Korean Space Science Society
• /
• 1995.04a
• /
• pp.39-39
• /
• 1995

No Abstract. See Full-text

• Journal of Astronomy and Space Sciences
• /
• v.27 no.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.

• Journal of information and communication convergence engineering
• /
• v.4 no.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.

• Journal of information and communication convergence engineering
• /
• v.6 no.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.

• Journal of Astronomy and Space Sciences
• /
• v.37 no.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.

• Journal of Communications and Networks
• /
• v.17 no.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.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• 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.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• 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.

• Journal of information and communication convergence engineering
• /
• v.3 no.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.