Krisztian Flautner
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Krisztian Flautner has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Scott Mahlke
University of Michigan
3 shared publications - Chaitali Chakrabarti
Arizona State University, Tempe, AZ, USA
2 shared publications - Alastair Reid
ARM, UK
1 shared publication - Amir Hormati
Advanced Computer Architecture Laboratory, University of Michigan - Ann Arbor, MI
1 shared publication - David Blaauw
Department of Electrical Engineering and Computer Science, University of Michigan 3 , Ann Arbor, Michigan 48109
1 shared publication David Bull
ARM Inc., Cambridge, UK
1 shared publication
Latest Publications
- 22 February 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Solid-State Circuits
- Vol. 46 (3) , 705
Correction to “A Power-Efficient 32 bit ARM Processor Using Timing-Error Detection and Correction for Transient-Error Tolerance and Adaptation to PVT Variation”
In the above titled paper (ibid., vol. 46, no. 1, pp. 18-31, Jan. 11), Fig. 12 was printed incorrectly. The correct figure is presented here.
- 22 February 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Solid-State Circuits
- Vol. 46 (3) , 705
Correction to “A Power-Efficient 32 bit ARM Processor Using Timing-Error Detection and Correction for Transient-Error Tolerance and Adaptation to PVT Variation”
In the above titled paper (ibid., vol. 46, no. 1, pp. 18-31, Jan. 11), Fig. 12 was printed incorrectly. The correct figure is presented here.
- 17 August 2010
- Published by Springer Nature
- p. 279-292
IP Modeling and Verification
- 15 March 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Micro
- Vol. 30 (1) , 81-91
AnySP: Anytime Anywhere Anyway Signal Processing
Looking forward, the computation requirements of mobile devices will increase by one to two orders of magnitude, but their power requirements will remain stringent to ensure reasonable battery lifetimes. Scaling existing approaches won't suffice; instead, the hardware's inherent computational efficiency, programmability, and adaptability must change. AnySP, a fully programmable architecture that targets multiple application domains, addresses these challenges for next-generation mobile signal processing.
- 15 March 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Micro
- Vol. 30 (1) , 81-91
AnySP: Anytime Anywhere Anyway Signal Processing
Looking forward, the computation requirements of mobile devices will increase by one to two orders of magnitude, but their power requirements will remain stringent to ensure reasonable battery lifetimes. Scaling existing approaches won't suffice; instead, the hardware's inherent computational efficiency, programmability, and adaptability must change. AnySP, a fully programmable architecture that targets multiple application domains, addresses these challenges for next-generation mobile signal processing.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 216-227
Liquid SIMD: Abstracting SIMD Hardware using Lightweight Dynamic Mapping
Microprocessor designers commonly utilize SIMD accelerators and their associated instruction set extensions to provide substantial performance gains at a relatively low cost for media applications. One of the most difficult problems with using SIMD accelerators is forward migration to newer generations. With larger hardware budgets and more demands for performance, SIMD accelerators evolve with both larger data widths and increased functionality with each new generation. However, this causes difficult problems in terms of binary compatibility, software migration costs, and expensive redesign of the instruction set architecture. In this work, we propose Liquid SIMD to decouple the instruction set architecture from the SIMD accelerator. SIMD instructions are expressed using a processor's baseline scalar instruction set, and light-weight dynamic translation maps the representation onto a broad family of SIMD accelerators. Liquid SIMD effectively bypasses the problems inherent to instruction set modification and binary compatibility across accelerator generations. We provide a detailed description of changes to a compilation framework and processor pipeline needed to support this abstraction. Additionally, we show that the hardware overhead of dynamic optimization is modest, hardware changes do not affect cycle time of the processor, and the performance impact of abstracting the SIMD accelerator is negligible. We conclude that using dynamic techniques to map instructions onto SIMD accelerators is an effective way to improve computation efficiency, without the overhead associated with modifying the instruction set
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 216-227
Liquid SIMD: Abstracting SIMD Hardware using Lightweight Dynamic Mapping
Microprocessor designers commonly utilize SIMD accelerators and their associated instruction set extensions to provide substantial performance gains at a relatively low cost for media applications. One of the most difficult problems with using SIMD accelerators is forward migration to newer generations. With larger hardware budgets and more demands for performance, SIMD accelerators evolve with both larger data widths and increased functionality with each new generation. However, this causes difficult problems in terms of binary compatibility, software migration costs, and expensive redesign of the instruction set architecture. In this work, we propose Liquid SIMD to decouple the instruction set architecture from the SIMD accelerator. SIMD instructions are expressed using a processor's baseline scalar instruction set, and light-weight dynamic translation maps the representation onto a broad family of SIMD accelerators. Liquid SIMD effectively bypasses the problems inherent to instruction set modification and binary compatibility across accelerator generations. We provide a detailed description of changes to a compilation framework and processor pipeline needed to support this abstraction. Additionally, we show that the hardware overhead of dynamic optimization is modest, hardware changes do not affect cycle time of the processor, and the performance impact of abstracting the SIMD accelerator is negligible. We conclude that using dynamic techniques to map instructions onto SIMD accelerators is an effective way to improve computation efficiency, without the overhead associated with modifying the instruction set
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2007 IEEE Workshop on Signal Processing Systems
- p. 22-27
Design and Implementation of Turbo Decoders for Software Defined Radio
Software defined radio (SDR) is an emerging paradigm for wireless terminals, in which the physical layer of communication protocols is implemented in software rather than by ASICs. Many of the current and next generation wireless protocols include turbo coding because of its superior performance. However, turbo decoding is computationally intensive, and its low power implementations have typically been in ASICs. This paper presents a case study of algorithm-architecture co-design of turbo decoder for SDR. We present a programmable DSP architecture for SDR that includes a set of architectural features to accelerate turbo decoder computations. We then present a parallel window scheduling for MAX-Log-MAP component decoder that matches well with the DSP architecture. Finally, we present a software implementation of turbo decoder for W-CDMA on the DSP architecture and show that it achieves 2 Mbps decoding throughput
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2007 IEEE Workshop on Signal Processing Systems
- p. 22-27
Design and Implementation of Turbo Decoders for Software Defined Radio
Software defined radio (SDR) is an emerging paradigm for wireless terminals, in which the physical layer of communication protocols is implemented in software rather than by ASICs. Many of the current and next generation wireless protocols include turbo coding because of its superior performance. However, turbo decoding is computationally intensive, and its low power implementations have typically been in ASICs. This paper presents a case study of algorithm-architecture co-design of turbo decoder for SDR. We present a programmable DSP architecture for SDR that includes a set of architectural features to accelerate turbo decoder computations. We then present a parallel window scheduling for MAX-Log-MAP component decoder that matches well with the DSP architecture. Finally, we present a software implementation of turbo decoder for W-CDMA on the DSP architecture and show that it achieves 2 Mbps decoding throughput