• Proceedings of the KOSOMBE Conference
• /
• v.1994 no.12
• /
• pp.113-116
• /
• 1994

Estimation of the evoked potential using the iterated bispectrum and cross-correlation (IBC) has been tried for both simulation and real clinical data. Conventional time average (TA) method suffers from synchronization error when the latency time of the evoked potential is random, which results in poor SNR distortion in the estimation of EP waveform. Instead of EP signal average in time domain, bispectrum is used which is insensitive to time delay. The EP signal is recovered by the inverse transform of the Fourier amplitude and phase obtained from the bispectrum. The distribution of the latency time is calculated using cross-correlation between EP signal estimated by the bispectrum and the acquired signal. For the simulation. EEG noise was added to the known EP signal and the EP signal was estimated by both the conventional technique and bispectrum technique. The proposed bispectrum technique estimates EP signal more accurately than the conventional technique with respect to the maximum amplitude of a signal, full width at half maximum(FWHM). signal-to-noise-ratio, and the position of maximum peak. When applied to the real visual evoked potential(VEP) signal. bispectrum technique was able to estimate EP signal more distinctively. The distribution of the latency time may play an important role in medical diagonosis.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.6
• /
• pp.322-329
• /
• 2000

BIST(Built-in Self Test) has been considered as the most promising DFT(design-for-test) scheme for the present and future test strategy. The most serious problem in applying BIST(Built-in Self Test) into a large circuit is the excessive increase in test time. This paper is focused on this problem. We proposed a new BIST construction scheme which uses a parallel divide-and-conquer method. The circuit division is performed with respect to some internal nodes called test points. The test points are selected by considering the nodal connectivity of the circuit rather than the testability of each node. The test patterns are generated by only one linear feedback shift register(LFSR) and they are shared by all the divided circuits. Thus, the test for each divided circuit is performed in parallel. Test responses are collected from the test point as well as the primary outputs. Even though the divide-and-conquer scheme is used and test patterns are generated in one LFSR, the proposed scheme does not lose its pseudo-exhaustive property. We proposed a selection procedure to find the test points and it was implemented with C/C++ language. Several example circuits were applied to this procedure and the results showed that test time was reduced upto 1/2151 but the increase in the hardware overhead or the delay increase was not much high. Because the proposed scheme showed a tendency that the increasing rates in hardware overhead and delay overhead were less than that in test time reduction as the size of circuit increases, it is expected to be used efficiently for large circuits as VLSI and ULSI.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.7
• /
• pp.989-998
• /
• 1993

In a bursty user traffic mode, ALOHA random multiple access protocol achieves higher performance than any conventional fixed assignment technique. One of central problems in slotted ALOHA is synchronization. Because of the long propagation delay in satellite mobile communication, packet may be spilt over into adjacent slots and thus guard time may be included between packet intervals. In conventional ALOHA channels, simultaneous transmission by two or more users results in a collision : the unsuccessful packets have to be retransmitted according to some retransmission algorithm. However, in a radio environment, users are often at different distances from the receiver : therefore, their received signals have substantially different power levels. The packet arriving with the highest energy now has a good chance of being detected accurately. Similarly, in some spread-spectrum random access systems, the earliest arriving packet dominates later arriving packets and thus captures the channel. In this paper slotted ALOHA channel with non zero guard time and capture probability is studied. Using the Markovian model, the performance of slotted ALOHA with guard time and capture effects is derived and compared with that of the conventional ALOHA via numerical analysis.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.133-144
• /
• 2015

In this paper, we introduce a system and a set of algorithms for disseminating popular content to a large group of wireless clients spread over a wide area. This area is partitioned into multiple cells and there is a base station in each cell which is able to broadcast to the clients within its radio coverage. Dissemination of information in the proposed system is hybrid in nature: Each base station broadcasts a fraction of information in the form of random linear combinations of data blocks. Then the clients cooperate by exchanging packets to obtain their desired messages while they are moving arbitrarily over the area. In this paper, fundamental trade-offs between the average information delivery completion time at the clients and different parameters of the system such as bandwidth usage by the base stations, average energy consumption by the clients and the popularity of the spread information are studied. Moreover different heuristic algorithms are proposed to control and maintain a balance over these trade-offs. Also, the more complicated case of multiple sessions where each client is interested in an arbitrary subset of sessions is considered and two variants of the basic dissemination algorithm are proposed. The performance of all the proposed algorithms is evaluated via extensive numerical experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.2
• /
• pp.97-104
• /
• 2013

This paper introduces waiting time based periodic packet discard policy for frame based scheduler. This policy can be used with conventional packet discard policy or buffer management schemes, such as drop-tail or random early detection. Proposed discard policy discards packets, which are stayed in the buffer longer than threshold, at every period of scheduling. This decision of discard is based on waiting time of packet. In this paper, mathematical analysis is performed with situation of network congestion. Also, the simulation is performed to evaluate the performance of proposed discard policy. In the result, proposed discard policy can limit queuing delay by threshold. Also, if the packet discard is performed before scheduling and threshold is set with smaller value than frame length, it can limit the throughput of traffic.

• Advanced Industrial SCIence
• /
• v.3 no.1
• /
• pp.30-36
• /
• 2024

Recently, the Internet of Things (IoT), which has been applied to various industrial fields, is constantly evolving in the process of automation and digitization. However, in the network where IoT devices are built, research on IoT critical information-related data sharing, personal information protection, and data integrity among intermediate nodes is still being actively studied. In this study, we propose a blockchain-based IoT critical information management technique that is easy to implement without burdening the intermediate node in the network environment where IoT is built. The proposed technique allocates a random value of a random size to the IoT critical information arriving at the intermediate node and manages it to become a decentralized P2P blockchain. In addition, the proposed technique makes it easier to manage IoT critical data by creating licenses such as time limit and device limitation according to the weight condition of IoT critical information. Performance evaluation and proposed techniques have improved delay time and processing time by 7.6% and 10.1% on average compared to existing techniques.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.3
• /
• pp.12-19
• /
• 2010

In road network, especially in urban area, inefficiency of travel time is caused by signal control and turn maneuver at intersection and this inefficiency has substantial effects on travel time. When searching for the shortest path, this inefficiency which is caused by turn maneuver must be considered. Therefore, travel time, vehicle volume and delay for each link were calculated by using simulation package, PARAMICS V5.2 for adaptation of turn penalty at 16 intersections of Gangnam-gu. Turn penalty was calculated respectively for each intersection. Within the same intersection, turn penalty differs by each approaching road and turn direction so the delay was calculated for each approaching road and turn direction. Shortest path dealing with 16 intersections searched by Dijkstra algorithm using travel time as cost, considering random turn penalty, and algorithm considering calculated turn penalty was compared and analyzed. The result shows that by considering turn penalty searching the shortest path can decrease the travel time can be decreased. Also, searching the shortest path which considers turn penalty can represent reality appropriately and the shortest path considering turn penalty can be utilized as an alternative.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.23-26
• /
• 2004

This paper analyzed time delay and phase distortion that generates in multipath and the degree of distortion due to power attenuation factor when UWB system is applied at indoor environment and the effects of indoor structure and material on distortion factors. Based on these distortion factors, channel model similar to actual environment is mathematically described and multipath and the degree of signal distortion generated when UWB system is applied to random environment is tested through channel model simulation and varies distortion factor that UWB system needs to consider in different indoor environment is analyzed.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.11a
• /
• pp.36-38
• /
• 2014

디지털 케이블 방송 시스템은 기존의 아날로그 케이블방송과 달리 하나의 6MHz 주파수 대역에 여러 방송채널들을 전송하고 있다. 즉, MPEG2 또는 H.264/AVC 등 비디오 압축 방식으로 인코딩된 여러 방송채널들과 각 채널의 대한 정보를 제공하기 위한 PSI 정보를 생성하여 멀티플렉싱하여 6MHz 주파수 대역으로 전송하는 방식으로 서비스를 제공한다. 하지만, 근본적으로 디지털 케이블 방송에서는 방송채널 변경 시 QAM Tuner의 주파수 Locking 및 디멀티플레싱, PSI 정보 파싱을 통한 채널 정보 획득, 비디오 및 오디오 디코딩을 위한 RAP(Random Access Point) 획득, 스크램블채널을 위한 ECM 획득 등의 시간 지연이 발생함에 따라 아날로그 케이블방송과 비교하여 상당한 채널 변경 지연이 발생한다. 이러한 이유로 디지털 케이블 방송 서비스의 품질 향상을 위해서는 채널 변경 시간 지연을 최소화하기 위한 연구가 필요하다. 따라서, 본 논문에서는 채널 변경 지연 요소들을 분석하고, 채널 변경 지연을 최소화하기 위한 기법을 제안한다.

• Journal of the Korean Institute of Navigation
• /
• v.25 no.4
• /
• pp.371-379
• /
• 2001

We have reported the new measurement system which was substituted digital filter for the analog filter in order to develop the optimal system that could find the time delay between each sensors with high accuracy. And also we have confirmed through the experiments that the accuracy of measurements were differentiated by the methods what kind of digital filter had been adopted. This paper suggests two algorithms which approximate the sound source's bearing and distance. One is that sound source's relative bearing can be approximately regarded as the gradient of hyperbolic asymptote, the other is that the source's range can be approximated under the condition of a long range source relative to the sensor's interval. And a series of experiments were carried out with the source's distance 22.42meters and the random bearing interval within the limits of $-90^{\circ}$~$+90^{\circ}$. As a result, we have recognized that the approximation methods could measure the bearing and distance with higher accuracy than the method using trigonometric relation could do.