• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.3
• /
• pp.1380-1386
• /
• 2011

The request of interrupt accompanies a context switching. If the interrupt is frequently requested, this overhead of context switching can reduce seriously the performance of embedded systems. In order to reduce processing overhead due to frequently requested communication interrupts at Asynchronous Serial Communication, this paper introduces the method of Expanded Asynchronous Serial Communication with the Interrupt Coalescence(IC) that accumulates a fixed number of interrupts and processes them in one time. we implement the existing Asynchronous Serial Communication that requests communication interrupts by one byte at an LN2440SBC embedded board with a uC/OS-II and compare interrupt processing time for the performance evaluation about proposed method. As a result, the communication interrupt processing time of proposed method appears in case of low speed(9,600 bps), the decline of an average 25.18% at transmission, the decline of an average 41.47% at reception. and in case of hight speed(115,200 bps), the decline of an average 16.67% at transmission, the decline of an average 25.61% at reception.

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

In this paper, the physical layer design of IMT-2000 system being developed by SK Telecom is introuduced. The outband signaling scheme and the two-pilot scheme are adopted for multimedia service and inter-cell asynchronous mode respectively. In addition, the synchronous transmission scheme is proposed to reduce the interference in the reverse link. The algorithm and simulation results of 'two-pilot scheme' for inter-cell asynchronous mode and 'reverse synchronous control' for synchronous transmission are presented.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.11
• /
• pp.2021-2026
• /
• 2007

In the parer, we design a non-coherent UWB system by adopting the architecture of a simplified asynchronous transmission and the edge-triggered pulse transmission, which makes e system performance independent of the share of the transmitted waveform, robust to multipath channels. The designed non-coherent UWB transceiver architecture has an advantage of the simple realization since any mixer, high-speed correlator, and high-sampling A/D converter are not necessary at the cost of performance degradation of about 3dB. Further, the designed non-coherent UWB transceiver is actually implemented with the wireless CANVAS prototype testbed in short range indoor application environments such as a lecture room. The implemented prototype testbed is proven to offer the data rate of 115kbps on the conditions of Peer-to-Peer(P-to-P) in the indoor channel within the range of about 10m.

• ETRI Journal
• /
• v.35 no.4
• /
• pp.710-713
• /
• 2013

We propose a new space-time block coding (STBC) for asynchronous cooperative systems in full-duplex mode. The orthogonal frequency division multiplexing (OFDM) transmission technique is used to combat the timing errors from the relay nodes. At the relay nodes, only one OFDM time slot is required to delay for a pair-wise symbol swap operation. The decoding complexity is lower for this new STBC than for the traditional quasi-orthogonal STBC. Simulation results show that the proposed scheme achieves excellent performances.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.3
• /
• pp.9-15
• /
• 2003

IEEE1394 standard supports both isochronous and asynchronous data transmission, thus enabling high-speed data exchange between PC and networked home electronic devices. This paper describes an implementation of Test Bed for Linux based IEEE1394 communication test. In this paper, An integrated Software was developed to test IEEE1394 communication environment. To develop the software, open source software(gscanbus,dvgrab, playdv, Xine, Kino) for the Linux environment was investigated and integrated. It was tested such as the communication among the devices, asynchronous date transmission, isochronous data transmission, and its result was successful. This integrated software has the potential to become efficient test tool for the futher development of networked home electronic devices and multimedia services.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12B
• /
• pp.838-846
• /
• 2005

In this paper, we consider the following two issues for implementing the synchronous Ethernet systems. First, a synchronous Ethernet system employs a fixed size superframe which is divided into a synchronous period and an asynchronous one. We note that the starting point of a superframe is not deterministic when an ordinary data frame's transmission is overlapped the superframe boundary. This overlap may be a fatal drawback for strict jitter bounded applications. Circumventing the problem, we propose a frame fragmentation scheme to provide a zero jitter, and compare its delay performance with the hold scheme which also provides the zero jitter. We next concern that IEEE 802.3x pause frames cannot be promptly transmitted in a synchronous period, and thus asynchronous traffics may be dramatically get dropped at the input buffer of a switch. To handle the problem, we propose an efficient flow control by allowing the transmission of the pause frame in a synchronous period, and investigate the blocking probability of the asynchronous traffics by the simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.2C
• /
• pp.105-111
• /
• 2011

In this paper, we propose a novel Alamouti space-time transmission scheme for orthogonal frequency division multiplexing (OFDM) based asynchronous cooperative communication systems with low relay complexity. The conventional scheme requires an additional operation likes time-reversal at the relay nodes besides the simple multiplications at the relay nodes, which result in increasing the complexity of relay nodes. Unlike the conventional scheme, exploiting the simple combination of the symbols at the source node and the simple multiplications at the relay nodes, the proposed scheme achieves the second order diversity gain by obtaining the Alamouti code structure at the destination node. Simulation results show that the proposed scheme achieves the second order diversity gain and has the same bit error rate performance as the conventional scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5C
• /
• pp.479-486
• /
• 2010

In this paper, we propose a novel low-complexity Alamouti coded orthogonal frequency division multiplexing (OFDM) scheme for asynchronous cooperative communications. Exploiting the combination of OFDM symbols at the source node and simple operations including sign change and complex product at the relay node, the proposed scheme can achieve cooperative diversity gain without use of time-reversion and shifting operations that the conventional scheme proposed by Li and Xia needs. In addition, by using the cyclic prefix (CP) removal and insertion operations at the relay node, the proposed scheme does not suffer from a considerable degradation of bit-error-rate (BER) performance even though perfect timing synchronization is not achieved at the relay node. From the simulation results, it is demonstrated that the BER performance of the proposed scheme is much superior to that of the conventional scheme in the presence of timing synchronization error at the relay node. It is also shown that the proposed scheme obtains two times higher diversity gain compared with the conventional scheme at the cost of half reduction in transmission efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.6
• /
• pp.1113-1132
• /
• 2011

In wireless sensor networks (WSNs), most energy saving asynchronous MAC protocols are custom tailored for unicast communications only. However, broadcast protocols are very commonly used in WSNs for a variety of functionalities, such as gathering network topology information, event monitoring and query processing. In this paper, we propose a novel low-power asynchronous broadcast MAC protocol called Alarm Broadcast (A-CAST). A-CAST employs the strobe preamble that specifies the residual waiting time for the following data transmission. Each receiver goes back to sleep upon hearing the strobe preamble for the residual time duration, to conserve energy and to wake up just before data transmission starts. We compute the energy consumption of A-CAST via rigorous mathematical analysis. The analytic results show that A-CAST outperforms B-CAST, a simple broadcast extension of the well-known B-MAC. We also implement A-CAST on sensor motes and evaluated its performance through real experiments. Our experimental results show that A-CAST reduces the energy consumption by up to 222% compared to the previously proposed protocols.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.3
• /
• pp.63-72
• /
• 2021

Mobile crowd-sensing (MCS) is a promising sensing paradigm that leverages mobile users with smart devices to perform large-scale sensing tasks in order to provide services to specific applications in various domains. However, MCS sensing tasks may not always be successfully completed or timely completed for various reasons, such as accidentally leaving the tasks incomplete by the users, asynchronous transmission, or connection errors. This results in missing sensing data at specific locations and times, which can degrade the performance of the applications and lead to serious casualties. Therefore, in this paper, we propose a missing data inference approach, called missing data approximation with probabilistic tensor factorization (MDI-PTF), to approximate the missing values as closely as possible to the actual values while taking asynchronous data transmission time and different sensing locations of the mobile users into account. The proposed method first normalizes the data to limit the range of the possible values. Next, a probabilistic model of tensor factorization is formulated, and finally, the data are approximated using the gradient descent method. The performance of the proposed algorithm is verified by conducting simulations under various situations using different datasets.