• Title/Summary/Keyword: paper-electronics

Search Result 31,433, Processing Time 0.05 seconds

A Single-Bit 2nd-Order CIFF Delta-Sigma Modulator for Precision Measurement of Battery Current (배터리 전류의 정밀 측정을 위한 단일 비트 2차 CIFF 구조 델타 시그마 모듈레이터)

  • Bae, Gi-Gyeong;Cheon, Ji-Min
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.13 no.3
    • /
    • pp.184-196
    • /
    • 2020
  • In this paper, a single-bit 2nd-order delta-sigma modulator with the architecture of cascaded-of-integrator feedforward (CIFF) is proposed for precision measurement of current flowing through a secondary cell battery in a battery management system (BMS). The proposed modulator implements two switched capacitor integrators and a single-bit comparator with peripheral circuits such as a non-overlapping clock generator and a bias circuit. The proposed structure is designed to be applied to low-side current sensing method with low common mode input voltage. Using the low-side current measurement method has the advantage of reducing the burden on the circuit design. In addition, the ±30mV input voltage is resolved by the ADC with 15-bit resolution, eliminating the need for an additional programmable gain amplifier (PGA). The proposed a single-bit 2nd-order delta-sigma modulator has been implemented in a 350-nm CMOS process. It achieves 95.46-dB signal-to-noise-and-distortion ratio (SNDR), 96.01-dB spurious-free dynamic range (SFDR), and 15.56-bit effective-number-of-bits (ENOB) with an oversampling ratio (OSR) of 400 for 5-kHz bandwidth. The area and power consumption of the delta-sigma modulator are 670×490 ㎛2 and 414 ㎼, respectively.

Visualization of Korean Speech Based on the Distance of Acoustic Features (음성특징의 거리에 기반한 한국어 발음의 시각화)

  • Pok, Gou-Chol
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.13 no.3
    • /
    • pp.197-205
    • /
    • 2020
  • Korean language has the characteristics that the pronunciation of phoneme units such as vowels and consonants are fixed and the pronunciation associated with a notation does not change, so that foreign learners can approach rather easily Korean language. However, when one pronounces words, phrases, or sentences, the pronunciation changes in a manner of a wide variation and complexity at the boundaries of syllables, and the association of notation and pronunciation does not hold any more. Consequently, it is very difficult for foreign learners to study Korean standard pronunciations. Despite these difficulties, it is believed that systematic analysis of pronunciation errors for Korean words is possible according to the advantageous observations that the relationship between Korean notations and pronunciations can be described as a set of firm rules without exceptions unlike other languages including English. In this paper, we propose a visualization framework which shows the differences between standard pronunciations and erratic ones as quantitative measures on the computer screen. Previous researches only show color representation and 3D graphics of speech properties, or an animated view of changing shapes of lips and mouth cavity. Moreover, the features used in the analysis are only point data such as the average of a speech range. In this study, we propose a method which can directly use the time-series data instead of using summary or distorted data. This was realized by using the deep learning-based technique which combines Self-organizing map, variational autoencoder model, and Markov model, and we achieved a superior performance enhancement compared to the method using the point-based data.

A Re-Routable Smart Shuttle Traveling Scheme for Smart Mobility (스마트 모빌리티를 위한 경로변경이 가능한 스마트 셔틀 운행기법 연구)

  • Chung, Sung-Wook;Kang, Yong-Su;Son, Yeong-Hun
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.13 no.3
    • /
    • pp.243-249
    • /
    • 2020
  • With the development of the 4th Industry Revolution and the progress of related technologies, people have been using various services in a more convenient way in their daily lives. Among these technologies, the smart mobility is a service that effectively transports people or packets from the origin to the final destination using a variety of methods/vehicles. With respect to the smart mobility technology, the shuttle service is operational at the final destination. The conventional shuttle operation only takes into account the shuttle operability and does not consider the shuttle-passenger efficiency at all by the one-way routing. Therefore, in this paper, we propose the smart shuttle algorithm that can change the routes to efficiently support boarding passengers. Our proposed scheme consists of 3 algorithms: the shuttle operating algorithm, the re-routable shuttle traveling algorithm, and the passenger-riding algorithm. All those 3 algorithms are effectively co-operated and collaborated for better performance. In-depth experiments were conducted to analyze and to show the superior performance, resulting in an average 23.6% reduction of destination-arrival time per passenger, average 10.37% reduction of shuttle-waiting time per passenger, and average 15.38% decrease of shuttle traveling time per hour. This proves that our smart shuttle traveling scheme reveals the whole remarkable performance, effectively using the re-routable characteristics.

A Study on the Telescopic Cascode Comparator in SET Situation (SET 상황에서 텔레스코픽 캐스코드 비교기에 관한 연구)

  • Jang, Jae-Seok;Chung, Jae-Pil;Park, Jung-Cheul
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.13 no.4
    • /
    • pp.277-282
    • /
    • 2020
  • This study was initiated to find a way to resolve electronic equipment as it could be affected by multiple environments. The effect of setting the exponential constant wave (iExp) in the telescopic cascade comparator to the SET (Single Event Transient) environment was tested. In this paper, the radio wave delay was measured at 0.46 ㎲ and the gain at 0.713 in the telescopic cascade comparator without setting the SET situation. FET T0 (M6) was measured to have a large spike at 11㎲ to 15㎲ in the telescopic cascade comparator entering the SET situation. FET T1 (M5) has shorted output signals from 10 ㎲ to 16 ㎲. FET T2 (M3) represented a shorted output signal, and FET T3 (M4) measured the output waveform in the form of a large spike waveform. The FET T4 (M1) and FET T5 (M2) are spiky signals. And at all FETs, the propagation delay was changed from 0.45㎲ to 0.54㎲. In summary, The FET element in the telescopic cascade comparator in SET situation was measured to be greatly affected.

A Distributed Real-Time Concurrency Control Scheme using Transaction the Rise of Priority (트랜잭션 우선 순위 상승을 이용한 분산 실시간 병행수행제어 기법)

  • Lee, Jong-Sul;Shin, Jae-Ryong;Cho, Ki-Hyung;Yoo, Jae-Soo
    • Journal of KIISE:Databases
    • /
    • v.28 no.3
    • /
    • pp.484-493
    • /
    • 2001
  • As real-time database systems are extended to the distributed computing environment, the need to apply the existing real-time concurrency control schemes to the distributed computing environment has been made. In this paper we propose an efficient concurrency control scheme for distributed real-time database system. Our proposed scheme guarantees a transaction to commit at its maximum, reduces the restart of a transaction that is on the prepared commit phase, and minimizes the time of the lock holding. This is because it raises the priority of the transaction that is on the prepared commit phase in the distributed real-time computing environment. In addition, it reduces the waiting time of a transaction that owns borrowed data and improves the performance of the system, as a result of lending the data that the transaction with the raised priority holds. We compare the proposed scheme with DO2PL_PA(Distributed Optimistic Two-Phase Locking) and MIRROR(Managing Isolation in Replicated Real-time Object Repositories) protocol in terms of the arrival rate of transactions, the size of transactions, the write probability of transactions, and the replication degree of data in a firm-deadline real-time database system based on two-phase commit protocol. It is shown through the performance evaluation that our scheme outperforms the existing schemes.

  • PDF

Implementation of a Network Simulator for Cyber Attacks and Detections based on SSFNet (SSFNet 기반 사이버 공격 및 탐지를 위한 네트워크 시뮬레이터의 구현)

  • Shim, Jae-Hong;Jung, Hong-Ki;Lee, Cheol-Won;Choi, Kyung-Hee;Park, Seung-Kyu;Jung, Gi-Hyun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.8 no.4
    • /
    • pp.457-467
    • /
    • 2002
  • In order to simulate cyber attacks and predict network behavior by attacks, we should represent attributes of network components in the simulation model, and should express characteristics of systems that carry out various cyber attacks and defend from these attacks. To simulate how network load may change under the cyber attacks, we extended SSF[9, 10] that is process-based event-oriented simulation system. We added a firewall class and a packet manipulator into the SSFNet that is a component of SSF. The firewall class, which is related to the security, is to simulate cyber attacks, and the packet manipulator is a set of functions to write attack programs for the simulation. The extended SSFNet enables to simulate a network with the security systems and provides advantages that make easy to port already exsiting attack programs and apply them to the simulation evironment. We made a vitual network model to verify operations of the added classes, and simulated a smurf attack that is a representative denial of sevive attack, and observed the network behavior under the smurf attack. The results showed that the firewall class and packet manipulator developed in this paper worked normaly.

A Predictive Algorithm using 2-way Collaborative Filtering for Recommender Systems (추천 시스템을 위한 2-way 협동적 필터링 방법을 이용한 예측 알고리즘)

  • Park, Ji-Sun;Kim, Taek-Hun;Ryu, Young-Suk;Yang, Sung-Bong
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.9
    • /
    • pp.669-675
    • /
    • 2002
  • In recent years most of personalized recommender systems in electronic commerce utilize collaborative filtering algorithm in order to recommend more appropriate items. User-based collaborative filtering is based on the ratings of other users who have similar preferences to a user in order to predict the rating of an item that the user hasn't seen yet. This nay decrease the accuracy of prediction because the similarity between two users is computed with respect to the two users and only when an item has been rated by the users. In item-based collaborative filtering, the preference of an item is predicted based on the similarity between the item and each of other items that have rated by users. This method, however, uses the ratings of users who are not the neighbors of a user for computing the similarity between a pair of items. Hence item-based collaborative filtering may degrade the accuracy of a recommender system. In this paper, we present a new approach that a user's neighborhood is used when we compute the similarity between the items in traditional item-based collaborative filtering in order to compensate the weak points of the current item-based collaborative filtering and to improve the prediction accuracy. We empirically evaluate the accuracy of our approach to compare with several different collaborative filtering approaches using the EachMovie collaborative filtering data set. The experimental results show that our approach provides better quality in prediction and recommendation list than other collaborative filtering approaches.

Identification of Voice for Listeners who Feel Favor Using Voice Analysis (음성 분석을 이용한 청자가 호감을 느끼는 목소리에 대한 규명)

  • Choi, Ji Hyun;Cho, Dong Uk;Jeong, Yeon Man
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.1
    • /
    • pp.122-131
    • /
    • 2016
  • In the smart societies, such as the current unlike in the past, the voice that listeners will feel favor is changing through the development of ICT technologies and infrastructure. In other words, in the past, loud, intensive and fast voice is a favorite but now a new social and cultural situation that is changing them with ICT technologies. Now, this becomes one of the important things that we clarify 'Is it a voice that feels a favor?'. For this, in this paper, we identified what voice that listeners feel favor by applying ICT technologies. Studies were carried out to proceed largely divided into two categories. Firstly, as the quantified data, we extracted the impact on favorable feeling of listeners which related with emotional speech by empirical analysis work. To do this, we performed the experiment for the public. Secondly, we identified what kind of voice which listeners feel a good impression. For this, we identified voice characteristics that there are people who are influential in the real society. Also, we extracted both the voice characteristics of each influential people and common voice characteristics. In addition, we want to overcome the problems of qualitative methods that have originally limitations in objective respects which is significant to the voice analysis. For this, we performed the experiments of the voice analysis by numerical and visual approaches.

Enhanced Pulse Amplitude Estimation Method for Electronic Warfare Support (전자전 지원을 위한 향상된 펄스 세기 추정 기법)

  • Lee, Yu-Ri;Kim, Dong-Gyu;Kwak, Hyungyu;Kim, Hyoung-Nam
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.3
    • /
    • pp.649-660
    • /
    • 2017
  • In electronic warfare, the pulse amplitude, one of information of a pulse signal emitted by an enemy, is used for estimating distance from the source and for deinterleaving mixed source signals. An estimate of pulse amplitude is conventionally determined as the maximum magnitude of a Fourier transformed signal within its pulse width which is estimated pre-step in an electronic warfare receiver. However, when frequency modulated signals are received, it is difficult to estimate their pulse amplitudes with this conventional method because the energy of signals is dispersed in frequency domain. In order to overcome this limitation, this paper proposes an enhanced pulse amplitude estimation method which calculates the average power of the received pulse signal in time domain and removes the noise power of the receiver. Simulation results show that even in case the frequency modulated signal is received, the proposed method has the same performance as estimating the pulse amplitude when unmodulated signal is received. In addition, the proposed method is shown to be more robust to an estimation error of pulse width, which affects the estimation performance of pulse amplitude, than the conventional method.

Bone Segmentation Method based on Multi-Resolution using Iterative Segmentation and Registration in 3D Magnetic Resonance Image (3차원 무릎 자기공명영상 내에서 영역화와 정합 기법을 반복적으로 이용한 다중 해상도 기반의 뼈 영역화 기법)

  • Park, Sang-Hyun;Lee, Soo-Chan;Yun, Il-Dong;Lee, Sang-Uk
    • Journal of Broadcast Engineering
    • /
    • v.17 no.1
    • /
    • pp.73-80
    • /
    • 2012
  • Recently, medical equipments are developed and used for diagnosis or studies. In addition, demand of techniques which automatically deal with three dimensional medical images obtained from the medical equipments is growing. One of the techniques is automatic bone segmentation which is expected to enhance the diagnosis efficiency of osteoporosis, fracture, and other bone diseases. Although various researches have been proposed to solve it, they are unable to be used in practice since a size of the medical data is large and there are many low contrast boundaries with other tissues. In this paper, we present a fast and accurate automatic framework for bone segmentation based on multi-resolutions. On a low resolution step, a position of the bone is roughly detected using constrained branch and mincut which find the optimal template from the training set. Then, the segmentation and the registration are iteratively conducted on the multiple resolutions. To evaluate the performance of the proposed method, we make an experiment with femur and tibia from 50 test knee magnetic resonance images using 100 training set. The proposed method outperformed the constrained branch and mincut in aspect of segmentation accuracy and implementation time.