Institution
École nationale supérieure de l'électronique et de ses applications
Education•Cergy, France•
About: École nationale supérieure de l'électronique et de ses applications is a education organization based out in Cergy, France. It is known for research contribution in the topics: Low-density parity-check code & Decoding methods. The organization has 519 authors who have published 1068 publications receiving 15035 citations. The organization is also known as: ENSEA.
Topics: Low-density parity-check code, Decoding methods, Observer (quantum physics), Nonlinear system, Block code
Papers published on a yearly basis
Papers
More filters
•
29 Jan 2002TL;DR: An overview of classical sliding mode control differential inclusions and sliding modeControl high-order sliding modes sliding mode observers dynamic sliding mode Control and output feedback sliding modes, passivity, andflatness stability and stabilization discretization issues.
Abstract: 1. Introduction: An Overview of Classical Sliding Mode Control 2. Differential Inclusions and Sliding Mode Control 3. Higher-Order Sliding Modes 4. Sliding Mode Observers 5. Dynamic Sliding Mode Control and Output Feedback 6. Sliding Modes, Passivity, and Flatness 7. Stability and Stabilization 8. Discretization Issues 9. Adaptive and Sliding Mode Control 10. Steady Modes in Relay Systems with Delay 11. Sliding Mode Control for Systems with Time Delay 12. Sliding Mode Control of Infinite-Dimensional Systems 13. Application of Sliding Mode Control to Robotic Systems 14. Sliding Modes Control of the Induction Motor: A Benchmark Experimental Test
1,079 citations
••
TL;DR: This letter addresses the problem of decoding nonbinary low-density parity-check (LDPC) codes over finite fields GF(q), with reasonable complexity and good performance, and introduces a simplified decoder which is inspired by the min-sum decoder for binary LDPC codes.
Abstract: In this letter, we address the problem of decoding nonbinary low-density parity-check (LDPC) codes over finite fields GF(q), with reasonable complexity and good performance. In the first part of the letter, we recall the original belief propagation (BP) decoding algorithm and its Fourier domain implementation. We show that the use of tensor notations for the messages is very convenient for the algorithm description and understanding. In the second part of the letter, we introduce a simplified decoder which is inspired by the min-sum decoder for binary LDPC codes. We called this decoder extended min-sum (EMS). We show that it is possible to greatly reduce the computational complexity of the check-node processing by computing approximate reliability measures with a limited number of values in a message. By choosing appropriate correction factors or offsets, we show that the EMS decoder performance is quite good, and in some cases better than the regular BP decoder. The optimal values of the factor and offset correction are obtained asymptotically with simulated density evolution. Our simulations on ultra-sparse codes over very-high-order fields show that nonbinary LDPC codes are promising for applications which require low frame-error rates for small or moderate codeword lengths. The EMS decoder is a good candidate for practical hardware implementations of such codes
741 citations
••
01 Mar 2014
TL;DR: A new embeddable method for polyp detection in wireless capsule endoscopic images was developed and tested using boosting based approach that achieved good classification performance and can be implemented in situ with embedded hardware.
Abstract: Purpose
Wireless capsule endoscopy (WCE) is commonly used for noninvasive gastrointestinal tract evaluation, including the detection of mucosal polyps. A new embeddable method for polyp detection in wireless capsule endoscopic images was developed and tested.
491 citations
••
Autonomous University of Barcelona1, Arizona State University2, University of Central Lancashire3, The Chinese University of Hong Kong4, École nationale supérieure de l'électronique et de ses applications5, Oslo University Hospital6, Simula Research Laboratory7, Seoul National University8, University of Nice Sophia Antipolis9, German Cancer Research Center10, Karlsruhe Institute of Technology11, University College London12, University of Barcelona13, Mayo Clinic14
TL;DR: Results show that convolutional neural networks are the state of the art in polyp detection and it is also demonstrated that combining different methodologies can lead to an improved overall performance.
Abstract: Colonoscopy is the gold standard for colon cancer screening though some polyps are still missed, thus preventing early disease detection and treatment. Several computational systems have been proposed to assist polyp detection during colonoscopy but so far without consistent evaluation. The lack of publicly available annotated databases has made it difficult to compare methods and to assess if they achieve performance levels acceptable for clinical use. The Automatic Polyp Detection sub-challenge, conducted as part of the Endoscopic Vision Challenge ( http://endovis.grand-challenge.org ) at the international conference on Medical Image Computing and Computer Assisted Intervention (MICCAI) in 2015, was an effort to address this need. In this paper, we report the results of this comparative evaluation of polyp detection methods, as well as describe additional experiments to further explore differences between methods. We define performance metrics and provide evaluation databases that allow comparison of multiple methodologies. Results show that convolutional neural networks are the state of the art. Nevertheless, it is also demonstrated that combining different methodologies can lead to an improved overall performance.
331 citations
••
TL;DR: In this paper, a method to design regular (2, dc)- LDPC codes over GF(q) with both good waterfall and error floor properties is presented, based on the algebraic properties of their binary image.
Abstract: In this paper, a method to design regular (2, dc)- LDPC codes over GF(q) with both good waterfall and error floor properties is presented, based on the algebraic properties of their binary image. First, the algebraic properties of rows of the parity check matrix H associated with a code are characterized and optimized to improve the waterfall. Then the algebraic properties of cycles and stopping sets associated with the underlying Tanner graph are studied and linked to the global binary minimum distance of the code. Finally, simulations are presented to illustrate the excellent performance of the designed codes.
305 citations
Authors
Showing all 522 results
Name | H-index | Papers | Citations |
---|---|---|---|
Arnaud Doucet | 75 | 386 | 43388 |
Grégoire Malandain | 52 | 222 | 10396 |
Lieven De Lathauwer | 49 | 240 | 14266 |
Matthieu Cord | 46 | 265 | 7387 |
Marc P. C. Fossorier | 39 | 200 | 10546 |
Vassilis Christophides | 37 | 149 | 5215 |
Ricardo da Silva Torres | 34 | 298 | 4280 |
Dominique Laurent | 32 | 181 | 3120 |
David Declercq | 32 | 250 | 4673 |
Eric Monmasson | 31 | 234 | 5090 |
Thierry Floquet | 30 | 129 | 3922 |
Xavier Dray | 30 | 185 | 3413 |
Philippe Gaussier | 26 | 218 | 2823 |
Mohamed Djemai | 24 | 208 | 2635 |
Jean-Pierre Barbot | 24 | 125 | 1871 |