• Title/Summary/Keyword: recursive

Search Result 1,608, Processing Time 0.024 seconds

Performance Analysis of Sequential Estimation Schemes for Fast Acquisition of Direct Sequence Spread Spectrum Systems (직접 수열 확산 대역 시스템의 고속 부호 획득을 위한 순차 추정 기법들의 성능 분석)

  • Lee, Seong Ro;Chae, Keunhong;Yoon, Seokho;Jeong, Min-A
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.8
    • /
    • pp.467-473
    • /
    • 2014
  • In the direct sequence spread spectrum system, the correct synchronization is very important; hence, several acquisition schemes based on the sequential estimation have been developed. Typically, the rapid acquisition sequential estimation (RASE) scheme, the seed accumulating sequential estimation (SASE) scheme, the recursive soft sequential estimation (RSSE) scheme have been developed for the correct acquisition. However, the objective performance comparison and analysis between former estimation schemes have not been performed so far. In this paper, we compare and analyze the performance of the above sequential estimation schemes by simulating the correct chip probability and the mean acquisition time (MAT).

Fast CU Decision Algorithm using the Initial CU Size Estimation and PU modes' RD Cost (초기 CU 크기 예측과 PU 모드 예측 비용을 이용한 고속 CU 결정 알고리즘)

  • Yoo, Hyang-Mi;Shin, Soo-Yeon;Suh, Jae-Won
    • Journal of Broadcast Engineering
    • /
    • v.19 no.3
    • /
    • pp.405-414
    • /
    • 2014
  • High Efficiency Video Coding(HEVC) obtains high compression ratio by applying recursive quad-tree structured coding unit(CU). However, this recursive quad-tree structure brings very high computational complexity to HEVC encoder. In this paper, we present fast CU decision algorithm in recursive quad-tree structure. The proposed algorithm estimates initial CU size before CTU encoding and checks the proposed condition using Coded Block Flag(CBF) and Rate-distortion cost to achieve the fast encoding time saving. And, intra mode estimation is also possible to be skipped using the CBF values acquired during the inter PU mode estimations. Experiment results shows that the proposed algorithm saved about 49.91% and 37.97% of encoding time according to the weighting condition.

Preservice teachers' Key Developmental Understandings (KDUs) for fraction multiplication (예비교사의 분수 곱셈을 위한 '발달에 핵심적인 이해'에 관한 연구)

  • Lee, Soo-Jin;Shin, Jae-Hong
    • Journal of the Korean School Mathematics Society
    • /
    • v.14 no.4
    • /
    • pp.477-490
    • /
    • 2011
  • The concept of pedagogical content knowledge (PCK) has been developed and expanded to identify essential components of mathematical knowledge for teaching (MKT) by Ball and her colleagues (2008). This study proposes an alternative perspective to view MKT focusing on key developmental understandings (KDUs) that carry through an instructional sequence, that are foundational for learning other ideas. In this study we provide constructive components of KDUs in fraction multiplication by focusing on the constructs of 'three-level-of-units structure' and 'recursive partitioning operation'. Expecially, our participating preservice elementary teacher, Jane, demonstrated that recursive partitioning operations with her length model played a significant role as a KDU in fraction multiplication.

  • PDF

Lossless Compression for Hyperspectral Images based on Adaptive Band Selection and Adaptive Predictor Selection

  • Zhu, Fuquan;Wang, Huajun;Yang, Liping;Li, Changguo;Wang, Sen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.8
    • /
    • pp.3295-3311
    • /
    • 2020
  • With the wide application of hyperspectral images, it becomes more and more important to compress hyperspectral images. Conventional recursive least squares (CRLS) algorithm has great potentiality in lossless compression for hyperspectral images. The prediction accuracy of CRLS is closely related to the correlations between the reference bands and the current band, and the similarity between pixels in prediction context. According to this characteristic, we present an improved CRLS with adaptive band selection and adaptive predictor selection (CRLS-ABS-APS). Firstly, a spectral vector correlation coefficient-based k-means clustering algorithm is employed to generate clustering map. Afterwards, an adaptive band selection strategy based on inter-spectral correlation coefficient is adopted to select the reference bands for each band. Then, an adaptive predictor selection strategy based on clustering map is adopted to select the optimal CRLS predictor for each pixel. In addition, a double snake scan mode is used to further improve the similarity of prediction context, and a recursive average estimation method is used to accelerate the local average calculation. Finally, the prediction residuals are entropy encoded by arithmetic encoder. Experiments on the Airborne Visible Infrared Imaging Spectrometer (AVIRIS) 2006 data set show that the CRLS-ABS-APS achieves average bit rates of 3.28 bpp, 5.55 bpp and 2.39 bpp on the three subsets, respectively. The results indicate that the CRLS-ABS-APS effectively improves the compression effect with lower computation complexity, and outperforms to the current state-of-the-art methods.

An Efficient Recursive Cell Architecture for Modified Euclidean Algorithm to Decode Reed-Solomon Code (Reed-Solomon부호의 복호를 위한 수정 유클리드 알고리즘의 효율적인 반복 셀 구조)

  • Kim, Woo-Hyun;Lee, Sang-Seol;Song, Moon-Kyou
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.1
    • /
    • pp.34-40
    • /
    • 1999
  • Reed-Solomon(RS) codes have been employed to correct burst errors in applications such as CD-ROM, HDTV, ATM and digital VCRs. For the decoding RS codes, the Berlekamp-Massey algorithm, Euclidean algorithm and modified Euclidean algorithm(MEA) have been developed among which the MEA becomes the most popular decoding scheme. We propose an efficient recursive cell architecture suitable for the MEA. The advantages of the proposed scheme are twofold. First, The proposed architecture uses about 25% less clock cycles required in the MEA operation than[1]. Second, the number of recursive MEA cells can be reduced, when the number of clock cycles spent in the MEA operation is larger than code word length n. thereby buffer requirement for the received words can be reduced. For demonstration, the MEA circurity for (128,124) RS code have been described and the MEA operation is verified through VHDL.

  • PDF

A Study on the Recursive Identification of Modal Parameters (회귀적 방법에 의한 모우드 변수 규명에 관한 연구)

  • 고장욱;이재응
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1995.04a
    • /
    • pp.147-152
    • /
    • 1995
  • 실험에 의한 모우드 해석 방법들은 1980년대부터 활발히 연구되어 많은 새로운 방법들이 개발되어 발표되었다. 그러나 개발된 대부분의 방법들은 측정된 데이타를 일괄처리하는 밸치(또는 off-line) 방법들이다. 최근에는 시간에 따라서 변하는 구조물의 동특성을 규명하는 분야에 모우드 해석 방법이 응용되어 사용되고 있다. 이러한 응용분야에서는 모우드 변수들의 변화되는 값을 새로운 데이타가 샘플링 될 때마다 그 값들을 수정하면서 추정할 수 있는 회귀적인(recursive 또는 on-line) 방법을 사용하여야 한다. Davies와 Hammond[1]는 회귀적 선형 자승법(Recursive Least Squares : RLS)을 이용하여 모우드 변수를 구하고 이를 벧치방법인 Instrumental Variable 방법과 Fourier 방법의 결과와 비교하였다. 그러나, 그 결과에서 보여준것처럼 RLS 방법은 잡음 대 시호비가 낮을 때에만 모우드 변수 값들을 정확하게 추정할 수 있었다. Sundararajan과 Montgomrey[2]는 회귀적 선형 최소자승 격자필터(lattice filter)를 이용하여 구조물의 차수(order)와 고유진동형, 그리고 진폭을 결정한 후 이를 토대로 회귀적 gradient형태의 방정식 오차 규명 방법(equation-error identification algorithm)에 의하여 모우드 변수들을 추정하였다. 이 방법은 2차원 격자구조물의 모우드 변수 추정에 사용되었으며, 또한 적응모우드제어에도 성공적으로 이용되었다. 그러나, 이 방법도 잡음 대 신호비가 낮은 환경에서만 사용할 수 있다는 단점이 있다. 위에서 언급한 방법들은 모두 RLS 방법을 기초로 하여 개발되었으나, RLS 방법은 전형적인 결정적(deterministic)방법으로서 잡음이 섞인 데이타를 처리하기에는 부적절한 방법임이 널리 알려진 사실이다[3]. 최근에 Ben Mrad와 Fassois[4]는 신호에 잡음이 존재하여도 이를 잘 처리할 수 있는 확률적(stochastic) 방법을 개발하여 기존의 결정적 방법들과 그 결과를 비교하였다. 그러나, 개발된 방법은 응답 신호에 백색잡음(white noise)이 섞이는 특수한 경우에만 사용할 수 있게 만들어져서 이 방법의 실질적인 적용에는 어려움이 있다. 본 연구에서는 기존의 방법들의 단점을 극복할 수 있는 새로운 회귀적 모우드 변수 규명 방법을 개발하였다. 이는 Fassois와 Lee가 ARMAX모델의 계수를 효율적으로 추정하기 위하여 개발한 뱉치방법인 Suboptimum Maximum Likelihood 방법[5]를 기초로 하여 개발하였다. 개발된 방법의 장점은 응답 신호에 유색잡음이 존재하여도 모우드 변수들을 항상 정확하게 구할 수 있으며, 또한 알고리즘의 안정성이 보장된 것이다.

  • PDF

Social Network Spam Detection using Recursive Structure Features (소셜 네트워크 상에서의 재귀적 네트워크 구조 특성을 활용한 스팸탐지 기법)

  • Jang, Boyeon;Jeong, Sihyun;Kim, Chongkwon
    • Journal of KIISE
    • /
    • v.44 no.11
    • /
    • pp.1231-1235
    • /
    • 2017
  • Given the network structure in online social network, it is important to determine a way to distinguish spam accounts from the network features. In online social network, the service provider attempts to detect social spamming to maintain their service quality. However the spammer group changes their strategies to avoid being detected. Even though the spammer attempts to act as legitimate users, certain distinguishable structural features are not easily changed. In this paper, we investigate a way to generate meaningful network structure features, and suggest spammer detection method using recursive structural features. From a result of real-world dataset experiment, we found that the proposed algorithm could improve the classification performance by about 8%.

Co-simulation of MultiBody Dynamics and Plenteous Sphere of Contacted Particles Using NVIDIA GPGPU (NVIDIA 의 GPGPU 를 이용한 수 많은 구형 접촉 입자가 포함된 다물체 동역학 해석)

  • Park, Ji-Soo;Yoon, Joon-Shik;Choi, Jin-Hwan;Rhim, Sung-Soo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.36 no.4
    • /
    • pp.465-474
    • /
    • 2012
  • In this study, a dynamic simulation model that considers many spherical particles and multibody dynamics (MBD) entities is developed. Plenteous spherical particles are solved using the Discrete Element Method (DEM) technique and simulated on a GPU board in a PC. A fast algorithm is used to calculate the Hertzian contact forces between many spherical particles, and NVIDIA CUDA is used to increase the calculation speed. The explicit integration method is applied to solve the many spheres. MBD entities are simulated by recursive formulation. Constraints are reduced by recursive formulation, and the implicit generalized alpha method is applied to solve the dynamic model. A new algorithm is developed to simulate the DEM and MBD models simultaneously. As a numerical example, a truck car model and gear model are developed. The results show that the proposed algorithm using a general-purpose GPU in a PC has many advantages.

Design of a New VSS-Adaptive Filter for a Potential Application of Active Noise Control to Intake System (흡기계 능동소음제어를 위한 적응형 필터 알고리즘의 개발)

  • Kim, Eui-Youl;Kim, Byung-Hyun;Kim, Ho-Wuk;Lee, Sang-Kwon
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.22 no.2
    • /
    • pp.146-155
    • /
    • 2012
  • The filtered-x LMS(FX-LMS) algorithm has been applied to the active noise control(ANC) system in an acoustic duct. This algorithm is designed based on the FIR(finite impulse response) filter, but it has a slow convergence problem because of a large number of zero coefficients. In order to improve the convergence performance, the step size of the LMS algorithm was modified from fixed to variable. However, this algorithm is still not suitable for the ANC system of a short acoustic duct since the reference signal is affected by the backward acoustic wave propagated from a secondary source. Therefore, the recursive filtered-u LMS algorithm(FU-LMS) based on infinite impulse response(IIR) is developed by considering the backward acoustic propagation. This algorithm, unfortunately, generally has a stability problem. The stability problem was improved by using an error smoothing filter. In this paper, the recursive LMS algorithm with variable step size and smoothing error filter is designed. This recursive LMS algorithm, called FU-VSSLMS algorithm, uses an IIR filter. With fast convergence and good stability, this algorithm is suitable for the ANC system in a short acoustic duct such as the intake system of an automotive. This algorithm is applied to the ANC system of a short acoustic duct. The disturbance signals used as primary noise source are a sinusoidal signal embedded in white noise and the chirp signal of which the instantaneous frequency is variable. Test results demonstrate that the FU-VSSLMS algorithm has superior convergence performance to the FX-LMS algorithm and FX-LMS algorithm. It is successfully applied to the ANC system in a short duct.

Reconstruction of High-Resolution Facial Image Based on Recursive Error Back-Projection of Top-Down Machine Learning (하향식 기계학습의 반복적 오차 역투영에 기반한 고해상도 얼굴 영상의 복원)

  • Park, Jeong-Seon;Lee, Seong-Whan
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.3
    • /
    • pp.266-274
    • /
    • 2007
  • This paper proposes a new reconstruction method of high-resolution facial image from a low-resolution facial image based on top-down machine learning and recursive error back-projection. A face is represented by a linear combination of prototypes of shape and that of texture. With the shape and texture information of each pixel in a given low-resolution facial image, we can estimate optimal coefficients for a linear combination of prototypes of shape and those that of texture by solving least square minimizations. Then high-resolution facial image can be obtained by using the optimal coefficients for linear combination of the high-resolution prototypes. In addition, a recursive error back-projection procedure is applied to improve the reconstruction accuracy of high-resolution facial image. The encouraging results of the proposed method show that our method can be used to improve the performance of the face recognition by applying our method to reconstruct high-resolution facial images from low-resolution images captured at a distance.