• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.117-120
• /
• 2001

In this paper, we propose a robust trellis coded modulation for a correlated Rayleigh fading channel. This method use only one transmit antenna, which can achieve superior performance compared to Space-Time Trellis Coded Modulation (STTC) over a wide channel correlation range among transmit antennas. The code is designed to have the largest Euclidean distance between faded signals at the receiver. Computer simulations are performed to evaluate the frame error rate (FER) performance and to compare the proposed code with the conventional one.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.121-124
• /
• 2001

In this paper, we propose a robust trellis coded OFDM(orthogonal frequency division multiplexing) system for wireless communications over frequency selective fading channels. Computer simulations show that the proposed system achieves the better frame error rate(FER) performance as compared with the conventional Space time coded OFDM system in the correlated channel with multiple transmitter antennas.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.10
• /
• pp.1869-1876
• /
• 2006

Recently, STC techniques have been considered to be candidate to support multimedia services in the next generation mobile radio communications and have been developed the many communications systems in order to achieve the high data rates. In this paper, we Nose the Trellis-Coded Differential Space Time Modulation system with multiple symbol detection. The Trellis-code performs the set partition with unitary group codes. The Viterbi decoder containing new branch metrics is introduced in order to improve the bit error rate (BER) in the differential detection of the unitary differential space time modulation. Also, we describe the Viterbi algorithm in order to use this branch metrics. Our study shows that such a Viterbi decoder improves BER performance without sacrificing bandwidth and power efficiency.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.7 s.349
• /
• pp.132-142
• /
• 2006

In this paper, we present a candidate high data rate space time coded OFDM system for short range personal networking. The system transmits the complex space time coded signals with a hybrid orthogonal frequency division multiplexing (OFDM) based on ultra wideband (UWB) pulses. The transmitted signals are sparse pulse trains modulated by a frequency selected from a properly designed set of frequencies. Additionally, a widely linear (WL) receive filter and a space time frequency transmission are designed by using two simple parallel linear detectors. To overcome the deeply fade in the propagation system, a beamforming combined with space time block codes also 따 e briefly discussed.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.3
• /
• pp.223-229
• /
• 2004

Recently, OFDM and STC techniques have been considered to be candidate to support multimedia services in the next generation mobile radio communications and have been developed the many communications systems in order to achieve the high data rates. In this paper, we propose the Trellis-Coded Differential Space Time Modulation-OFDM system with multiple symbol detection. The Trellis-code performs the set partition with unitary group codes. The Viterbi decoder containing new branch metrics is introduced in order to improve the bit error rate (BER) in the differential detection of the unitary differential space time modulation. Also, we describe the Viterbi algorithm in order to use this branch metrics. Our study shows that such a Viterbl decoder improves BER performance without sacrificing bandwidth and power efficiency.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.7
• /
• pp.24-35
• /
• 2018

In wireless communications environments, a link adaptation technique that selects the proper rate from among several transmission rates is adopted to cope with variations in channel status. In block coded modulation, the frame time and/or the block length can be adjusted to the channel status. A smaller frame time can cause inter-frame interference (IFI), however, a larger frame time can reduce the data rate. Therefore, frame time is the design factor decided by a tradeoff between performance and the data rate. This paper presents a method to determine the frame time based on the processing gain for the channel model, CM1~CM4, recommended by IEEE 802.15a. Also, a link adaptation technique for block coded modulation is proposed for efficient communications by varying the frame time and the block length. Through simulation, link adaptation can be carried out with a step size of 2~5 nsec in a frame time range of 14~ 50 nsec for channel models CM1~CM4.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.79-88
• /
• 2008

In this paper, we propose efficient peer assignment algorithms for low-latency transmission of scalable coded images in peer-to-peer networks, in which peers may dynamically join and leave the networks. The objective of our algorithm is to minimize the transmission time of a requested image that is scalable coded. When an image is scalable coded in different bit rates, the bit stream encoded in a lower bit rate is a prefix subset of the one encoded in a higher bit rate. Therefore, a peer with the same requested image coded in any bit rate, even when it is different from the requested rate, may work as a supplying peer. As a result, when a scalable coded image is requested, more supplying peers can be found in peer-to-peer networks to help with the transfer. However, the set of supplying peers is not static during transmission, as the peers in this set may leave the network or finish their transmission at different times. The proposed peer assignment algorithms have taken into account the above constraints. In this paper, we first prove the existence of an optimal peer assignment solution for a simple identity permutation function, and then formulate peer assignment with this identity permutation as a mixed-integer programming problem. Next, we discuss how to address the problem of dynamic peer departures during image transmission. Finally, we carry out experiments to evaluate the performance of proposed peer assignment algorithms.

• Korean Journal of Optics and Photonics
• /
• v.27 no.4
• /
• pp.133-142
• /
• 2016

This paper presents the design and simulation of a three-dimensional pixel-by-pixel scanning light detection and ranging (LIDAR) system with a microelectromechanical system (MEMS) scanning mirror and direct sequence optical code division multiple access (DS-OCDMA) techniques. It measures a frame with $848{\times}480$ pixels at a refresh rate of 60 fps. The emitted laser pulse waves of each pixel are coded with DS-OCDMA techniques. The coded laser pulse waves include the pixel's position in the frame, and a checksum. The LIDAR emits the coded laser pulse waves periodically, without idle listening time to receive returning light at the receiver. The MEMS scanning mirror is used to deflect and steer the coded laser pulse waves to a specific target point. When all the pixels in a frame have been processed, the travel time is used by the pixel-by-pixel scanning LIDAR to generate point cloud data as the measured result.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.44-54
• /
• 2008

In this paper, an iterative multiple symbol differential detection for turbo coded differential unitary space-time modulation using a posteriori probability (APP) demodulator is investigated. Two approaches of different complexity based on linear prediction are presented to utilize the temporal correlation of fading for the APP demodulator. The first approach intends to take account of all possible previous symbols for linear prediction, thus requiring an increase of the number of trellis states of the APP demodulator. In contrast, the second approach applies Viterbi algorithm to assist the APP demodulator in estimating the previous symbols, hence allowing much reduced decoding complexity. These two approaches are found to provide a trade-off between performance and complexity. It is shown through simulation that both approaches can offer significant BER performance improvement over the conventional differential detection under both correlated slow and fast Rayleigh flat-fading channels. In addition, when comparing the first approach to a modified bit-interleaved turbo coded differential space-time modulation counterpart of comparable decoding complexity, the proposed decoding structure can offer performance gain over 3 dB at BER of $10^{-5}$.

• Nuclear Engineering and Technology
• /
• v.53 no.4
• /
• pp.1266-1276
• /
• 2021

The mask parameters of a coded aperture are critical design features when optimizing the performance of a gamma-ray camera. In this paper, experiments and Monte Carlo simulations were performed to derive the minimum detectable activity (MDA) when one seeks a real-time imaging capability. First, the impact of the thickness of the modified uniformly redundant array (MURA) mask on the image quality is quantified, and the imaging of point, line, and surface radiation sources is demonstrated using both cross-correlation (CC) and maximum likelihood expectation maximization (MLEM) methods. Second, the minimum detectable activity is also derived for real-time imaging by altering the factors used in the image quality assessment, consisting of the peak-to-noise ratio (PSNR), the normalized mean square error (NMSE), the spatial resolution (full width at half maximum; FWHM), and the structural similarity (SSIM), all evaluated as a function of energy and mask thickness. Sufficiently sharp images were reconstructed when the mask thickness was approximately 2 cm for a source energy between 30 keV and 1.5 MeV and the minimum detectable activity for real-time imaging was 23.7 MBq at 1 m distance for a 1 s collection time.