• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.5
• /
• pp.55-62
• /
• 2019

In this paper, we consider K-user multiple-input multiple-output (MIMO) interference channel and present a transceiver design for simultaneous wireless information and power transfer (SWIPT) systems. In addition, we consider a SWIPT system where an information decoding receiver and an energy harvesting receiver are co-located at the same receiver. In the proposed scheme, signal-to-leakage plus noise ratio (SLNR) is used as a cost function and a transceiver is designed to satisfy the threshold of the harvested energy. More specifically, transmitter precoding vector, receiver filter vector, and power spitting factor are simultaneously designed to maximize SLNR with a constraint on the harvested energy. Through computer simulation, we compare the signal-to-interference plus noise ratio (SINR) performance of the proposed and conventional schemes. When a special condition among the number of transmit antennas, receive antennas, and users is satisfied, the proposed scheme showed better SINR performance than the conventional scheme at low signal-to-noise ratio (SNR) range. Also, when the condition is not satisfied, the proposed scheme showed better performance than the conventional scheme at all SNR range.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.12
• /
• pp.64-72
• /
• 2012

Synchronization including timing recovery, frequency offset compensation, and frame synchronization is most important signal processing block in all wireless/wired communication systems. In most communication systems, synchronization schemes based on training sequences or preambles are used. WLAN standards of 802.11a/g/n released by IEEE are based on OFDM systems. OFDM systems are known to be much more sensitive to frequency and timing synchronization errors than single carrier systems. A loss of orthogonality between the multiplexed subcarriers can result in severe performance degradations. The starting position of the frame and the beginning of the symbol and training symbol can be estimated using correlation methods. Correlation processing functionality is usually complex because of large number of multipliers in implementation especially when the reference signal is non-binary. In this paper, a simple correlation based synchronization scheme is proposed for IEEE 802.11a/g/n systems. Existing property of a periodicity in the training symbols are exploited. Simulation and implementation results show that the proposed method has much smaller complexity without any performance degradation than the existing schemes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.10 s.352
• /
• pp.46-54
• /
• 2006

In this paper, we propose a digital transceiver that can overcome the problems which current analog transceivers have. For the proposed transceiver, we assumed a frequency resource that consists of discrete and narrow channels. We also assumed that person-to-group, group-to-group, as well as person-to-person, voice and data communications with moderate security should be devisedand the data rate is 1 Mbps with simultaneous voice and data. Frequency hewing spread spectrum (FH-SS) and differential 8-PSK (D8PSK) were adopted for security reasons and bandwidth constraints, and for the reduction of implementation complexity, respectively. For the carrier and the symbol timing recovery, the structure of the preamble was proposed based on the IEEE 802.11 FHSS frame format to improve detection probability. The computer simulation results and power budget analysis implies that the proposed system can be usedin simple wireless communications in place of such as analog walkie-talkies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.6
• /
• pp.435-445
• /
• 2013

One of the most challenging issues in radio frequency identification (RFID) and near field communications (NFC) is to correctly and quickly recognize a number of tag IDs in the reader's field. Unlike the probabilistic anti-collision schemes, a query tree based protocol guarantees to identify all the tags, where the distribution of tag IDs is assumed to be uniform. However, in real implements, the prefix of tag ID is uniquely assigned by the EPCglobal and the remaining part is sequentially given by a company or manufacturer. In this paper, we propose an enhanced M-ary query tree protocol (EMQT), which effectively reduces unnecessary query-response cycles between similar tag IDs using m-bit arbitration and tag expectation. The theoretical analysis and simulation results show that the EMQT significantly outperforms other schemes in terms of identification time, identification efficiency and communications overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5C
• /
• pp.351-360
• /
• 2008

In cellular mobile radio systems with frequency reuse, the interference signals degrade the channel estimation and signal detection performance due to the low signal-to-interference ratio near coverage boundaries. When the preamble pilot sequences from different cells are orthogonal or located in disjointed positions, they can be used for multi-cell channel estimation and interference cancellation. In time-varying channels caused by Doppler spread, data pilot symbols are needed for channel estimations. However, data pilot symbols are usually located in identical positions for the overhead reduction, which degrades the channel estimation performance. In this paper, we demonstrate a significant amount of performance improvement is achieved by multiplying different pseudonoise(PN) sequences to the data pilot symbols from adjacent interference cells. In particular, for detection scheme using maximal ratio combining(MRC) and inter-cell spatial demultiplexing(ISD), quantitative performance gain of spectral efficiency for different values of Doppler frequency and interference power is presented.

• Journal of the Korea Concrete Institute
• /
• v.19 no.4
• /
• pp.467-474
• /
• 2007

In this paper, a total of 13 beams with bonding, anchorage system, amount of prestressing and span length as variables of experiment were tested in flexural test and analyzed in finite element analysis; one control beam, two simplified FRP-boned beams, four prestressed FRP-unbonded beams and four prestressed FRP-bonded beams. Also, a nonlinear finite element analysis of beams in the flexural test is performed by DIANA program considered material nonlinear of concrete, reinforcement and the interfacial bond-slip model between concrete and CFRP plates. The failure mode of prestressed CFRP plated-beams is not debonding but FRP rupture. RC members strengthened with external bonded prestressed CFRP plates occurred 1st and 2nd debonding of the composite material. After the debonding of CFRP plates occurs in bonded system, behavior of bonded CFRP-plated beams change into that of unbonded CFRP-plated beams due to fix of the anchorage system. Also, It was compared flexural test results and analytical results of RC members strengthened with CFRF plates. The ductility of beams strengthened by CFRP plates with the anchorage system is considered high with the ductility index of above 3. Analysis results showed a good agreement with experiment results in the debonding load, yield load and ultimate load.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.344-350
• /
• 2003

In this paper, we propose a novel sharing method ordering the events occurring between users collaborated with the common telecomputing environment. We realize the sharing method with multimedia data to improve the coworking effect using teleprocessing network. This sharing method advances the efficiency of communicating projects such as remote education, tele-conference, and co-authoring of multimedia contents by offering conveniences of presentation, group authoring, common management, and transient event productions of the users. As for the conventional sharing white board system, all the multimedia contents segments should be authored by the exclusive program, and we cannot use any existing contents or program. Moreover we suffer from the problem that ordering error occurs in the teleprocessing operation because we do not have any line-up technology for the input ordering of commands. Therefore we develop a method of retrieving input and output events from the windows system and the message hooking technology which transmits between programs in the operating system In addition, we realize the allocation technology of the processing results for all sharing users of the distributed computing environment without any error. Our sharing technology should contribute to improve the face-to-face coworking efficiency for multimedia contents authoring, common blackboard system in the area of remote educations, and presentation display in visual conference.

• Journal of Internet Computing and Services
• /
• v.14 no.5
• /
• pp.1-10
• /
• 2013

RFID(Radio Frequency Identification) system is non-contact identification technology. A basic RFID system consists of a reader, and a set of tags. RFID tags can be divided into active and passive tags. Active tags with power source allows their own operation execution and passive tags are small and low-cost. So passive tags are more suitable for distribution industry than active tags. A reader processes the information receiving from tags. RFID system achieves a fast identification of multiple tags using radio frequency. RFID systems has been applied into a variety of fields such as distribution, logistics, transportation, inventory management, access control, finance and etc. To encourage the introduction of RFID systems, several problems (price, size, power consumption, security) should be resolved. In this paper, we proposed an algorithm to significantly alleviate the collision problem caused by simultaneous responses of multiple tags. In the RFID systems, in anti-collision schemes, there are three methods: probabilistic, deterministic, and hybrid. In this paper, we introduce ALOHA-based protocol as a probabilistic method, and Tree-based protocol as a deterministic one. In Aloha-based protocols, time is divided into multiple slots. Tags randomly select their own IDs and transmit it. But Aloha-based protocol cannot guarantee that all tags are identified because they are probabilistic methods. In contrast, Tree-based protocols guarantee that a reader identifies all tags within the transmission range of the reader. In Tree-based protocols, a reader sends a query, and tags respond it with their own IDs. When a reader sends a query and two or more tags respond, a collision occurs. Then the reader makes and sends a new query. Frequent collisions make the identification performance degrade. Therefore, to identify tags quickly, it is necessary to reduce collisions efficiently. Each RFID tag has an ID of 96bit EPC(Electronic Product Code). The tags in a company or manufacturer have similar tag IDs with the same prefix. Unnecessary collisions occur while identifying multiple tags using Query Tree protocol. It results in growth of query-responses and idle time, which the identification time significantly increases. To solve this problem, Collision Tree protocol and M-ary Query Tree protocol have been proposed. However, in Collision Tree protocol and Query Tree protocol, only one bit is identified during one query-response. And, when similar tag IDs exist, M-ary Query Tree Protocol generates unnecessary query-responses. In this paper, we propose Adaptive M-ary Query Tree protocol that improves the identification performance using m-bit recognition, collision information of tag IDs, and prediction technique. We compare our proposed scheme with other Tree-based protocols under the same conditions. We show that our proposed scheme outperforms others in terms of identification time and identification efficiency.

• Journal of Intelligence and Information Systems
• /
• v.22 no.1
• /
• pp.159-185
• /
• 2016

Planning a multi-day trip is a complex, yet time-consuming task. It usually starts with selecting a list of points of interest (POIs) worth visiting and then arranging them into an itinerary, taking into consideration various constraints and preferences. When choosing POIs to visit, one might ask friends to suggest them, search for information on the Web, or seek advice from travel agents; however, those options have their limitations. First, the knowledge of friends is limited to the places they have visited. Second, the tourism information on the internet may be vast, but at the same time, might cause one to invest a lot of time reading and filtering the information. Lastly, travel agents might be biased towards providers of certain travel products when suggesting itineraries. In recent years, many researchers have tried to deal with the huge amount of tourism information available on the internet. They explored the wisdom of the crowd through overwhelming images shared by people on social media sites. Furthermore, trip planning problems are usually formulated as 'Tourist Trip Design Problems', and are solved using various search algorithms with heuristics. Various recommendation systems with various techniques have been set up to cope with the overwhelming tourism information available on the internet. Prediction models of recommendation systems are typically built using a large dataset. However, sometimes such a dataset is not always available. For other models, especially those that require input from people, human computation has emerged as a powerful and inexpensive approach. This study proposes CYTRIP (Crowdsource Your TRIP), a multi-day trip itinerary planning system that draws on the collective intelligence of contributors in recommending POIs. In order to enable the crowd to collaboratively recommend POIs to users, CYTRIP provides a shared workspace. In the shared workspace, the crowd can recommend as many POIs to as many requesters as they can, and they can also vote on the POIs recommended by other people when they find them interesting. In CYTRIP, anyone can make a contribution by recommending POIs to requesters based on requesters' specified preferences. CYTRIP takes input on the recommended POIs to build a multi-day trip itinerary taking into account the user's preferences, the various time constraints, and the locations. The input then becomes a multi-day trip planning problem that is formulated in Planning Domain Definition Language 3 (PDDL3). A sequence of actions formulated in a domain file is used to achieve the goals in the planning problem, which are the recommended POIs to be visited. The multi-day trip planning problem is a highly constrained problem. Sometimes, it is not feasible to visit all the recommended POIs with the limited resources available, such as the time the user can spend. In order to cope with an unachievable goal that can result in no solution for the other goals, CYTRIP selects a set of feasible POIs prior to the planning process. The planning problem is created for the selected POIs and fed into the planner. The solution returned by the planner is then parsed into a multi-day trip itinerary and displayed to the user on a map. The proposed system is implemented as a web-based application built using PHP on a CodeIgniter Web Framework. In order to evaluate the proposed system, an online experiment was conducted. From the online experiment, results show that with the help of the contributors, CYTRIP can plan and generate a multi-day trip itinerary that is tailored to the users' preferences and bound by their constraints, such as location or time constraints. The contributors also find that CYTRIP is a useful tool for collecting POIs from the crowd and planning a multi-day trip.

• Journal of the Korean Geotechnical Society
• /
• v.28 no.7
• /
• pp.5-16
• /
• 2012

Soil-nailing is the most popular method of reinforcing for slope stability. In general, two factors are considered as failure modes during the soil-nailing design stages: pullout failure mode and shear failure mode that will occur on the most probable failure plane. In many cases, however, shallow failure can also occur when the ground near the slope face is swept away by the horizontal stress release during the staged top-down excavation. In this paper, an optimized soil-nailing design methodology is proposed by considering the three failure modes mentioned above: pullout failure; shear failure; and shallow failure. The variables to be optimized include the bonded length and number of soil-nailings, and the confining pressure that should be applied at the slope face. The procedure to obtain the optimized design variables is as follows: at first, optimization of soil-nailings, i.e. bonded length and number, against pullout and shear failure modes; and then, optimization of confining pressure at each excavation stage that is needed to prevent shallow failure. Since the two processes are linked with each other, they are repeated until the optimized design variables can be obtained satisfying all the constrained design requirements in both of the two processes.