• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.10
• /
• pp.941-950
• /
• 1991

channel is severely degraded by multipath delay time spread. In this paper. We propose a simple multipath delay time detection method, which has a merit of in serviceable, yet simple H/W realizability for $\pi/4$ shift QPSK by detecting cross channel interference. A $\pi/4$ shift QPSK signal originally has quadrature channel(Q-ch) component. Thus in order to measure CCI between in-phase channel(I-ch) and quadrature channel(Q-ch), which closely related to multipath delay time, Frequency doubling scheme(frequency doubler) and differential detector is proposed, which makes $\pi/4$ shift QPSK signal look like BPSK and also makes it possible for CCI to be detected at I-ch detector output. To get an information from time varying I-ch output signal under the multipath lading environment, a method for obtaining the mean of the absolute value$(V_{MABS}(t))$ and another one for obtaining the root mean square value$(V_{RMS}(t))$ of CCI are proposed. Furthermore, a relationship between delay spread and CCI is also analyzed. In order to confirm theoretical results, computer simulation has been carried out under the quasi-static and Reyleigh distributed two ray multipath fading environments. A fairly good result was obtained. However it was also shown that this method is sensitive to bandwidth restriction to some extent. In addition, some idea for a simple hardware realization for the frequency doubler are given.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12A
• /
• pp.1006-1014
• /
• 2011

Recently, as CSMA technique has been increasingly adopted in various wireless networks, extensive researches to analyze the statistical characteristics of CSMA-based wireless networks have been done. Despite the ongoing efforts, there still remain many difficulties in the analysis because of unexpectable operational behavior of CSMA. Previous literature studying CSMA networks used the concept of the carrier sensing radius to reflect the carrier sensing function. However, since the carrier sensing radius based on the protocol model is not affected by the aggregate interference from other nodes, the derived statistical models cannot avoid approximation errors especially if the network is under high interference. In this paper, we propose an algorithm to derive the carrier sensing radius considering the physical model, where the carrier sensing radius reflecting the aggregate interference is found. For the purpose of this, we analyze the aggregate interference model and the behavior of CSMA function. Based on the analysis, we propose an iterative approximation algorithm for the physical carrier sensing radius. Extensive simulations and results show that the proposed algorithm can contribute to considerably reduce the statistical modeling error of a CSMA network under various channel conditions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3A
• /
• pp.215-222
• /
• 2011

In this paper, we propose a power control scheme for effective serving cell selection in Relay environment of 3GPP (3rd Generation Partnership Project) LTE (Long Tenn Evolution)-Advanced system. A conventional serving cell selection scheme which does not use channel states of backhaul link has a problem that this scheme does not select serving cell supporting maximum throughput. Also, conventional proposed serving cell selection schemes that eNB or RN transmits channel states of backhaul link have problems that conventional schemes need to additional data transmission, serving cell selection process complexity is increased because UE considers channel states of backhaul link, and received signal is degraded because strong interference which is transmission signal from RN. Therefore, for solve these problems, we propose power control scheme that RN control transmission power according to received SINR (Signal to Interference plus Noise Ratio) of backhaul link. By extensive computer simulation, we verify that the power control Relay scheme is attractive and suitable for the Relay environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.9
• /
• pp.598-605
• /
• 2014

In this paper, we suggest a modified slotted ALOHA algorithm for fast tag collection in active RFID system and implement the reader and tag operation using CC2530 chip of Texas Instruments Co. to prove the performance of the proposed algorithm. In the present international standard related with active RFID including ISO/IEC 18000-7 the reader sends sleep command to each tag after successful obtaining tag's information. Meanwhile, in this paper, the tags decide to sleep after checking the second command from the reader resulting in enormously decreased tag collection time. We tested the proposed algorithm with 30 tags over the range of 0-3m and the results showed that the tag collection process was completed in 400msec at average. And 30 tags are collected in one second with 99.7% and the collection rate is 100% in 2m distance between reader and tag. The collection rates are 99.94% and 99.7% for distance 2.5m and 3m, respectively. The average collection rate is 99.91% over all range and it is concluded that the proposed algorithm is enough to apply to real fields.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.1
• /
• pp.597-604
• /
• 2016

The aim of this study was to prevent the decrease in crop output by disease and insect pests and excessive spraying of agricultural pesticides by application uniformity. A 3m height and 15km/h speed is difficult to maintain with an unmanned helicopter for aerial application, which has been affected by the controlling habits and methods or environmental factors, such as changes in the wind. Therefore, in this study, an aerial application system was design to be attached to an unmanned helicopter, which can allow a controlled application width and spray rate automatically and verified experimentally using Rmax of MS-AVIATION. The size of agricultural land was 50 m2 and nine water sensitive cards were arranged at 1.25m intervals in 5 rows with each row having a 10m interval from the position of 5m. The unmanned helicopter was flying at speeds ranging from 7.2km/h to 17.6km/h and heights ranging from 2.32m to 3.47m. The proposed aerial application system allowed application uniformity by making a valid spraying area of 7.5 m2 with 46423 particles distributed on average.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.10
• /
• pp.523-532
• /
• 2003

Video on Demand(VOD) services cause high resource consumption in a video seuer, because multimedia are characterized by continuous playback, a high bandwidth requirement, and long playback duration. Patching has been proposed to save the network I/O bandwidth of a video server. To achieve true VOD, patching uses multicasting to share video streams, thereby providing immediate VOD services to users without any service latency. A communication channel is used to either multicast the entire video as a regular channel or multicast only the leading portion of a video as a Patching channel. This paper Proposes a buffering patching technique that divides regular channels, as used in patching, into sub-regular channels and regular channels to shorten the holding time of the channels. In the proposed technique, the last portion of video data, corresponding to the size of the buffering window, is not transferred by sub-regular channels, but rather downloaded and buffered in the user buffer from the latest regular channel. When simulations were performed to compare the performance of the proposed technique with that of conventional patching, the results indicated that the proposed technique was superior in terms of the defection rate, average service latency, and fairness, although the amount of video data buffered at each user station was higher than that with patching.

• The KIPS Transactions:PartD
• /
• v.15D no.1
• /
• pp.1-14
• /
• 2008

This paper is on query processing in the mobile devices where memory capacity is limited. In case that a query against a large volume of XML data is processed in such a mobile device, techniques of fragmenting the XML data into chunks and of streaming and processing them are required. Such techniques make it possible to process queries without materializing the XML data in its entirety. The previous schemes such as XFrag[4], XFPro[5], XFLab[6] are not scalable with respect to the increase of the size of the XML data because they lack proper memory management capability. After some information on XML fragments necessary for query processing is stored, it is not deleted even after it becomes of no use. As such, when the XML fragments are dynamically generated and infinitely streamed, there could be no guarantee of normal completion of query processing. In this paper, we address scalability of query processing over dynamic XML fragment stream, proposing techniques of deleting information on XML fragments accumulated during query processing in order to extend the previous schemes. The performance experiments through implementation showed that our extended schemes considerably outperformed the previous ones in memory efficiency and scalability with respect to the size of the XML data.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.107-114
• /
• 2002

In these days, rapid advances of the computer system and the high speed network have made the multimedia services popularized among various applications and services in the internet. Internet live broadcasting, a part of multimedia services, makes it possible to provide not only existing broadcasting services including audio and video but also interactive communications which also expand application scopes by freeing from both temporal and spatial limitation. In the Paper, an interned Personal-live broadcasting server system is developed by allowing individual users to actively create or join live-broadcasting services with such basic multimedia devices as a PC camera and a sound card. As the number of broadcasters and participants increases, concurrent multiple channels are established and groups are to be expanded. The system should also guarantee High Availability (HA) for continuous services even in the presence of partial failure of the cluster. Furthermore, a transmission mode switching is supported to consider network environments in the user system.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.1
• /
• pp.35-41
• /
• 2020

Fast Fourier transform (FFT) processors have been widely used in various application such as communications, image, and biomedical signal processing. Especially, high-performance and low-power FFT processing is indispensable in OFDM-based communication systems. This paper presents a novel radix-26 FFT algorithm with low computational complexity and high hardware efficiency. Applying a 7-dimensional index mapping, the twiddle factor is decomposed and then radix-26 FFT algorithm is derived. The proposed algorithm has a simple twiddle factor sequence and a small number of complex multiplications, which can reduce the memory size for storing the twiddle factor. When the coefficient of twiddle factor is small, complex constant multipliers can be used efficiently instead of complex multipliers. Complex constant multipliers can be designed more efficiently using canonic signed digit (CSD) and common subexpression elimination (CSE) algorithm. An efficient complex constant multiplier design method for the twiddle factor multiplication used in the proposed radix-26 algorithm is proposed applying CSD and CSE algorithm. To evaluate performance of the previous and the proposed methods, 256-point single-path delay feedback (SDF) FFT is designed and synthesized into FPGA. The proposed algorithm uses about 10% less hardware than the previous algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.7
• /
• pp.1546-1553
• /
• 2015

In cognitive radio technology, the overall capacity of communications systems can be improved without allocating additional bands by allowing secondary system to utilize the band when a primary system who has right to use the band does not utilize it. Therefore, spectrum sensing to determine the existence of primary system is utmost important in the cognitive radio technology. In this work, we consider a novel cooperative spectrum sensing in cognitive cellular systems. Especially, we consider the case in which heterogeneous primary systems coexist, i.e., heterogenous transmission power and sensing requirement of primary system, such that only portion of users in cognitive cellular systems are able to detect the primary system. In this case, we propose new cooperative spectrum sensing with multiple sensing stages to properly detect the existence of primary systems in this kind of situations. Moreover, we analyze the performance of conventional cooperative spectrum sensing schemes such as OR-rule, AND-rule and MAJORITY-rule under the existence of heterogeneous primary systems. Finally, we investigate the performance of the proposed scheme through computer based simulations and show that the existence of primary systems can be determined accurately by using our proposed scheme.