1,618 research outputs found

    A VLSI Array Architecture for Realization of DFT, DHT, DCT and DST

    No full text
    A unified array architecture is described for computation of DFT, DHT, DCT and DST using a modified CORDIC (CoOrdinate Rotation DIgital Computer) arithmetic unit as the basic Processing Element (PE). All these four transforms can be computed by simple rearrangement of input samples. Compared to five other existing architectures, this one has the advantage in speed in terms of latency and throughput. Moreover, the simple local neighborhood interprocessor connections make it convenient for VLSI implementation. The architecture can be extended to compute transformation of longer length by judicially cascading the modules of shorter transformation length which will be suitable for Wafer Scale Integration (WSI). CORDIC is designed using Transmission Gate Logic (TGL) on sea of gates semicustom environment. Simulation results show that this architecture may be a suitable candidate for low power/low voltage applications

    Structural FECM:cointegration in large-scale structural FAVAR models

    No full text
    Starting from the dynamic factor model for non-stationary data we derive thefactor-augmented error correction model (FECM) and its moving-average representation.The latter is used for the identication of structural shocks and their propagation mechanisms. We show how to implement classical identication schemes based on long-run restrictions in the case of large panels. The importance of the error-correction mechanism for impulse response analysis is analysed by means of both empirical examples and simulation experiments. Our results show that the bias in estimated impulse responses in a FAVAR model is positively related to the strength of the error-correction mechanism and the cross-section dimension of the panel. We observe empirically in a large panel of US data that these features have a substantial effect on the responses of several variables to the identied permanent real (productivity) and monetary policy shocks

    Dundee Discussion Papers in Economics 129:A markup model for forecasting inflation for the Euro area

    No full text
    In this note we use the methodology of Banerjee, Cockerell and Russell (2001) and Banerjee and Russell (2001) to develop a small model for forecasting inflation for the Euro-area using quarterly data over the period June 1973 to March 2002

    Relational Logic with Framing and Hypotheses

    No full text
    Relational properties arise in many settings: relating two versions of a program that use different data representations, noninterference properties for security, etc. The main ingredient of relational verification, relating aligned pairs of intermediate steps, has been used in numerous guises, but existing relational program logics are narrow in scope. This paper introduces a logic based on novel syntax that weaves together product programs to express alignment of control flow points at which relational formulas are asserted. Correctness judgments feature hypotheses with relational specifications, discharged by a rule for the linking of procedure implementations. The logic supports reasoning about program-pairs containing both similar and dissimilar control and data structures. Reasoning about dynamically allocated objects is supported by a frame rule based on frame conditions amenable to SMT provers. We prove soundness and sketch how the logic can be used for data abstraction, loop optimizations, and secure information flow

    A Stacked Segmented Adaptive Power Amplifier in 22nm FD-SOI

    No full text
    This work was supported by Soitec. (Corresponding author: Aritra Banerjee.

    Forecasting with factor-augmented error correction models

    No full text
    As a generalization of the factor-augmented VAR (FAVAR) and of the Error Correction Model (ECM), Banerjee and Marcellino (2009) introduced the Factor-augmented Error Correction Model (FECM). The FECM combines error-correction, cointegration and dynamic factor models, and has several conceptual advantages over the standard ECM and FAVAR models. In particular, it uses a larger dataset than the ECM and incorporates the long-run information which the FAVAR is missing because of its specification in differences. In this paper, we examine the forecasting performance of the FECM by means of an analytical example, Monte Carlo simulations and several empirical applications. We show that FECM generally offers a higher forecasting precision relative to the FAVAR, and marks a useful step forward for forecasting with large datasets.Published version of EUI RSCAS WP 2009/3

    The Distribution of Public Expenditure in Europe

    No full text
    Defence date: 22 February 2008Examining board: Prof. Anónio Afonso, Technical University of Lisbon ; Prof. Anindya Banerjee, EUI, Supervisor ; Prof. Angel de la Fuente, IAE Universitat Autónoma de Barcelona ; Prof. Rick van der Ploeg, EUIExamining Board: Prof. Anónio Afonso, Technical University of Lisbon ; Prof. Anindya Banerjee, EUI, Supervisor ; Prof. Angel de la Fuente, IAE Universitat Autónoma de Barcelona ; Prof. Rick van der Ploeg, EUINo abstract availableExamining board: Prof. Anónio Afonso, Technical University of Lisbon ; Prof. Anindya Banerjee, EUI, Supervisor ; Prof. Angel de la Fuente, IAE Universitat Autónoma de Barcelona ; Prof. Rick van der Ploeg, EU

    Concurrent Data Structures Linked in Time (Artifact)

    No full text
    This artifact provides the full mechanization in FCSL of the developments in the companion paper, "Concurrent Data Structures Linked in Time". In the latter, we propose a new method, based on a separation-style logic, for reasoning about concurrent objects with such linearization points. We embrace the dynamic nature of linearization points, and encode it as part of the data structure's auxiliary state, so that it can be dynamically modified in place by auxiliary code, as needed when some appropriate run-time event occurs. We illustrate the method by verifying (mechanically in FCSL) an intricate optimal snapshot algorithm due to Jayanti, as well as some clients. FCSL is the first completely formalized framework for mechanized verification of full functional correctness of fine-grained concurrent programs. It is implemented as an embedded domain-specific language (DSL) in the dependently-typed language of the Coq proof assistant, and is powerful enough to reason about programming features such as higher-order functions and local thread spawning. By incorporating a uniform concurrency model, based on state-transition systems and partial commutative monoids, FCSL makes it possible to build proofs about concurrent libraries in a thread-local, compositional way, thus facilitating scalability and reuse: libraries are verified just once, and their specifications are used ubiquitously in client-side reasoning

    03411 Final Report – Language Based Security

    No full text
    This paper summarizes the objectives and structure of a seminar with the same title, held from October 5th to 10th 2003 at Schloss Dagstuhl, Germany
    corecore