• Title/Summary/Keyword: 랜덤 효과

Search Result 275, Processing Time 0.032 seconds

Blind Block Deinterleaving using Convolutional Code Reconstruction Method (길쌈 부호 복원 기법을 이용한 블라인드 블록 디인터리빙)

  • Jeong, Jin-Woo;Yoon, Dong-Weon;Park, Cheol-Sun;Yun, Sang-Bom;Lee, Sang-Hyeon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.9
    • /
    • pp.10-16
    • /
    • 2011
  • Interleaving is applied to prevent from exceeding the error-correction capability of channel code. At the receiver, burst errors are converted into random errors after deinterleaving, so the error-correction capability of channel code is not exceeded. However, when a receiver does not have any information on parameters used at an interleaver, interleaving can be seen as an encryption with some pattern. In this case, deinterleaving becomes complicated. In the field of blind deinterleaving, there have recently been a number of researches using linearity of linear block code. In spite of those researches, since the linearity is not applicable to a convolutional code, it is difficult to estimate parameters as in a linear block code. In this paper, we propose a method of blind block deinterleaving using convolutional code reconstruction method.

Study on Compressed Sensing of ECG/EMG/EEG Signals for Low Power Wireless Biopotential Signal Monitoring (저전력 무선 생체신호 모니터링을 위한 심전도/근전도/뇌전도의 압축센싱 연구)

  • Lee, Ukjun;Shin, Hyunchol
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.3
    • /
    • pp.89-95
    • /
    • 2015
  • Compresses sensing (CS) technique is beneficial for reducing power consumption of biopotential acquisition circuits in wireless healthcare system. This paper investigates the maximum possible compress ratio for various biopotential signal when the CS technique is applied. By using the CS technique, we perform the compression and reconstruction of typical electrocardiogram(ECG), electromyogram(EMG), electroencephalogram(EEG) signals. By comparing the original signal and reconstructed signal, we determines the validity of the CS-based signal compression. Raw-biopotential signal is compressed by using a psuedo-random matrix, and the compressed signal is reconstructed by using the Block Sparse Bayesian Learning(BSBL) algorithm. EMG signal, which is the most sparse biopotential signal, the maximum compress ratio is found to be 10, and the ECG'sl maximum compress ratio is found to be 5. EEG signal, which is the least sparse bioptential signal, the maximum compress ratio is found to be 4. The results of this work is useful and instrumental for the design of wireless biopotential signal monitoring circuits.

Compensation for Distorted WDM Signals Through Dispersion Managed Optical Transmission Links with Ununiform Distribution of SMF Length and RDPS of Optical Fiber Spans (중계 구간의 SMF 길이와 RDPS 분포가 일정하지 않은 분산 제어 광전송 링크를 통한 왜곡된 WDM 신호의 보상)

  • Lee, Seong-Real
    • Journal of Advanced Navigation Technology
    • /
    • v.16 no.5
    • /
    • pp.801-809
    • /
    • 2012
  • Dispersion management (DM) is the typical technique compensating for the distorted signals due to interaction of group velocity dispersion (GVD) and optical nonlinear effects for transmitting wavelength division multiplexed (WDM) channel with the excellent performance. Optimal net residual dispersion (NRD) and effective launching power range of optical transmission links with random distribution and artificial distribution of single mode fiber (SMF) length and residual dispersion per span (RDPS) required to flexibly design of optical links in DM. It is confirmed that optimal net residual dispersion (NRD) are +10 ps/nm and -10 ps/nm controlled by precompensation and postcompensation, respectively, in both of the considered distribution patterns of SMF length and RDPS. And, in optimal NRD, system performance in optical links with the descending distribution of SMF length and the ascending distribution of RDPS among the artificial distribution patterns are more improved, consequently, effective launching power range is expanded by almost 2 dB than those in optical links with the uniform distribution.

Random Backoff Scheme of Emergency Warning Message for Vehicle-to-Vehicle Communications (차량 간 통신에서 충돌을 완화하기 위한 랜덤 백오프 방안)

  • Byun, Jae-Uk;Kwon, Sung-Oh
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.3B
    • /
    • pp.165-173
    • /
    • 2012
  • In this paper, we propose a random backoff scheme for Emergency Warning Messages (EWMs) in the vehicle-to-vehicle environment. The EWMs are disseminated from a vehicle that detects an emergency situation to other vehicles in a multi-hop fashion. Since the vehicle-to-vehicle communication based on IEEE 802.11 adapts CSMA/CA, the density of vehicles increase the probability of collisions between transmissions. Moreover, in the presence of background traffic, the EWM should have a higher priority than that of other messages in neighboring vehicles. To that end, we propose the Distant-Dependent Adaptive Backoff (DDAB) scheme, which set a different contention window for random backoff depending on the distance from the sender to the receiver. In the case when a vehicle is expected to located in the outskirts of the communication boundary, the proposed scheme makes the contention window size small in order to compete the background traffic transmission. Otherwise the contention window is set to a large number to reduce the collision possibility among the EWM transmissions. Via simulations, we show that the proposed scheme performs better than the previous schemes for EWM.

Node scheduling algorithm for energy efficiency and delay reduction in mobile sensor networks (모바일 센서 망에서 효율적인 에너지 사용과 전송지연 감소를 위한 노드 스케쥴링 알고리즘)

  • Son, Jae-Hyun;Byun, Hee-Jung
    • Journal of Internet Computing and Services
    • /
    • v.15 no.4
    • /
    • pp.111-118
    • /
    • 2014
  • In mobile sensor networks, a large number of sensor nodes with battery powered are deployed randomly in a region. They monitor the environmental states and transmit data to its neighboring nodes. For mobile sensor networks, It is needed to maintain the connectivity autonomously among nodes as the sensor node moves. However, the existing works have focused on the energy savings in the fixed sensor networks. A specific algorithm considering node mobility is required in the mobile sensor networks. Along with energy efficiency, the transmission delay should be considered. In this paper, we propose an autonomous configuration scheme and a node scheduling algorithm when a moving node joins into the existing network. Through simulations, we show a superior performance of the proposed algorithm to the existing protocol.

Polling Method based on Weight Table for Efficient Monitoring (효율적인 모니터링을 위한 가중치 테이블 기반의 폴링기법)

  • Mun, Hyung-Jin
    • Journal of Convergence Society for SMB
    • /
    • v.5 no.4
    • /
    • pp.5-10
    • /
    • 2015
  • With the advance of ICT, understanding the condition of network and analysing network monitoring have become an important issue. On the TCP/IP network, SNMP is the typical protocol that catches the condition of network by using polling method. If polling method is implemented for a long period, to catch the change of the condition of the network is not easy. On the other hand, in case of short-term polling, even if it could catch the condition of the network in real time, responsive messages to results of the polling cause the increase of traffic and therefore burden the network. There have been studies to control the overhead of responsive messages by controlling the polling period. However, not considering the characteristics of an agent, and running randomly, they cannot decrease the overhead although they would have an instant effect. This paper suggests an efficient polling method that decreases the traffic overhead of polling and catches the condition of the network in real time. Proposed method an polling for a short period and gave weight based on the characteristics of agents to catch the network condition, and a manager decided polling differentially based on the weight so that it decreased the overhead of polling traffic.

  • PDF

Miscibility and Properties of Ethyl-Branched Polyethylene/Ethylene-Propylene Rubber Blends( I ) (에틸 가지화된 폴리에틸렌과 에틸렌-프로필렌 고무 블렌드의 혼화성와 물성( I ))

  • Cho, Ur-Ryong
    • Elastomers and Composites
    • /
    • v.36 no.3
    • /
    • pp.169-176
    • /
    • 2001
  • Ethyl-branched polyethylene[PE(2)] containing 2mole% ethyl branch and three ethylene-propylene rubbers(EPR's) haying the same ethylene(E)-propylene(P) molar ratio(E/P=50/50) with different stereoregularity, that is, random EPR(r-EPR), alternating-EPR(alt-FPR) and isotactic-alternating-EPR(iso-alt-EPR) were mixed for the investigation of their properties depending on the stereoregurarity. The three blends were immiscible at room temperature, and showed the simple additivity effect in density behavior. The melting point depression with blend composition increased in order of PE(2)/r-EPR>PE(2)/alt-EPR>PE(2)/iso-alt-EPR. In the tensile test, this blend systems have the lowest value or the breaking strength at FE(2) fraction of 0.5. This phenomenon results from the greastest separated phase morphology at this blend composition.

  • PDF

Performance evaluation of fully-interconnected ATM switch (part II: for bursty traffic andnonuniform distribution) (완전 결합형 ATM 스위치의 성능분석 (II부 : 버스티 트래픽 및 비균일 분포에 대하여))

  • 전용희;박정숙;정태수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.8
    • /
    • pp.1926-1940
    • /
    • 1998
  • This paper is the part II of research results on the performance evaluation of fully interconnected ATM switch, and includes the performance evaluation results for bursty traffic and nonuniform distribution. The switch model is a fyully interconnected switch type proposed by ETRI and is the proper architecutre for a small-sized switch element. The proposed switch consists of two steps of buffering scheme in the switch fabric in order to effectively absorb the effect of bursty nature of ATM traffic. The switch uses bit addressing method for addressing shcmeme and thus it is easy to implement multicasting function without adding additional functional block. In order to incorporate the bursty nature of traffic in ATM networks, we use IBP(Interrupted Bernoulli Process) model as an input traffic model as well as random traffic model which has been used as a traditional traffic model. In order to design the various scenarios for simulation, we considered both uniform and nonuniform output distribution, and also implemented multicast function. In this paper, we presented the simulation results in diverse environments and evaluated the performance of the switch.

  • PDF

Digital Video Scrambling Methods using Motion Vector and Intra Prediction Mode (움직임 벡터와 인트라 예측 모드를 이용한 디지털 비디오 스크램블링 방법)

  • Ahn, Jin-Haeng;Jeon, Byeung-Woo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.4 s.304
    • /
    • pp.133-142
    • /
    • 2005
  • In this paper, two digital video scrambling methods are proposed as simple means of the digital content protection techniques. One is inter block scrambling using motion vector, the other is intra block scrambling using intra prediction mode. The proposed inter block scrambling method distorts the original sequences by swapping horizontal and vertical components of motion vector. This method can be applied on most common video coding techniques such as MPEG-1, 2, 4, H.264, etc. The proposed intra block scrambling method distorts the original sequences by modifying intra prediction mode that is property of H.254 video coding technique. Both methods do not cause my bit rate increase after scrambling. Moreover, they have low complexity because they need only simple operation like XOR. Especially, the proposed intra block scrambling does not distort inter blocks directly. But inter blocks are distorted by error propagation effect as much as intra blocks. This paper introduces two new digital video scrambling method and verifies its effectiveness through simulation.

Impulse Noise Filtering through Evolutionary Approach using Noise-free Pixels (무잡음 화소를 이용한 진화적인 방법의 임펄스 잡음 필터링)

  • Mahmood, Muhammad Tariq;Choi, Young Kyu
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.5
    • /
    • pp.347-352
    • /
    • 2013
  • In impulse noise filtering techniques window size play an important role. Usually, an appropriate window is determined according to the noise density. A small window may not be able to suppress noise properly whereas a large window may remove edges and fine image details. Moreover, the value of the central pixel is estimated by considering all pixels within the window. In this work, contrary to the previous approaches, we propose an iterative impulse noise removal scheme that emphasizes on noise-free pixels within a small neighborhood. The iterative process continues until all noisy pixels are replaced with the estimated pixels. In order to estimate the optimal value for a noisy pixel, a genetic programming (GP) based estimator is evolved that takes few noise-free pixels as input. The estimator is constituent of noise-free pixels, arithmetic operators and random constants. Experimental results show that theproposed scheme is capable of removing impulse noise effectively while preserving the fine image details. Especially, our approach has shown effectiveness against high impulse noise density.