• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.1063-1066
• /
• 1999

The delay of cardiac depolarization wave detection in the conventional pacemakers or AICD (automatic implantable cardioverter/ defibrillator, or ICD) has been overlooked. However, it is known that the delay may cause hemodynamic problems and may prevent the proper operation of a new automatic feature, automatic capture verification, that is to be appeared in the near-future devices. In order to reduce the effects of the delay, a delay prevention algorithm was developed and tested by applying three human electrograms. The algorithm set the sensing threshold just above the measured noise level to reduce the detection delay. It is found that the low threshold was able to reduce the delay by 20msec(average) In most cases. The implementation results showed reliability and efficacy of the algorithm, and the algorithm could be applicable to the existing hardware and software of the conventional pacemakers and AICD without any significant modifications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3329-3350
• /
• 2017

Installing caching and computing facilities in mobile edge networks is a promising solution to cope with the challenging capacity and delay requirements imposed on future mobile communication systems. The problem of optimal facility placement in mobile edge networks has not been fully studied in the literature. This is a non-trivial problem because the mobile edge network has a unidirectional topology, making existing solutions inapplicable. This paper considers the problem of optimal placement of a fixed number of facilities in a mobile edge network with an arbitrary tree topology and an arbitrary demand distribution. A low-complexity sequential algorithm is proposed and proved to be convergent and optimal in some cases. The complexity of the algorithm is shown to be $O(H^2{\gamma})$, where H is the height of the tree and ${\gamma}$ is the number of facilities. Simulation results confirm that the proposed algorithm is effective in producing near-optimal solutions.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.2
• /
• pp.299-306
• /
• 2011

In this paper, a blind adaptive equalization algorithm based on PDF-distance minimization and a set of Delta functions is introduced and its superior robustness against impulsive noise and multipath characteristics of underwater communication channels is proved. The conventional CMA based on MSE has shown to be incapable of coping with impulsive noise, and correntropy blind algorithm has also revealed to yield not satisfying performance for the mission. On the other hand, the blind adaptive equalization algorithm based on PDF-distance minimization and a set of Delta functions has been proved to solve effectively the problem of impulsive noise and multipath characteristics of underwater communication channels through theoretical and simulation analysis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2356-2376
• /
• 2021

In this paper, we proposed a novel modulation recognition method based on quantum elephant herding algorithm (QEHA) evolving neural network under impulse noise environment. We use the adaptive weight myriad filter to preprocess the received digital modulation signals which passing through the impulsive noise channel, and then the instantaneous characteristics and high order cumulant features of digital modulation signals are extracted as classification feature set, finally, the BP neural network (BPNN) model as a classifier for automatic digital modulation recognition. Besides, based on the elephant herding optimization (EHO) algorithm and quantum computing mechanism, we design a quantum elephant herding algorithm (QEHA) to optimize the initial thresholds and weights of the BPNN, which solves the problem that traditional BPNN is easy into local minimum values and poor robustness. The experimental results prove that the adaptive weight myriad filter we used can remove the impulsive noise effectively, and the proposed QEHA-BPNN classifier has better recognition performance than other conventional pattern recognition classifiers. Compared with other global optimization algorithms, the QEHA designed in this paper has a faster convergence speed and higher convergence accuracy. Furthermore, the effect of symbol shape has been considered, which can satisfy the need for engineering.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.8 no.1
• /
• pp.45-50
• /
• 2015

In this paper, we confirm the effective adaptive algorithm for tha active noise contorl (ANC) though the performance comparison between adaptive algorithms. Generally, the normalized least mean square (NLMS) algorithm has been widely used for an adaptive algorithm thanks to its simplicity and having a fast convergence speed. However, the convergence performance of the NLMS algorithms is often deteriorated by colored input signals. To overcome this problem, the affine pojection (AP) algorithm that updates the weight vector based on a number of recent input vectors can be used for allowing a higher convergence speed than the NLMS algorithm, but it is computationally complex. Thus, the proper algorithm were determined by the comparison between NLMS and AP algorithms regarding as the convergence performance and complexity. Simulation results confirmed that the noise reduction performance of NLMS algorithm was comparable to AP algorithm with low complexity. Therefore the NLMS algorithm is more effective for ANC system.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.79-80
• /
• 2006

In this paper, we compare two different anti-jamming schemes, Subspace projection and SCORE algorithm. For multipath cancelation, nulling technique is applied to both anti-jamming schemes. It is noted that SCORE algorithm is more robust to the multipath interference. It is also noted that Subspace projection scheme requires nulling technique for multipath mitigation.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.221-221
• /
• 2004

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11B
• /
• pp.1329-1338
• /
• 2011

This paper proposes an algorithm and hardware architecture for a broadcast communication which has the worst bottleneck among multiprocessor using distributed memory architectures. In conventional systems, collective communication is converted into point-to-point communications by MPI library cell without considering the state of communication port of each processing node which represents the processing node is in busy state or free state. If conflicting point-to-point communication occurs during broadcast communication, the transmitting speed for broadcast communication is decreased. Thus, this paper proposed an algorithm which determines the order of point-to-point communications for broadcast communication according to the state of each processing node. According to the state of each processing node, the proposed algorithm decreases total broadcast communication time by transmitting message preferentially to the processing node with communication port in free state. The proposed MPI unit for broadcast communication is evaluated by modeling it with systemC. In addition, it achieved a highly improved performance for broadcast communication up to 78% with 16 nodes. This result shows the proposed algorithm is useful to improving total performance of MPSoC.

• International Journal of Contents
• /
• v.3 no.2
• /
• pp.40-43
• /
• 2007

This paper proposed a new modular inverse algorithm based on the right-shifting binary Euclidean algorithm. For an n-bit numbers, the number of operations for the proposed algorithm is reduced about 61.3% less than the classical binary extended Euclidean algorithm. The proposed algorithm implementation shows substantial reduction in computation time over Galois field GF(p).

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.12
• /
• pp.1580-1588
• /
• 1999

This paper evaluates the real-time performance of the Train Communication Network (TCN) that consists of WTB and MVB. A run-time scheduling algorithm for the hard-real time communication was proposed and its performance was evaluated. Also, a new addressing method and the adaptive tree algorithm were suggested to enhance performance. The overall performance was evaluated by computer simulation using Arena.