• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.9 no.4
• /
• pp.542-551
• /
• 1998

In this study, a method of error compensation for channel gain imbalance, phase imbalance and local oscillator leakage in the modulator of frequency direct conversion is suggested. The compensation of channel imbalance can be carried out by using the received power after transmitting test signal. By applying this method, the phase imbalance conversion with frequency can be easily compensated since this method is rarely affected by the transmission channel. It is confirmed that the algorithm proposed in this study(iteration coefficient=11) converges faster than conventional algorithm(iteration coefficient=43). From the numerical results, the DC-offset, channel gain, phase imbalance compensation coefficient and iteration number converges into($f_1$=0.0199999, $f_2$=-0.050001, $C_{22}$=0.9133, $C_{12}$=-0.0524, N=13) when the local oscillator leakage is not considered. However, it converges into($f_1$=-0.02, $f_2$=-2.2476, $C_{22}$=0.9133, $C_{12}$=-0.0524, N=16) when the local oscillator leakage is considered.

• The Journal of the Korea Contents Association
• /
• v.22 no.8
• /
• pp.81-93
• /
• 2022

Recently, research on processing a large-capacity graph using GPUs has been conducting. In order to process a large-capacity graph in a GPU with limited memory, the graph must be divided into subgraphs and then processed by scheduling subgraphs. In this paper, we propose an efficient graph algorithm processing scheme in GPU environments with limited memory and performance evaluation. The proposed scheme consists of a graph differential subgraph scheduling method and a graph segmentation method. The bulk graph segmentation method determines how a large-capacity graph can be segmented into subgraphs so that it can be processed efficiently by the GPU. The differential subgraph scheduling method schedule subgraphs processed by GPUs to reduce redundant transmission of the repeatedly used data between HOST-GPUs. It shows the superiority of the proposed scheme by performing various performance evaluations.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.3
• /
• pp.39-44
• /
• 2001

In frequency hopping spread spectrum(FHSS) communication systems, exact frequency synchronization is required due to the random hopping of carrier frequencies between transmitter and receiver even under harsh channel conditions. For synchronization of FHSS communications, multi-frequency hopping synchronization(MFHS) method has been used in which a small set of frequencies are repeatedly sent several times for long duration. But this long duration resulted in being easily detected by the unauthorized users as well as long duration of acquisition time. In this paper, motivated by these problems, an adaptive synchronization method(ASM) is proposed. ASM is technics to reduce the synchronization time where the number of synchronization frequencies and repetition numbers is adaptively changed (increased or decreased) according to the channel conditions. The performance analysis showed that the time duration of synchronization was reduced to 0.2sec, and the influence of jamming or interference was decreased to 46% in ASM.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.11
• /
• pp.25-32
• /
• 2007

In this paper, we propose the Group Separation Algorithm for RFID Tag Anti-Collision. We study the RFID Tag anti-collision technique of ALOHA and the anti-collision algorithm of binary search. The existing technique is several problems; the transmitted data rate included of data, the recognition time and energy efficiency. For distinction of all tags, the Group Separation algorithm identify each Tag_ID bit#s sum of bit #1#. In other words, Group Separation algorithm had standard of selection by collision table, the algorithm can reduce unnecessary number of search even than the exisiting algorithm. The Group Separation algorithm had performance test that criterions were reader#s number of repetition and number of transmitted bits for understanding tag. We showed the good performance of Group Separation algorithm better than exisiting algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.6
• /
• pp.101-108
• /
• 2013

In this paper, we propose a method in which the negative acknowledge (NACK) message is used as command for cooperation and spectrum sharing. This allows for an automatic request for cooperation and sharing when the direct link of the primary user is in outage, and also allows for saving the number of control messages in cooperation-spectrum sharing based paradigm. In the sharing phase, the selected relay shares a power fraction of $1-{\alpha}$ for secondary transmitted signal while the remaining of ${\alpha}$ is for primary retransmitted signal. In the case of no relay collected, primary transmitter uses NACK as a command to retransmit the signal with fully power fraction (${\alpha}=1$). Both systems are assumed to employ BPSK signals. In this scheme, we propose the joint optimal decoding in the secondary user. The frame error rate (FER) performance at both systems is then analyzed. The theoretical and simulation results validate the analysis and confirm the efficiency of the protocol.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.48-55
• /
• 2009

In this paper, We propose Adaptive Group Separation algorithm for efficient RFID system AGS algorithm determines the optimized initial prefix size j, and divides the group of. A reader requests the group and searches the tag ID. If a tag collision occurred, reader adds a one bit, '0' or '1' at first bit of collision point, As a result we observe that transmitted data bits and the recognition time are decreased. The proposed algorithms have been verified by computer simulation. The performance of the proposed anti-collision algorithm is evaluated in terms of the number of repetitions and the amount of transmission bits according to the in crease of the number of tags is 256. The AGS algorithm improve the number of repetitions by about 32.3% and reduce tile amount of the transmission bits by about 1/40 than slotted binary tree algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.103-108
• /
• 2016

In communication systems the solution of the problem of maximizing the mutual information between the input and output of a channel composed of several subchannels under total power constraint has a waterfilling structure. OFDM and MIMO can be decomposed into parallel subchannels with CSI. Waterfilling solves the problem of optimal power allocation to these subchannels to achieve the rate approaching the channel capacity under total power constraint. In waterfilling, more power is alloted to good channels(high SNR) and less or no power to bad channels to increase the rate of good channels, resulting in channel capacity. Waterfilling finds the exact water level satisfying the power constraint employing an iterative algorithm to estimate and update the water level. In this process computation of partial sums of inverse of square of subchannel gain is repeatedly required. In this paper we reduced the computation time of waterfilling algorithm by replacing the partial sum computation with reference to an array which contains the precomputed partial sums in initialization phase.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9A
• /
• pp.835-843
• /
• 2010

Energy spreading transform (EST) based equalization is a very effective technique to remove inter symbol interference (ISI) in frequency selective channel. EST based system uses cyclic prefix (CP) similar to orthogonal frequency division multiplexing (OFDM) system. Since CP is a redundancy, it degrades the data transmission rate. RISIC is an algorithm that removes an inter block interference (IBI) caused by insufficient CP length and reconstructs CP. In this paper, we propose a system that combines the existing EST system with quadrature phase shift keying (QPSK) modulation and RISIC algorithm to enhance the efficiency of the transmission. Also we extend the proposed system to 16 quadrature amplitude modulation (QAM) modulation. The proposed system is shown to performance close to matched filter bound (MFB) even with insufficient CP.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.2
• /
• pp.6-14
• /
• 2007

In this paper, we propose and observe the Adaptive Modulation system with optimal Turbo Coded V-BLAST (Vertical-Bell-lab Layered Space-Time) technique that is applied the extrinsic information from MAP (Maximum A Posteriori) Decoder in decoding Algorithm of V-BLAST: ordering and slicing. The extrinsic information is used by a priori probability and the system decoding process is composed of the Main Iteration and the Sub Iteration. And comparing the proposed system with the Adaptive Modulation system using conventional Turbo Coded V-BLAST technique that is simply combined V-BLAST with Turbo Coding scheme, we observe how much throughput performance has been improved. In addition, we observe the proposed system using STD (Selection Transmit Diversity) scheme. As a result of simulation, Comparing with the conventional Turbo Coded V-BLAST technique with the Adaptive Modulation systems, the optimal Turbo Coded V-BLAST technique with the Adaptive Modulation systems has better throughput gain that is about 350 Kbps in 11 dB SNR range. Especially, comparing with the conventional Turbo Coded V-BLAST technique using 2 transmit and 2 receive antennas, the proposed system with STD (Selection Transmit Diversity) scheme show that the improvement of maximum throughput is about 1.77 Mbps in the same SNR range.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1241-1248
• /
• 1998

The multicast scheme can improve the efficiency of multimedia retrieval service system, assuming that video transmission speed is faster than the playback rate and the store-and-play scheme. To best exploit the multicast benefits under bandwidth heterogeneous environment, we develop a multicast scheduling algorithm called MTS(Maximum Throughput Scheduling) which tries to maximize the amount of information transferred at each scheduling with subgrouping method. The MTS method compromises the multiple unicast method and the multicast method with lowest transmission rate. we compare the performance of MTS with that of MMS(Most Multicasting Scheduling) and EDS(Earliest Deadine Scheduling) via computer simulation. The performance results show that the MTS requires less number of service handlers to service the same number of subscribers.