Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Charles Wagner

dblp:46/6870 · DBLP profile ↗
← Back
11ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 8Graphics, computer vision, multimedia, augmented reality and games · 2Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%
Computer networks
1 paper
Internet of things and sensor networks · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Embedded and real-time systems › wireless communication › wireless sensor networks
wireless sensor node
0.112010
Energy efficient sensor node implementations · FPGA 2010
Internet of things and sensor networks › wireless sensor network › distributed sensing › networked sensing
distributed sensor networks
0.012010
Energy efficient sensor node implementations · FPGA 2010
Embedded and real-time systems › embedded system design
low-power embedded computing
0.012010
Energy efficient sensor node implementations · FPGA 2010

Methods — techniques the papers use, named apart from their topics

FPGA implementation · 0.2DSP processing · 0.2
YearPublicationVenuePosition
2010 Design Methodology for a High Performance Robust DVB-S2 Decoder Implementation
abstract
The new Digital Video Broadcasting Satellite (DVB-S2) standard is able to provide capacity gains of about 30% over the previous standard by using a powerfull Forward Error Correction (FEC) scheme based on very large LDPC code words and BCH codes. The implementation of the DVBS2FEC decoder is a big challenge. The designer must deal with the overall design complexity and the decoding throughput in order to obtain a high decoding performance in terms of bit error rate (BER). We present in detail a complete design flow allowing a better understanding of the algorithm in terms of complexity, performance and its hardware implementation. We focus on complexity-performance trade-offs due to message quantizations and we compare its effects on several algorithm corrections used to check nodes for DVB-S2 decoding. The simulation results show that the best compromise between complexity and performance is obtained for the FOMS algorithm approximation.
Florent Berthelot, François Charot, Charles Wagner, Christophe Wolinski
DSD3
2010 Energy efficient sensor node implementations
abstract
In this paper, we discuss a low power embedded sensor node architecture we are developing for distributed sensor network systems deployed in a natural environment. In particular, we examine the sensor node for energy efficient processing-at-the-sensor. We analyze the following modes of operation; event detection, data acquisition, and data processing using low power, high performance embedded technology such as specialized embedded DSP processors and low power FPGAs at the sensing node. We use compute intensive sensor node applications: an acoustic vehicle classifier (frequency domain analysis) and a video license plate identification application (learning algorithm). We report performance and energy for these applications and discuss the system architecture design trade offs.
Jan R. Frigo, Eric Y. Raby, Sean M. Brennan, Christophe Wolinski, Charles Wagner, François Charot, Edward Rosten, Vinodkrishnan Kulathumani
FPGA5
2006 A Run-Time Re-configurable Parametric Architecture for Local Neighborhood Image Processing
abstract
We propose a run-time re-configurable parametric architecture (fabric) for local neighborhood image processing. The proposed architecture is composed of polymorphous cells where each cell accesses neighborhood data from a local cell memory, and executes a neighborhood function sequentially. The architecture is flexible since different neighborhood functions can be implemented by rewriting a cell's software micro-code. High throughput is achieved because many cells execute concurrently. We show that for a satellite image feature extraction application, our architecture, implemented on Stratix II and Virtex 2 field programmable gate arrays, achieves similar performance, hardware resource utilization, and throughput as a fully pipelined systolic array architecture, yet offers imp roved flexibility to the developer. We compare and contrast these two architectures for their usability to the image processing community
Reid B. Porter, Jan R. Frigo, Maya B. Gokhale, Christophe Wolinski, François Charot, Charles Wagner
DSD6
2006 A Programmable, Maximal Throughput Architecture for Neighborhood Image Processing
abstract
The authors propose a run-time re-configurable architecture for local neighborhood image processing. Discussion of how the new architecture can offer improved flexibility to the developer. The authors show that for a satellite image feature extraction application, our architecture, implemented on Stratix II and Virtex 2 field programmable gate arrays, achieves similar performance, hardware resource utilization, and throughput as fully pipelined systolic array architecture
Reid B. Porter, Jan R. Frigo, Maya B. Gokhale, Christophe Wolinski, François Charot, Charles Wagner
FCCM6
2004 Modeling and Scheduling Parallel Data Flow Systems using Structured Systems of Recurrence Equations
François Charot, Madeleine Nyamsi, Patrice Quinton, Charles Wagner
ASAP4
2003 Efficient Modular-Pipelined AES Implemenation in Counter Mode on ALTERA FPGA
François Charot, Eslam Yahya, Charles Wagner
FPL3
1999 Toward hardware building blocks for software-only real-time video processing: the MOVIE approach
abstract
The goal of the MOVIE very large-scale integration chip is to facilitate the development of software-only solutions for real-time video processing applications. This chip can be seen as a building block for single-instruction, multiple-data processing, and its architecture has been designed so as to facilitate high-level language programming. The basic architecture building block associates a subarray of computation processors with an I/O processor. A module can be seen as a small linear, systolic-like array of processing elements, connected at each end to the I/O processor. The module can communicate with its two nearest neighbors via two communication ports. The chip architecture also includes three 16-bit video ports. One important aspect in the programming environment is the C-stolic programming language. C stolic is a C-like language augmented with parallel constructs, which allow the differentiation between the array controller variables (scalar variables) and the local variables in the array structure (systolic variables). A statement operating on systolic variables implies a simultaneous execution on all the cells of the structure. Implementation examples of MOVIE-based architectures dealing with video compression algorithms are given.
François Charot, Gwendal Le Fol, Pascal Lemonnier, Charles Wagner, Ronan Barzic, Christian Bouville
IEEE Trans. Circuits Syst. Video Technol.4
1995 MOVIE: A Building Block for the Design of Real Time Simulator of Moving Pictures Compression Algorithms
abstract
This paper shows how a real-time simulator of moving pictures compression algorithms can be rapidly assembled using a basic building block, here called MOVIE (MOdule for Video Experimentation). The internal architecture of the MOVIE VLSI chip can be compared to a small systolic machine made of a 32-bit I/O processor, a reduced linear array of 16-bit computation processors and data video input/output mechanisms. Externally, the chip is provided with four 16-bit bidirectional data ports and three 16-bit bidirectional data video port. Several MOVIE chips can be easily clustered to allow the size of the linear array of computation processors to be increased. The MOVIE chip is fully programmable in a high level language in order to make program developments easier.
Ronan Barzic, Christian Bouville, François Charot, Gwendal Le Fol, Pascal Lemonnier, Charles Wagner
ASAP6
1994 From Equations to Hardware. Towards the Systematic Mapping of Algorithms onto Parallel Architectures
abstract
Advances in VLSI technology make it possible to realize systems of very high complexity in a small volume of hardware using integration. In many application fields, it is necessary to implement certain algorithms, or even complete information processing systems, directly in silicon. Application domains which are likely to benefit are in the fields of signal processing and scientific computing. In this paper, we consider several steps which we believe to be essential in the design path of a special purpose architecture, and we present methodologies for achieving design requirements. These solutions are based on experience gathered in the Parallel VLSI Architecture group of IRISA.
Patrice Frison, François Charot, Eric Gautrin, Dominique Lavenier, Patrice Quinton, Frédéric Raimbault, Charles Wagner
Int. J. Pattern Recognit. Artif. Intell.7
1989 Overview of a high-performance programmable pipeline structure
abstract
This paper aims at describing a high-performance programmable pipeline architecture consisting of a linear array of PCS processors. The PCS processor which is capable of performing 20 million floating-point operations per second (20 MFLOPS) has been built from off-the-shelf chips on a wire-wrapped board. The prototype processor is attached to a SUN-3 workstation.Efficient microcode is generated using the microcode compiler that has been designed and implemented. The microcode optimization includes microcode compaction and loop optimization using the software pipelining technique. Another loop optimization technique based on the unrolling is also outlined. Preliminary results obtained on vector benchmarks are given.
François Bodin, François Charot, Charles Wagner
ICS3
1982 Predite, a real time processor for bandwith compression in TV transmission
abstract
This paper describes work carried out at the University of Rennes, France in cooperation with the CCETT in Rennes, to develop an algorithm sophisticated enough to reduce bandwith by more than 50% without loss of image quality and still simple enough to be implemented in real time by a specialized processor using commercially available components. We will give an informal description of the algorithm, developed by messrs. Benveniste, Kretz and Richard, and a more detailed view of the processor.
Finn Jørgensen, G. Michel, Charles Wagner
ICASSP3