• Title/Summary/Keyword: Domain Complexity

검색결과 442건 처리시간 0.025초

Low-Complexity Sub-Pixel Motion Estimation Utilizing Shifting Matrix in Transform Domain

  • Ryu, Chul;Shin, Jae-Young;Park, Eun-Chan
    • Journal of Electrical Engineering and Technology
    • /
    • 제11권4호
    • /
    • pp.1020-1026
    • /
    • 2016
  • Motion estimation (ME) algorithms supporting quarter-pixel accuracy have been recently introduced to retain detailed motion information for high quality of video in the state-of-the-art video compression standard of H.264/AVC. Conventional sub-pixel ME algorithms in the spatial domain are faced with a common problem of computational complexity because of embedded interpolation schemes. This paper proposes a low-complexity sub-pixel motion estimation algorithm in the transform domain utilizing shifting matrix. Simulations are performed to compare the performances of spatial-domain ME algorithms and transform-domain ME algorithms in terms of peak signal-to-noise ratio (PSNR) and the number of bits per frame. Simulation results confirm that the transform-domain approach not only improves the video quality and the compression efficiency, but also remarkably alleviates the computational complexity, compared to the spatial-domain approach.

도메인 분석의 신뢰성 향상을 위한 도메인 분류와 복잡도 측정에 관한 연구 (A Study for Domain Categorization and Estimation of Complexity for Reliability Improvement of Domain Analysis)

  • 이은서
    • 정보처리학회논문지:소프트웨어 및 데이터공학
    • /
    • 제5권1호
    • /
    • pp.1-6
    • /
    • 2016
  • 도메인 분석은 신뢰성 있는 프로젝트 개발의 중요한 요소가 된다. 도메인 분석에서 발생되는 오류는 전체 시스템에 영향을 주게 되고, 그 결과 고객의 만족도가 낮아진다. 따라서 요구사항 단계에서 신뢰성 있는 분석을 위하여 도메인의 특성을 분석할 수 있는 방법이 필요하게 된다. 본 논문에서는 이와 같은 문제를 해결하기 위하여 도메인 분석의 신뢰성 향상을 위한 도메인 분류와 복잡도 측정방법을 제시하고자 한다.

Reduced Complexity Signal Detection for OFDM Systems with Transmit Diversity

  • Kim, Jae-Kwon;Heath Jr. Robert W.;Powers Edward J.
    • Journal of Communications and Networks
    • /
    • 제9권1호
    • /
    • pp.75-83
    • /
    • 2007
  • Orthogonal frequency division multiplexing (OFDM) systems with multiple transmit antennas can exploit space-time block coding on each subchannel for reliable data transmission. Spacetime coded OFDM systems, however, are very sensitive to time variant channels because the channels need to be static over multiple OFDM symbol periods. In this paper, we propose to mitigate the channel variations in the frequency domain using a linear filter in the frequency domain that exploits the sparse structure of the system matrix in the frequency domain. Our approach has reduced complexity compared with alternative approaches based on time domain block-linear filters. Simulation results demonstrate that our proposed frequency domain block-linear filter reduces computational complexity by more than a factor of ten at the cost of small performance degradation, compared with a time domain block-linear filter.

노인의 불확실성과 우울이 삶의 질에 미치는 영향 (Effects of Uncertainty and Depression on the Quality of Life of Elderly People)

  • 김현승;조성현
    • 대한통합의학회지
    • /
    • 제10권3호
    • /
    • pp.209-219
    • /
    • 2022
  • Purpose : The purpose of this study was two-fold: to investigate the effects of uncertainty and depression on the quality of life (QoL) of elderly people with chronic diseases and to provide basic data on the physical, emotional, and psychological factors affecting their QoL in the field of physical therapy. Methods : A questionnaire covering uncertainty, depression, and QoL was distributed among 320 elderly people. Pearson's correlation analysis was performed to examine the correlation between uncertainty (ambiguity, complexity, inconsistency, and unpredictability), depression, and QoL (physical, psychological, social, and living environment domains) of the respondents; furthermore, multiple regression analysis was performed to identify the factors affecting the QoL of the respondents with a chronic disease. Results : The sub-factors of uncertainty and QoL-"complexity and social domain" (r=-.295, p<.001), "complexity and living environment domain" (r=-.302, p<.001), and "inconsistency and living environment domain" (r=-.360, p<.001)-showed a negative (-) correlation, as did depression and the sub-factors of QoL-"depression and physical domain" (r=-.782, p<.001), "depression and psychological domain" (r=-.876, p<.001), "depression and social domain" (r=-.668, p<.001), and "depression and living environment domain" (r=-.731, p<.001). The factors affecting QoL were complexity (𝛽=-.122, p<.001), inconsistency (𝛽=-.102, p=.002), unpredictability (𝛽=.112, p<.001), and depression (𝛽=-.850, p<.001). The relative influence of the independent variables was in the order of depression, complexity, unpredictability, and inconsistency, and the explanatory power was 77.1 % (F=215.853, p<.001). Conclusion : It is important to help the elderly with chronic diseases reduce the negative impact on their quality of life by helping them gain support from their families and medical professionals and by increasing their understanding through communication so that they can transition from negative emotions to positive emotions of opportunity.

블록 프로세싱 기법을 이용한 주파수 영역에서의 회귀 최소 자승 알고리듬 (Frequency-Domain RLS Algorithm Based on the Block Processing Technique)

  • 박부견;김동규;박원석
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • pp.240-240
    • /
    • 2000
  • This paper presents two algorithms based on the concept of the frequency domain adaptive filter(FDAF). First the frequency domain recursive least squares(FRLS) algorithm with the overlap-save filtering technique is introduced. This minimizes the sum of exponentially weighted square errors in the frequency domain. To eliminate discrepancies between the linear convolution and the circular convolution, the overlap-save method is utilized. Second, the sliding method of data blocks is studied Co overcome processing delays and complexity roads of the FRLS algorithm. The size of the extended data block is twice as long as the filter tap length. It is possible to slide the data block variously by the adjustable hopping index. By selecting the hopping index appropriately, we can take a trade-off between the convergence rate and the computational complexity. When the input signal is highly correlated and the length of the target FIR filter is huge, the FRLS algorithm based on the block processing technique has good performances in the convergence rate and the computational complexity.

  • PDF

디지털 펄스압축기의 연산 양 비교 (Comparison of Computation Complexity for Digital Pulse Compressor)

  • 신현익;김상규;조태훈;김환우
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
    • /
    • pp.2196-2199
    • /
    • 2003
  • With the development of digital signal processor(DSP), digital pulse compressor (DPC) is commonly used in radar systems. A DPC is implemented by using finite impulse response(FIR) filter algorithm in time domain or fast Fourier transform(FFT) algorithm in frequency domain. This paper compares the computation complexity tot these two methods and calculates boundary Fm filter taps that determine which of the two methods is better based on computation amount. Also, it shows that the boundary FIR filter taps for DSP, ADSP21060, and those for computation complexity have similar characteristic.

  • PDF

Computational Complexity Comparison of Second-Order Volterrra Filtering Algorithms

  • Im, Sungin
    • The Journal of the Acoustical Society of Korea
    • /
    • 제16권2E호
    • /
    • pp.38-46
    • /
    • 1997
  • The objective of the paper is to compare the computational complexity of five algorithms for computing time-domain second-order Volterra filter outputs in terms of number of real multiplication and addition operations required for implementation. This study shows that if the filter memory length is greater that or equal to 16, the fast algorithm using the overlap-save method and the frequency-domain symmetry properties of the quadratic coefficients is the most efficient among the algorithms investigated in this paper, When the filter memory length is less than 16, the algorithm using the time-domain symmetry properties is better than any other algorithm.

  • PDF

Scalable Path Computation Flooding Approach for PCE-Based Multi-domain Networks

  • Perello, Jordi;Hernandez-Sola, Guillem;Agraz, Fernando;Spadaro, Salvatore;Comellas, Jaume
    • ETRI Journal
    • /
    • 제32권4호
    • /
    • pp.622-625
    • /
    • 2010
  • In this letter, we assess the scalability of a path computation flooding (PCF) approach to compute optimal end-to-end inter-domain paths in a path computation element-based multi-domain network. PCF yields a drastically reduced network blocking probability compared to a blind per-domain path computation but introduces significant network control overhead and path computation complexity. In view of this, we introduce and compare an alternative low overhead PCF (LoPCF) solution. From the obtained results, LoPCF leads to similar blocking probabilities to PCF while exhibiting around 50% path computation complexity and network control overhead reduction.

Replica Correlation-Based Synchronization with Low Complexity and Frequency Offset Immunity

  • Chang, Kapseok;Bang, Seung Chan;Kim, Hoon
    • ETRI Journal
    • /
    • 제35권5호
    • /
    • pp.739-747
    • /
    • 2013
  • This paper investigates the multifarious nature of the long-term evolution (LTE) scheme and that of the modified LTE scheme for symbol timing synchronization (STS). This investigation allows us to propose a new replica correlation-based STS scheme to overcome the inherent weaknesses of the other two schemes. The proposed STS signal combines a gold sequence and a half sine wave in the time domain, whereas conventional STS signals specify either binary sequences or complex sequences in the time domain or in the frequency domain. In the proposed scheme, a sufficient correlation property is realized by the gold sequence, and robustness against the frequency offset (FO) is achieved through the sine wave. Compared to the existing LTE-related schemes, the proposed scheme can better achieve immunity to FO and reduction in detector complexity, as well as a low peak-to-average power ratio and a low detection error rate. Performance evaluations through analysis and simulation are provided in the paper to demonstrate these attributes.

정의역 최소화 기법을 이용한 프랙탈 영상압축 (Fractal Image Compression using the Minimizing Method of Domain Region)

  • 정태일;권기룡;문광석
    • 한국멀티미디어학회논문지
    • /
    • 제2권1호
    • /
    • pp.38-46
    • /
    • 1999
  • 본 논문에서는 복원시 사용될 정의역을 최소화하는 정의역 최소화 기법올 이용한 프랙탈 영상 압축방볍을 제안한디 기존의 프랙탈 영상복원은 복원하고자 하는 영상의 전체 치역블럭에 대해 반복축소변환올 적용함 으로써, 복원시 많은 계산량이 요구되었다 이를 개선하기 위해 각 치역블릭마다 정의역으로 참조된 횟수를 이용하여, 반복변환이 필요한 영역과 필요하지 않은 영역으로 구분하는 방법이 제시된 바 있다. 반복변환이 펼요한 영역이 감소할수록 복원시 계산량은 감소한다. 제안한 방법은 반복변환이 필요한 영역이 최소가 되는 최소정의역을정의하고,부호화시 정의역이 최소가되도록부호화하는알고리듬이다.즉,정의역의 탐색영역 을 치역과 비슷한 영역으로 제한하여, 정의역이 더 많이 중복되거나 중첩되도록 하였다 그 결과 프랙탈 영상 복원시 화질이나 압축율에 거의 영향을 미치지 않고, 반복변환에 필요한 계산량이 감소함으로써 고속 복원이 가능하였다.

  • PDF