LEAST MEAN SQUARED BACKGROUND CALIBRATION FOR OFDM MULTICHANNEL RECEIVERS

2012 ◽  
Vol 21 (01) ◽  
pp. 1250014
Author(s):  
KRISHNA PENTAKOTA ◽  
MARIO A. RAMIREZ ◽  
SEBASTIAN HOYOS
Keyword(s):  
Filter Banks ◽  
Complexity Analysis ◽  
Wide Band ◽  
Lms Algorithm ◽  
First Order ◽  
Calibration Algorithm ◽  
Estimation Scheme ◽  
Lower Complexity ◽  
Charge Sampling ◽  
Data Estimation

This paper presents a data estimation scheme for wide band multichannel charge sampling filter bank receivers together with a complete system calibration algorithm based on the least mean squared (LMS) algorithm. A unified model has been defined for the receiver containing all first order mismatches, offsets, imperfections, and the LMS algorithm is employed to track these errors. The performance of this technique under noisy channel conditions has been verified. Moreover, a detailed complexity analysis of the calibration algorithm is provided which shows that sinc filter banks have much lower complexity than traditional continuous-time filter banks.

scholarly journals A new calibration algorithm of wide-band polarimetric measurement system

1991 ◽  
Vol 39 (8) ◽  
pp. 1188-1192 ◽  
Author(s):  
T.-J. Chen ◽  
T.-H. Chu ◽  
F.-C. Chen
Keyword(s):  
Measurement System ◽  
Wide Band ◽  
Calibration Algorithm

Automated complexity analysis of Nuprl extracted programs

2001 ◽  
Vol 11 (1) ◽  
pp. 3-31 ◽  
Author(s):  
RALPH BENZINGER
Keyword(s):  
Abstract Interpretation ◽  
Complexity Analysis ◽  
Cost Model ◽  
Functional Program ◽  
First Order ◽  
Value Evaluation ◽  
Recursive Programs ◽  
Symbolic Evaluation ◽  
Primitive Recursive ◽  
Higher Order Functions

This paper describes the Automated Complexity Analysis Prototype (ACAp) system for automated complexity analysis of functional programs synthesized with the Nuprl proof development system. We define a simple abstract cost model for NUPRL's term language based on the current call-by-name evaluator. The framework uses abstract functions and abstract lists to facilitate reasoning about primitive recursive programs with first-order functions, lazy lists and a subclass of higher-order functions. The ACAp system automatically derives upper bounds on the time complexity of NUPRL extracts relative to a given profiling semantics. Analysis proceeds by abstract interpretation of the extract, where symbolic evaluation rules extend standard evaluation to terms with free variables. Symbolic evaluation of recursive programs generates systems of multi-variable difference equations, which are solved using the MATHEMATICA computer algebra system. The use of the system is exemplified by analyzing a proof extract that computes the maximum segment sum of a list and a functional program that determines the minimum of a list via sorting. For both results, we compare call-by-name to call-by-value evaluation.

Sign in / Sign up

Export Citation Format

Share Document