Marzieh Hashemipour-Nazari
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Marzieh Hashemipour-Nazari has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Alexios Balatsoukas-Stimming
Department of Electrical Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands
3 shared publications - Kees Goossens
Department of Electrical Engineering, Eindhoven University of Technology, Eindhoven, MB, The Netherlands
3 shared publications - Andrea Nardi-Dei
Department of Electronic Systems, Eindhoven University of Technology, Eindhoven, AE, The Netherlands
1 shared publication Renate Debets
Eindhoven University of Technology,The Netherlands
1 shared publication- Yuqing Ren
Telecommunications Circuits Laboratory (TCL), cole Polytechnique Fdrale de Lausanne (EPFL), Lausanne, Switzerland
1 shared publication
Latest Publications
- 5 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 72 (8) , 4181-4194
Hardware Implementation of Projection-Aggregation Decoders for Reed-Muller Codes
This paper presents the hardware architecture and implementation of two variants of projection-aggregation-based decoding of Reed-Muller (RM) codes, namely unique projection aggregation (UPA) and collapsed projection aggregation (CPA). Through thorough analysis and experimentation, we observe that the hardware implementation of UPA exhibits superior resource usage and reduced energy consumption compared to CPA for the iterative projection aggregation (IPA) decoder. This finding underscores a critical insight: reducing computational cost, in isolation, may not necessarily translate into hardware cost effectiveness.
- 5 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 72 (8) , 4181-4194
Hardware Implementation of Projection-Aggregation Decoders for Reed-Muller Codes
This paper presents the hardware architecture and implementation of two variants of projection-aggregation-based decoding of Reed-Muller (RM) codes, namely unique projection aggregation (UPA) and collapsed projection aggregation (CPA). Through thorough analysis and experimentation, we observe that the hardware implementation of UPA exhibits superior resource usage and reduced energy consumption compared to CPA for the iterative projection aggregation (IPA) decoder. This finding underscores a critical insight: reducing computational cost, in isolation, may not necessarily translate into hardware cost effectiveness.
- 31 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 70 (12) , 5468-5481
Pipelined Architecture for Soft-Decision Iterative Projection Aggregation Decoding for RM Codes
The recently proposed recursive projection-aggregation (RPA) decoding algorithm for Reed-Muller codes has received significant attention as it provides near-ML decoding performance at reasonable complexity for short codes. However, its complicated structure makes it unsuitable for hardware implementation. Iterative projection-aggregation (IPA) decoding is a modified version of RPA decoding that simplifies the hardware implementation. In this work, we present a flexible hardware architecture for the IPA decoder that can be configured from fully-sequential to fully-parallel, thus making it suitable for a wide range of applications with different constraints and resource budgets. Our simulation and implementation results show that the IPA decoder has $41\%$ lower area consumption, $44\%$ lower latency, four times higher throughput, but currently seven times higher power consumption for a code with block length of $128$ and information length of $29$ compared to a state-of-the-art polar successive cancellation list (SCL) decoder with comparable decoding performance.
- 31 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 70 (12) , 5468-5481
Pipelined Architecture for Soft-Decision Iterative Projection Aggregation Decoding for RM Codes
The recently proposed recursive projection-aggregation (RPA) decoding algorithm for Reed-Muller codes has received significant attention as it provides near-ML decoding performance at reasonable complexity for short codes. However, its complicated structure makes it unsuitable for hardware implementation. Iterative projection-aggregation (IPA) decoding is a modified version of RPA decoding that simplifies the hardware implementation. In this work, we present a flexible hardware architecture for the IPA decoder that can be configured from fully-sequential to fully-parallel, thus making it suitable for a wide range of applications with different constraints and resource budgets. Our simulation and implementation results show that the IPA decoder has $41\%$ lower area consumption, $44\%$ lower latency, four times higher throughput, but currently seven times higher power consumption for a code with block length of $128$ and information length of $29$ compared to a state-of-the-art polar successive cancellation list (SCL) decoder with comparable decoding performance.
- 4 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Recursive/Iterative Unique Projection-Aggregation Decoding of Reed-Muller Codes
We describe recursive unique projection-aggregation (RUPA) decoding and iterative unique projection-aggregation (IUPA) decoding of Reed-Muller (RM) codes, which remove non-unique projections from the recursive projection-aggregation (RPA) and iterative projection-aggregation (IPA) algorithms respectively. We show that these algorithms have competitive error-correcting performance while requiring up to 95% projections lower than the baseline RPA algorithm.
- 4 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Recursive/Iterative Unique Projection-Aggregation Decoding of Reed-Muller Codes
We describe recursive unique projection-aggregation (RUPA) decoding and iterative unique projection-aggregation (IUPA) decoding of Reed-Muller (RM) codes, which remove non-unique projections from the recursive projection-aggregation (RPA) and iterative projection-aggregation (IPA) algorithms respectively. We show that these algorithms have competitive error-correcting performance while requiring up to 95% projections lower than the baseline RPA algorithm.