Kira Kraft

Kira Kraft

Auto-generated profile, based on publicly available information

Kira Kraft

Microelectronic Systems Design Research Group, University of Kaiserslautern-Landau, Kaiserslautern, Germany

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 March 2020 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
FGFlorian Gensheimer
Florian Gensheimer
TDTobias Dietz
Tobias Dietz
KKKira Kraft
Kira Kraft
SRStefan Ruzika
Stefan Ruzika
NWNorbert Wehn
Norbert Wehn
The alternating direction method of multipliers has recently been adapted for linear programming decoding of lowdensity parity-check codes. The computation of the projection onto the parity polytope is the core of this algorithm and usually involves a sorting operation, which is the main effort of the projection. In this paper, we present an algorithm with low complexity to compute this projection. The algorithm relies on new findings in the recursive structure of the parity polytope and iteratively fixes selected components. As shown in our realistic simulation setup, it requires up to 37% less arithmetical operations compared with state-of-the-art projections. Additionally, it does not involve a sorting operation, which is needed in all exact state-of-the-art projection algorithms. These two benefits make it appealing for efficient hardware and software implementations.

1 March 2020
Verified
Conference Paper
Closed access
JFJohannes Feldmann
Johannes Feldmann
KKKira Kraft
Kira Kraft
LSLukas Steiner
Lukas Steiner
NWNorbert Wehn
Norbert Wehn
MJMatthias Jung
Matthias Jung

1 December 2018
Verified
Conference Paper
Closed access
FGFlorian Gensheimer
Florian Gensheimer
TDTobias Dietz
Tobias Dietz
SRStefan Ruzika
Stefan Ruzika
KKKira Kraft
Kira Kraft
NWNorbert Wehn
Norbert Wehn
In this paper, we present a new low-complexity algorithm for computing the projection onto the parity polytope in the context of ADMM-based LP decoding. This projection is the heart of the ADMM algorithm, that usually involves a sorting operation, which is the main effort of the projection. Our proposed algorithm relies on new findings in the recursive structure of the parity polytope and works by fixing selected components in an iterative manner. The absence of the sorting operation makes it preferable for efficient hard- and software implementations. In addition, we can show that this new projection algorithm requires up to 37% less arithmetic operations compared to state-of-the-art projections.

28 April 2025 in International Journal of Parallel Programming
Verified
Journal Article
Open access
PDF file
LSLukas Steiner
Lukas Steiner
KKKira Kraft
Kira Kraft
DCDerek Christ
Derek Christ
DUDenis Uecker
Denis Uecker
CMChristian Malek
Christian Malek
NWNorbert Wehn
Norbert Wehn
The development of safe hardware is currently a major concern in the automotive industry. Due to the high computational and memory requirements of advanced driver-assistance systems and autonomous driving, consumer hardware such as LPDDR DRAM is being deployed in safety-critical areas. Parts 5 and 11 of ISO 26262 define procedures and methods for the development of hardware to achieve a specific Automotive Safety Integrity Level (ASIL). However, consumer devices like LPDDR DRAMs were not originally intended for use in these applications, so they only achieve low ASILs. Additional safety measures can still be added at system level, but this often comes at the cost of reduced performance. In this paper, we present a novel methodology that combines the hardware metrics analysis of ISO 26262 with SystemC-based virtual prototyping. This enables the analysis of a system both from the safety as well as from the performance perspective using the same simulation setup. To show the applicability of this methodology, we model an LPDDR5 memory subsystem of a current state-of-the-art ADAS platform and evaluate both the ASIL as well as the performance impact of the safety measures. The new methodology is fully implemented in SystemC and provided as open-source.

28 May 2025 in International Journal of Parallel Programming
Verified
Journal Article
Open access
PDF file
LSLukas Steiner
Lukas Steiner
KKKira Kraft
Kira Kraft
DCDerek Christ
Derek Christ
DUDenis Uecker
Denis Uecker
CMChristian Malek
Christian Malek
NWNorbert Wehn
Norbert Wehn