LP-Based SNR Estimation with Low Computation Complexity

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low-Complexity Time-Domain SNR Estimation for OFDM Systems

A low-complexity SNR estimation algorithm for OFDM systems in frequency-selective fading channels is proposed. The estimator is based on a conventional preamble having two identical parts. It uses the correlation of the received signal samples to estimate signal power while noise power is estimated using the difference between received samples. Simulation results show that the proposed estimato...

متن کامل

ON FUZZY NEIGHBORHOOD BASED CLUSTERING ALGORITHM WITH LOW COMPLEXITY

The main purpose of this paper is to achieve improvement in thespeed of Fuzzy Joint Points (FJP) algorithm. Since FJP approach is a basisfor fuzzy neighborhood based clustering algorithms such as Noise-Robust FJP(NRFJP) and Fuzzy Neighborhood DBSCAN (FN-DBSCAN), improving FJPalgorithm would an important achievement in terms of these FJP-based meth-ods. Although FJP has many advantages such as r...

متن کامل

Linear complexity SimRank computation based on the iterative diagonal estimation

This paper presents a deterministic linear time complexity IDE-SimRank method to approximately compute SimRank with proved error bound. SimRank is a well-known similarity measure between graph vertices which relies on graph topology only and is built on intuition that ”two objects are similar if they are related to similar objects”. The fixed point equation for direct SimRank computation is the...

متن کامل

Complexity Penalised M-Estimation: Fast Computation

We present fast algorithms for the exact computation of estimators for time series, based on a simple variational approach. The functionals behind are complexity penalised loglikelihoodor M -functions. We emphasize optimisation simultaneously in all model parameters. The algorithms cover a broad range of estimators, including all those commonly adopted in the literature. This is illustrated by ...

متن کامل

Schemes for Digital Gift Certificates with Low Computation Complexity

Recently, e-commerce becomes widespread; hence electronic department stores come into being. As a result, Chan and Chang proposed a scheme for digital gift certificates in 2002. Because it is hard to estimate the number of the clients of the electronic department stores, reducing the computation complexity of the electronic department stores becomes an important issue. Due to the need, we propo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Korean Institute of Electromagnetic Engineering and Science

سال: 2009

ISSN: 1226-3133

DOI: 10.5515/kjkiees.2009.20.12.1287