• 제목/요약/키워드: Gauss-Markov

검색결과 38건 처리시간 0.023초

Design of an Error Model for Performance Enhancement of MEMS IMU-Based GPS/INS Integrated Navigation Systems

  • Koo, Moonsuk;Oh, Sang Heon;Hwang, Dong-Hwan
    • Journal of Positioning, Navigation, and Timing
    • /
    • 제1권1호
    • /
    • pp.51-57
    • /
    • 2012
  • In this paper, design of an error model is presented in which the bias characteristic of the MEMS IMU is taken into consideration for performance enhancement of the MEMS IMU-based GPS/INS integrated navigation system. The drift bias of the MEMS IMU is modeled as a 1st-order Gauss-Markov (GM) process, and the autocorrelation function is obtained from the collected IMU data, and the correlation time is estimated from this. Prior to obtaining the autocorrelation function, the noise of IMU data is eliminated based on wavelet. As a result of simulation, it is represented that the parameters of error model can be estimated correctly only when a proper denoising is performed according to dynamic behavior of drift bias, and that the integrated navigation system based on error model, in which the drift bias is considered, provides more correct navigation performance compared to the integrated navigation system based on error model in which the drift bias is not considered.

A New Fair Call Admission Control for Integrated Voice and Data Traffic in Wireless Mobile Networks

  • Hwang, Young Ha;Noh, Sung-Kee;Kim, Sang-Ha
    • Journal of Information Processing Systems
    • /
    • 제2권2호
    • /
    • pp.107-113
    • /
    • 2006
  • It is essential to guarantee a handoff dropping probability below a predetermined threshold for wireless mobile networks. Previous studies have proposed admission control policies for integrated voice/data traffic in wireless mobile networks. However, since QoS has been considered only in terms of CDP (Call Dropping Probability), the result has been a serious CBP (Call Blocking Probability) unfairness problem between voice and data traffic. In this paper, we suggest a new admission control policy that treats integrated voice and data traffic fairly while maintaining the CDP constraint. For underprivileged data traffic, which requires more bandwidth units than voice traffic, the packet is placed in a queue when there are no available resources in the base station, instead of being immediately rejected. Furthermore, we have adapted the biased coin method concept to adjust unfairness in terms of CBP. We analyzed the system model of a cell using both a two-dimensional continuous-time Markov chain and the Gauss-Seidel method. Numerical results demonstrate that our CAC (Call Admission Control) scheme successfully achieves CBP fairness for voice and data traffic.

Determination of Optimal Cell Capacity for Initial Cell Planning in Wireless Cellular Networks

  • Hwang, Young-Ha;Noh, Sung-Kee;Kim, Sang-Ha
    • Journal of Information Processing Systems
    • /
    • 제2권2호
    • /
    • pp.88-94
    • /
    • 2006
  • In wireless cellular networks, previous researches on admission control policies and resource allocation algorithm considered the QoS (Quality of Service) in terms of CDP (Call Dropping Probability) and CBP (Call Blocking Probability). However, since the QoS was considered only within a predetermined cell capacity, the results indicated a serious overload problem of systems not guaranteeing both CDP and CBP constraints, especially in the hotspot cell. That is why a close interrelationship between CDP, CBP and cell capacity exists. Thus, it is indispensable to consider optimal cell capacity guaranteeing multiple QoS (CDP and CBP) at the time of initial cell planning for networks deployment. In this paper, we will suggest a distributed determination scheme of optimal cell capacity guaranteeing both CDP and CBP from a long-term perspective for initial cell planning. The cell-provisioning scheme is performed by using both the two-dimensional continuous-time Markov chain and an iterative method called the Gauss-Seidel method. Finally, numerical and simulation results will demonstrate that our scheme successfully determines an optimal cell capacity guaranteeing both CDP and CBP constraints for initial cell planning.

벡터 양자화를 위한 고속 탐색 알고리듬에 관한 연구 (A Study on the Fast Search Algorithm for Vector Quantization)

  • 지상현;김용석;이남일;강상원
    • 한국음향학회지
    • /
    • 제22권4호
    • /
    • pp.293-298
    • /
    • 2003
  • 본 논문에서는 NNVQ (nearest neighbor vector quantization)를 위한 고속탐색 알고리듬을 제안하였다. 제안된 알고리듬은 입력 벡터 내 지정된 요소의 부호화 왜곡을 임계값과 비교해서 최적 코드워드가 될 가능성이 없는 코드워드를 탐색 대상 코드워드에서 제외함으로써 코드북 탐색의 범위를 줄인다. 이를 통해 기존의 풀서치(full-search) 알고리듬과 동일한 SD(spectral distortion) 성능을 얻으면서 부호화 과정에서의 처리시간과 복잡도를 감소시킨다. 제안된 알고리듬을 Gauss-Markov 소스에 대해 설계된 일반적인 벡터 양자화기와 3GPP에서 표준화된 AMR (adaptive multi-rate) 음성 코덱의 LSP 양자화기에 각각 적용하여 실험하였다. 실험결과 제안된 알고리듬은 SD 성능감쇄 없이 탐색 대상 범위를 감소시킴으로써 부호화시 복잡도를 50%이상 줄일 수 있었다.

대규모 FANET에서 UAV 편대간 통신을 위한 링크 상태 예측에 기반한 반응적 라우팅 기법 (A Reactive Routing Scheme based on the Prediction of Link State for Communication between UAV Squadrons in a Large-Scale FANET)

  • 황희두;권오준
    • 한국멀티미디어학회논문지
    • /
    • 제20권4호
    • /
    • pp.593-605
    • /
    • 2017
  • In applications which are covered wide range, it is possible that one or more number of Unmanned Aerial Vehicle(UAV) squadrons are used to perform a mission. In this case, it is most important to communicate seamlessly between the UAV squadrons. In this paper, we applied the modified OLSR(OSLR-Pds) which can prediction for state of the link for the communication in UAV squadron, and applied the modified AOMDV which can build multi-path for the communication between UAV Squadrons. The mobility of nodes are modeled using Gauss-Markov algorithm, and relative speed between nodes were calculated by derive equation of movement, and thereby we can predict link state for in a squadron and between squadrons. An experiment for comparing AODV, AOMDV and the proposed routing protocol was conducted by three factors such as packet delivery ratio, end to end delay, and routing overhead. In experiment result, we make sure that the proposed protocol performance are superior in these three factors. However, if the density of the nodes constituting FANET are too low, and if the moving speed of node is very slow, there is no difference to others protocols.

GPS 이동측위를 위한 프로세스 잡음 모델링 (Modeling of Stochastic Process Noises for Kinematic GPS Positioning)

  • 홍창기
    • 한국측량학회지
    • /
    • 제33권2호
    • /
    • pp.123-129
    • /
    • 2015
  • 알고리즘의 유연성 및 효율성으로 인해 GPS 이동측위 시 칼만필터가 주로 사용되어 왔으며 동시에 다양한 계통오차의 제거가 가능한 상대측위 기법이 널리 사용되어 왔다. 하지만 기선의 길이가 길어지게 되면 상대측위 기법을 사용하더라도 대기효과를 충분히 제거하기 어렵기 때문에 이 경우 제거되지 않고 남아 있는 대기효과를 상태벡터에 추가하여 추정을 하기도 한다. 칼만필터를 이용하는 경우 일반적으로 대기효과는 랜덤워크 혹은 일차가우스-마르코프 프로세스로 모델링하게 되는데 이때 프로세스 잡음에 대한 정확한 모델링이 필수적이다. 본 연구에서는 대기효과에 해당되는 프로세스 잡음 모델링을 위해 필요한 매개변수를 결정하였다. 이를 위해 이중차분 전리층 지연값과 천정방향 습윤지연값을 이용하여 실험적 자기상관함수를 계산하였으며 이를 통해 프로세스 잡음 모델링에 필요한 매개변수를 계산하였다. 결정된 매개변수값들은 유사한 대기환경에서 취득된 데이터에 대한 프로세스 잡음 모델링 시 직접 사용될 수 있으며 유사한 대기환경이 아닌 경우일 지라도 초기 근사값으로 활용될 수 있을 것이다.

Image Denoising for Metal MRI Exploiting Sparsity and Low Rank Priors

  • Choi, Sangcheon;Park, Jun-Sik;Kim, Hahnsung;Park, Jaeseok
    • Investigative Magnetic Resonance Imaging
    • /
    • 제20권4호
    • /
    • pp.215-223
    • /
    • 2016
  • Purpose: The management of metal-induced field inhomogeneities is one of the major concerns of distortion-free magnetic resonance images near metallic implants. The recently proposed method called "Slice Encoding for Metal Artifact Correction (SEMAC)" is an effective spin echo pulse sequence of magnetic resonance imaging (MRI) near metallic implants. However, as SEMAC uses the noisy resolved data elements, SEMAC images can have a major problem for improving the signal-to-noise ratio (SNR) without compromising the correction of metal artifacts. To address that issue, this paper presents a novel reconstruction technique for providing an improvement of the SNR in SEMAC images without sacrificing the correction of metal artifacts. Materials and Methods: Low-rank approximation in each coil image is first performed to suppress the noise in the slice direction, because the signal is highly correlated between SEMAC-encoded slices. Secondly, SEMAC images are reconstructed by the best linear unbiased estimator (BLUE), also known as Gauss-Markov or weighted least squares. Noise levels and correlation in the receiver channels are considered for the sake of SNR optimization. To this end, since distorted excitation profiles are sparse, $l_1$ minimization performs well in recovering the sparse distorted excitation profiles and the sparse modeling of our approach offers excellent correction of metal-induced distortions. Results: Three images reconstructed using SEMAC, SEMAC with the conventional two-step noise reduction, and the proposed image denoising for metal MRI exploiting sparsity and low rank approximation algorithm were compared. The proposed algorithm outperformed two methods and produced 119% SNR better than SEMAC and 89% SNR better than SEMAC with the conventional two-step noise reduction. Conclusion: We successfully demonstrated that the proposed, novel algorithm for SEMAC, if compared with conventional de-noising methods, substantially improves SNR and reduces artifacts.

Transmitter Beamforming and Artificial Noise with Delayed Feedback: Secrecy Rate and Power Allocation

  • Yang, Yunchuan;Wang, Wenbo;Zhao, Hui;Zhao, Long
    • Journal of Communications and Networks
    • /
    • 제14권4호
    • /
    • pp.374-384
    • /
    • 2012
  • Utilizing artificial noise (AN) is a good means to guarantee security against eavesdropping in a multi-inputmulti-output system, where the AN is designed to lie in the null space of the legitimate receiver's channel direction information (CDI). However, imperfect CDI will lead to noise leakage at the legitimate receiver and cause significant loss in the achievable secrecy rate. In this paper, we consider a delayed feedback system, and investigate the impact of delayed CDI on security by using a transmit beamforming and AN scheme. By exploiting the Gauss-Markov fading spectrum to model the feedback delay, we derive a closed-form expression of the upper bound on the secrecy rate loss, where $N_t$ = 2. For a moderate number of antennas where $N_t$ > 2, two special cases, based on the first-order statistics of the noise leakage and large number theory, are explored to approximate the respective upper bounds. In addition, to maintain a constant signal-to-interferenceplus-noise ratio degradation, we analyze the corresponding delay constraint. Furthermore, based on the obtained closed-form expression of the lower bound on the achievable secrecy rate, we investigate an optimal power allocation strategy between the information signal and the AN. The analytical and numerical results obtained based on first-order statistics can be regarded as a good approximation of the capacity that can be achieved at the legitimate receiver with a certain number of antennas, $N_t$. In addition, for a given delay, we show that optimal power allocation is not sensitive to the number of antennas in a high signal-to-noise ratio regime. The simulation results further indicate that the achievable secrecy rate with optimal power allocation can be improved significantly as compared to that with fixed power allocation. In addition, as the delay increases, the ratio of power allocated to the AN should be decreased to reduce the secrecy rate degradation.