• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.93-96
• /
• 2003

In this paper, multiple trellis code is combined with differential unitary space-time modulation (DUSTM). After the set partitioning of unitary space-time constellation for multiple trellis code is described, several code constructed are provided. BER results are presented.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.8
• /
• pp.1-11
• /
• 2012

The multi-code spread spectrum communication system, which spreads data bit stream by multiplexing orthogonal codes, can transmit data in high rate. However it needs the high-cost good linear amplifier because of the multi-level output signal. In order to overcome this drawback several systems making the amplitude of output signal constant with Walsh codes have been proposed. Recently constant amplitude pre-coded multi-code spread spectrum systems using extended m-sequence have been proposed. In this paper we consider an extended m-sequence based constant amplitude multi-code spread spectrum system with code set partitioning. By grouping the orthogonal codes into 4 subsets, not only is the computational complexity of the transceiver reduced but BER performance also improves. It has been shown that parity checking on four detected codes at the receiver can correct code detection error and result in BER performance enhancement. In this paper we propose a improved parity check receiver. We carried out computer simulation to verify feasibility of the proposed algorithm.

• ETRI Journal
• /
• v.34 no.6
• /
• pp.900-910
• /
• 2012

In this paper, a novel trellis-coded spatial modulation (TCSM) design method is presented and analyzed. Inspired by the key idea of trellis-coded modulation (TCM), the detailed analysis is firstly provided on the unequal error protection performance of spatial modulation constellation. Subsequently, the Ungerboeck set partitioning rule is proposed and applied to develop a general method to design the novel TCSM schemes. Different from the conventional TCSM approaches, the novel one based on the Ungerboeck set partitioning rule has similar properties as the classic TCM, which has simple but effective code design criteria. Moreover, the novel designed schemes are robust and adaptive to the generalized Rician fading channels, which outperform the traditional TCSM ones. For examples, the novel 4-, 8-, and 16-state TCSM schemes are constructed by employing different transmit antennas and different modulation schemes in different channel conditions. Simulation results clearly demonstrate the advantages of the novel TCSM schemes over the conventional ones.

• Proceedings of the KSME Conference
• /
• 2001.06b
• /
• pp.488-494
• /
• 2001

Many literatures, so far, have concentrated on approaches employing dependent coordinates set resulting in computational burden of constraint forces, which is needless in many cases. Some researchers developed methods to remove or calculate it efficiently. But systematic generation of the motion equation using independent coordinates set by Kane's equation is possible for any closed loop system. Independent velocity transformation method builds the smallest size of motion equation, but needs practically more complicated code implementation. In this study, dependent velocity matrix is systematically transformed into independent one using dependent-independent transformation matrix of each body group, and then motion equation free of constraint force is constructed. This method is compared with the other approach by counting the number of multiplications for car model with 15 d.o.f..

• Nuclear Engineering and Technology
• /
• v.54 no.7
• /
• pp.2625-2634
• /
• 2022

Discretization errors are extremely challenging conundrums of discrete ordinates calculations for radiation transport problems with void regions. In previous work, we have presented a multi-collision source method (MCS) to overcome discretization errors, but the efficiency needs to be improved. This paper proposes a goal-oriented algorithm for the MCS method to adaptively determine the partitioning of the geometry and dynamically change the angular quadrature in remaining iterations. The importance factor based on the adjoint transport calculation obtains the response function to get a problem-dependent, goal-oriented spatial decomposition. The difference in the scalar fluxes from one high-order quadrature set to a lower one provides the error estimation as a driving force behind the dynamic quadrature. The goal-oriented algorithm allows optimizing by using ray-tracing technology or high-order quadrature sets in the first few iterations and arranging the integration order of the remaining iterations from high to low. The algorithm has been implemented in the 3D transport code ARES and was tested on the Kobayashi benchmarks. The numerical results show a reduction in computation time on these problems for the same desired level of accuracy as compared to the standard ARES code, and it has clear advantages over the traditional MCS method in solving radiation transport problems with reflective boundary conditions.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.12
• /
• pp.1792-1799
• /
• 1990

Two cases of block coded phase/frequncy modulations are investigated. minimum Euclidean distances are calculated as the function of modulation index h and rotation angle \ulcorner in the cases of 2-FSK/4-PSK and 2-FSK/8-PSK. Method of signal set partitioning is described, especially for the case of 2-FSK/8-PSK. The results are compared with S.I. Sayegh's work and shown better performance. For example, with simple parity check and repetition codes, we can get coding gain of 3 dB in the case of 2-FSK/4-PSK with block length n=4. We get 5.33 dB in the case of 2-FSK/8-PSK with n=4. And it is believed that we can get higher coding gain with proper combinations of block code and n-FSK/m-PSK type channel signal constellations.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.2
• /
• pp.103-111
• /
• 2019

The IoT-driven large-scaled systems consist of connected things with on-chip executable embedded software. These light-weighted embedded things have limited hardware space, especially small size of on-chip flash memory. In addition, on-chip embedded software in flash memory is not easy to update in runtime to equip with latest services in IoT-driven applications. It is becoming important to develop light-weighted IoT devices with various software in the limited on-chip flash memory. The remote instruction execution in cloud via IoT connectivity enables to provide high performance software execution with unlimited software instruction in cloud and low-power streaming of instruction execution in IoT edge devices. In this paper, we propose a Cloud-IoT asymmetric structure for providing high performance instruction execution in cloud, still low power code executable thing in light-weighted IoT edge environment using remote instruction execution. We propose a simulated approach to determine efficient partitioning of software runtime in cloud and IoT edge. We evaluated the instruction cloudification using remote instruction by determining the execution time by the proposed structure. The cloud-connected instruction set simulator is newly introduced to emulate the behavior of the processor. Experimental results of the cloud-IoT connected software execution using remote instruction showed the feasibility of cloudification of on-chip code flash memory. The simulation environment for cloud-connected code execution successfully emulates architectural operations of on-chip flash memory in cloud so that the various software services in IoT can be accelerated and performed in low-power by cloudification of remote instruction execution. The execution time of the program is reduced by 50% and the memory space is reduced by 24% when the cloud-connected code execution is used.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.5 no.3 s.11
• /
• pp.29-39
• /
• 2006

In this paper, we propose an efficient method to detect the signal and evaluate performance of the system in frequency selective fading channel. We combine proposed system with OFDM (Orthogonal Frequency Division Multiplexing) to improve performance of the system. First, we study the SOSTTC-OFDM system using two transmit antenna and one receive antenna, and compare performance of the proposed space-time coded OFDM with that of previous system. We expand this system to the system using four transmit antennas with the proposed decoding method. Simulation results show that the proposed decoding method can detect the signal efficiently, and we identify that the performance of the proposed system is shown with varying doppler frequency in frequency selective fading channel.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.415-417
• /
• 2005

In order to retrieve the latent and sensible heat fluxes, high-resolution airborne imageries with visible, near infrared, and thermal infrared bands and ground-base meteorology measurements are utilized in this paper. The retrieval scheme is based on the balance of surface energy budget and momentum equations. There are three basic surface parameters including surface albedo $(\alpha)$, normalized difference vegetation index (NOVI) and surface kinetic temperature (TO). Lowtran 7 code is used to correct the atmosphere effect. The imageries were taken on 28 April and 5 May 2003. From the scattering plot of data set, we observed the extreme dry and wet pixels to derive the fitting of dry and wet controlled lines, respectively. Then the sensible heat and latent heat fluxes are derived from through a partitioning factor A. The retrieved latent and sensible heat fluxes are compared with in situ measurements, including eddy correlation and porometer measurements. It is shown that the retrieved fluxes from our scheme match with the measurements better than those derived from the S-SEBI model.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.321-327
• /
• 2004

SPIHT algorithm is a wavelet based fast and effective technique for image compression. It uses a list structure to store status information which is generated during set-partitioning of toro-tree. Usually, this requires lots of additional memory depending on how high the bit-rate is. Therefore, in this paper, we propose a new technique called MZC-BFS, which needs no additional memory when running SPIHT algorithm. It explicitly performs a breadth first search of the spatial-tree using peano-code and eliminates additional memory as it uses pre-status significant test for encoding and LSB bits of some coefficients for decoding respectively. This method yields nearly the same performance as SPIHT. This may be desirable in fast and simple hardware implementation and reduces the cost of production because no lists and additional memory are required.