Low-complexity Architecture for AR(1) Inference

08/21/2020
by   A. Borges Jr., et al.
0

In this Letter, we propose a low-complexity estimator for the correlation coefficient based on the signed AR(1) process. The introduced approximation is suitable for implementation in low-power hardware architectures. Monte Carlo simulations reveal that the proposed estimator performs comparably to the competing methods in literature with maximum error in order of 10^-2. However, the hardware implementation of the introduced method presents considerable advantages in several relevant metrics, offering more than 95 frequency when compared to the reference method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/15/2015

A Low Complexity VLSI Architecture for Multi-Focus Image Fusion in DCT Domain

Due to the confined focal length of optical sensors, focusing all object...
research
06/23/2016

Multiplierless 16-point DCT Approximation for Low-complexity Image and Video Coding

An orthogonal 16-point approximate discrete cosine transform (DCT) is in...
research
05/11/2020

Hardware Implementation of Adaptive Watermarking Based on Local Spatial Disorder Analysis

With the increasing use of the internet and the ease of exchange of mult...
research
09/06/2019

2-Local Hamiltonian with Low Complexity is QCMA

We prove that 2-Local Hamiltonian (2-LH) with Low Complexity problem is ...
research
08/04/2021

Low-complexity Scaling Methods for DCT-II Approximations

This paper introduces a collection of scaling methods for generating 2N-...
research
12/08/2022

Framewise WaveGAN: High Speed Adversarial Vocoder in Time Domain with Very Low Computational Complexity

GAN vocoders are currently one of the state-of-the-art methods for build...
research
06/11/2013

Stochastic approximation for speeding up LSTD (and LSPI)

We propose a stochastic approximation (SA) based method with randomizati...

Please sign up or login with your details

Forgot password? Click here to reset