• Journal of electromagnetic engineering and science
• /
• v.11 no.2
• /
• pp.133-142
• /
• 2011

Coded cooperation that integrates channel coding in cooperative transmission has gained a great deal of interest in wireless relay networks. The performance analysis of coded cooperation protocol with multiple relays is investigated in this paper. We show that the diversity order achieved by the coded cooperation in a multi-relay wireless network is not only dependent on the number of cooperating relays but is also dependent on the code-rate of the system. We derive the code-rate bound, which is required to achieve the full diversity gain of the order of cooperating nodes. The code-rate required to achieve full diversity is a linearly decreasing function of the number of available relays in the network. We show that the instantaneous channel state information (CSI)-based relay selection can effectively alleviate this code-rate bound. Analysis shows that the coded cooperation with instantaneous CSI-based relay selection can achieve the full diversity, for an arbitrary number of relays, with a fixed code-rate. Finally, we develop tight upper bounds for the bit error rate (BER) and frame error rate (FER) of the relay selection based on coded cooperation under a Rayleigh fading environment. The analytical upper bounds are verified with simulation results.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.1
• /
• pp.110-118
• /
• 2009

The PB/MC-CDMA(Partial Block Multi Carrier Code Division Multilple Access) system can improve the performance by reducing the ICI(Inter-Code Interference) between users. Also, this system can achieve the frequency diversity gain by avoiding ISI(Inter Symbol Interference). Therefore, the performance of PB/MC-CDMA system is better than that of conventional MC-CDMA(Multi Carrier Code Division Multiple Access) system. However, similarly to other multi-carrier systems, it still has a PAPR(Peak to Average Power Ratio) issue. In this paper, we propose a peak power reduction technique involving optimized spreading code selection without side information for the PB/MC-CDMA. The PB/MC-CDMA system in each block of units reuses the code so the extra code will be remained. This extra code is divided into several groups to calculate the PAPR and solving the PAPR problem by transferring the selected code which has minimum peak power.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.7
• /
• pp.165-168
• /
• 2015

In this paper, we analyze a SFBC-OFDM(Space Frequency Block Code-Orthogonal Frequency Division Multiplexing) system with antenna selection method using pilot symbols. An antenna selection criterion is based on channel coefficients estimated from pilot symbols. At each frequency, the channel coefficients is arranged and the best is selected, and then data is sent to those antenna with the best coefficients. Also, The coding and diversity gain of the proposed system are analyzed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.1
• /
• pp.41-53
• /
• 1988

Line drawing images are the most proper information to represent the characteristics and shapes of digital images and used for recognition and communication. For the coding of line drawing images, common eight-direction chain code is used mostly. In the paper, the new mode selection chain code method is proposed which can compress the eight-direction chain code about twenty percents and be used for the reversible coding method of line drawing images. In this coding techniques, we set a reference mode for each quadrant around an abject pixel, and assign 3-directional code for these reference modes. Therefore a line pixel is coded with 3 bits. Also, a new corner finding method of line drawing images using this mode selection chain code is proposed in this paper.

• Journal of KIISE:Software and Applications
• /
• v.32 no.3
• /
• pp.227-235
• /
• 2005

In the embedded system domain, both memory requirement and energy consumption are great concerns. To save memory and energy, the 32 bit ARM processor supports the 16 bit Thumb instruction set. For a given program, the Thumb code is typically smaller than the ARM code. However, the limitations of the Thumb instruction set can often lead to generation of poorer quality code. To generate codes with smaller size but a little slower execution speed, Krishnaswarmy suggests a profiling guided selection algorithm at module level for generating mixed ARM and Thumb codes for application programs. The resulting codes of the algorithm give significant code size reductions with a little loss in performance. When the instruction set is selected at module level, some functions, which should be compiled in Thumb mode to reduce code size, are compiled to ARM code. It means we have additional code size reduction chance. In this paper, we propose a profile guided selection algorithm at function level for generating mixed ARM and Thumb codes for application programs so that the resulting codes give additional code size reductions without loss in performance compared to the module level algorithm. We can reduce 2.7％ code size additionally with no performance penalty

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.307-312
• /
• 2005

In this work, we study the performance of a serial concatenated scheme comprising a convolutional code (CC) and an orthogonal space-time block code (STBC) separated by an inter-leaver. Specifically, we derive performance bounds for this concatenated scheme, clearly quantify the impact of using a CC in conjunction with a STBC, and compare that to using a STBC code only. Furthermore, we examine the impact of performing antenna selection at the receiver on the diversity order and coding gain of the system. In performing antenna selection, we adopt a selection criterion that is based on maximizing the instantaneous signal-to­noise ratio (SNR) at the receiver. That is, we select a subset of the available receive antennas that maximizes the received SNR. Two channel models are considered in this study: Fast fading and quasi-static fading. For both cases, our analyses show that substantial coding gains can be achieved, which is confirmed through Monte-Carlo simulations. We demonstrate that the spatial diversity is maintained for all cases, whereas the coding gain deteriorates by no more than $10\;log_{10}$ (M / L) dB, all relative to the full complexity multiple-input multiple-output (MIMO) system.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.5 no.1
• /
• pp.39-45
• /
• 2010

As wireless sensor network are being deployed in a wide variety of application areas, the number of sensor nodes in a sensor filed becomes larger and larger. In the past, ISP (In-System Programming) method have been generally used for code update but the large number of sensor nodes requires a new code update method called network reprogramming. There are many challenging issues for network reprogramming since it can make an impact on the network lifetime. In this paper, a new sender selection scheme for network reprogramming protocol is proposed to decrease energy consumption for code update by minimizing overlapped area between sender nodes and reducing data contention. Simulation results show that the proposed scheme can reduce the amount of message traffic and the overall data transmission time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.3A
• /
• pp.391-398
• /
• 2000

In this paper, MRC(Maximum Ratio Combine) diversity, (23, 12) Golay code, (7, 5) Reed-Solomon code, and (3, 1) majority selection code are employed to improve the performance of DS/CDMA BRSK in Nakagami fading channel. and MRC diversity combined with other coding techniques is suggested, with which, the performance of DS/CDMA BRSK is compared and analyzed. Also, system required Eb/N0 to meet BER=10-5 for multi user data communication is obtained according to each techniques. From the results, when each techniques is employed to DS/CDMA BRSK system. coding employed system shows better performance than diversity employed system. Especially, Golay code shows better performance than oter codes. also MRC diversity is employed, the number of multiple access user to meet data communication requirement of BER=10-5 can accomodate up to 8 users. and when each code is employed, Golay code, majority selection code, and Reed-Solomon code shows the capacity of 14, 12, and 10 user respectively. But MRC diversity combined with coding techniques can reduce restriction of multiple access user. However, it is desirable these combined technique are employed according to service types and requirements provided.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.12 no.2
• /
• pp.1-10
• /
• 1975

This paper presents an adaptive data compression algorithm for video data. The coling complexity due to the high correlation in the given data sequence is alleviated by coding the difference data, sequence rather than the data sequence itself. The adaptation to the nonstationary statistics of the data is confined within a code set, which consists of two constant length cades and six modified Shannon.Fano codes. lt is assumed that the probability distributions of tile difference data sequence and of the data entropy are Laplacian and Gaussion, respectively. The adaptive coding performance is compared for two code selection criteria: entropy and $P_r$[difference value=0]=$P_0$. It is shown that data compression ratio 2 : 1 is achievable with the adaptive coding. The gain by the adaptive coding over the fixed coding is shown to be about 10% in compression ratio and 15% in code efficiency. In addition, $P_0$ is found to he not only a convenient criterion for code selection, but also such efficient a parameter as to perform almost like entropy.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2253-2261
• /
• 1999

ACK generates optimized code using the string pattern matching technique in pattern table generator and peephole optimizer. But string pattern matching method is not effective due to the many comparative actions in pattern selection. We designed and implemented the EM intermediate code optimizer using tree pattern matching algorithm composed of EM tree generator, optimization pattern table generator and tree pattern matcher. Tree pattern matching algorithm practices the pattern matching that centering around root node with refer to the pattern table, with traversing the EM tree by top-down method. As a result, compare to ACK string pattern matching methods, we found that the optimized code effected to pattern selection time, and contributed to improved the pattern selection time by about 10.8%.