Lukasz Lopacinski
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Lukasz Lopacinski has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Goran Panic
IHP – Leibniz Institut für innovative Mikroelektronik
6 shared publications - Alireza Hasani
IHP Leibniz-Institut fr innovative Mikroelektronik,Frankfurt Oder,Germany
5 shared publications - Eckhard Grass
Computer Science Department, Humboldt University of Berlin, Berlin, Germany
5 shared publications Rolf Kraemer
IHP—Leibniz-Institut für Innovative Mikroelektronik, Frankfurt (Oder), Germany
5 shared publications- Mohamed Hussein Eissa
IHP Leibniz-Institut fr innovative Mikroelektronik, Frankfurt (Oder), Germany
3 shared publications - Nebojsa Maletic
IHP-Leibniz-Institut fr innovative Mikroelektronik, Frankfurt (Oder), Germany
3 shared publications
Latest Publications
- Open Access
- 28 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 84672-84684
Optimized HARQ Schemes Employing Multi-Rate Coupled LDPC Codes
This paper presents a hybrid automatic repeat request (HARQ) scheme based on multi-rate coupled low-density parity-check (LDPC) codes, which can be efficiently implemented by existing 5G New Radio (NR) LDPC matrices. The HARQ scheme enables coupling among parity-check matrix blocks with different code rates, making it well-suited for adaptive modulation and coding (AMC) and ultra-reliable low-latency communication (URLLC) applications. To enhance reliability and goodput, the HARQ mechanism can be integrated with incremental redundancy (IR). Simulation results demonstrate that HARQ-IR with multi-rate coupled LDPC codes achieves superior performance, providing up to 10% gains in goodput over conventional HARQ-IR. Additionally, the proposed scheme outperforms single-rate coupled HARQ-IR by an approximately 4% goodput gain, and the optimized multi-rate coupling results in a 0.2 dB reduction in the required signal-to-noise ratio (SNR) at a bit error rate (BER) of 10−7. This approach can be readily extended to support the coupling of different LDPC codes with varying information and codeword lengths. Moreover, the latency, memory usage, and computational complexity are analyzed, showing that multi-rate coupling improves successful decoding and reduces the average age of information (AoI) at high SNR with only a limited increase in complexity.
- 28 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 84672-84684
Open AccessOptimized HARQ Schemes Employing Multi-Rate Coupled LDPC Codes
This paper presents a hybrid automatic repeat request (HARQ) scheme based on multi-rate coupled low-density parity-check (LDPC) codes, which can be efficiently implemented by existing 5G New Radio (NR) LDPC matrices. The HARQ scheme enables coupling among parity-check matrix blocks with different code rates, making it well-suited for adaptive modulation and coding (AMC) and ultra-reliable low-latency communication (URLLC) applications. To enhance reliability and goodput, the HARQ mechanism can be integrated with incremental redundancy (IR). Simulation results demonstrate that HARQ-IR with multi-rate coupled LDPC codes achieves superior performance, providing up to 10% gains in goodput over conventional HARQ-IR. Additionally, the proposed scheme outperforms single-rate coupled HARQ-IR by an approximately 4% goodput gain, and the optimized multi-rate coupling results in a 0.2 dB reduction in the required signal-to-noise ratio (SNR) at a bit error rate (BER) of 10−7. This approach can be readily extended to support the coupling of different LDPC codes with varying information and codeword lengths. Moreover, the latency, memory usage, and computational complexity are analyzed, showing that multi-rate coupling improves successful decoding and reduces the average age of information (AoI) at high SNR with only a limited increase in complexity.
- Open Access
- 20 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Simplified Stage-Combined Belief Propagation Decoding of Polar Codes
Belief Propagation (BP) algorithm is suitable for high-throughput decoding of polar codes due to its inherent parallelism. However, compared with Successive Cancellation (SC)-based decoding methods, BP-based schemes fall behind in terms of Bit-Error Rate (BER) performance. In this paper, a simplified stage-combined BP decoding algorithm is proposed that not only reduces decoding latency, but also improves BER performance. Theoretically, decoding latency can be halved with the proposed method, while the BER performance could be improved by 1 dB in some instances of polar codes. Furthermore, the average number of iterations for achieving a specific BER performance is either reduced or remains the same as the baseline decoding method.
- 20 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessSimplified Stage-Combined Belief Propagation Decoding of Polar Codes
Belief Propagation (BP) algorithm is suitable for high-throughput decoding of polar codes due to its inherent parallelism. However, compared with Successive Cancellation (SC)-based decoding methods, BP-based schemes fall behind in terms of Bit-Error Rate (BER) performance. In this paper, a simplified stage-combined BP decoding algorithm is proposed that not only reduces decoding latency, but also improves BER performance. Theoretically, decoding latency can be halved with the proposed method, while the BER performance could be improved by 1 dB in some instances of polar codes. Furthermore, the average number of iterations for achieving a specific BER performance is either reduced or remains the same as the baseline decoding method.
- 3 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
High-Speed SC Decoder for Polar Codes achieving 1.7 Tb/s in 28 nm CMOS
This paper compares three hardware variants of successive cancelation (SC) decoders for polar codes. The fastest implementation, based on the basic SC, provides decoding throughput up to 1700 Gb/s, when implemented in a 28 nm CMOS technology at the worst-case timing corner. This is the fastest polar decoder published so far, to the best of our knowledge. We also discuss the difficulties of implementing single-parity-check nodes and repetition nodes in fast simplified SC (Fast-SSC) decoding algorithm. These two node types are the primary sources of clock frequency reduction, and special care needs to be taken when these elements are implemented. The Fast-SSC decoder requires ~3 times fewer hardware resources than the base version of SC, but achieves ~10% lower decoding throughput.
- 3 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
High-Speed SC Decoder for Polar Codes achieving 1.7 Tb/s in 28 nm CMOS
This paper compares three hardware variants of successive cancelation (SC) decoders for polar codes. The fastest implementation, based on the basic SC, provides decoding throughput up to 1700 Gb/s, when implemented in a 28 nm CMOS technology at the worst-case timing corner. This is the fastest polar decoder published so far, to the best of our knowledge. We also discuss the difficulties of implementing single-parity-check nodes and repetition nodes in fast simplified SC (Fast-SSC) decoding algorithm. These two node types are the primary sources of clock frequency reduction, and special care needs to be taken when these elements are implemented. The Fast-SSC decoder requires ~3 times fewer hardware resources than the base version of SC, but achieves ~10% lower decoding throughput.
- Open Access
- 14 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 8673-8692
Real-Valued Spreading Sequences for PSSS Based High-Speed Wireless Systems
In past years, Parallel Sequence Spread Spectrum (PSSS) has attracted significant attention as a modulation technique for wireless communication systems targeting data rates of 100 Gb/s and beyond. PSSS allows designing high-speed baseband processors, which can be partially implemented in the analog domain. It uses multiple analog-to-digital converters (ADCs) to sample the received baseband signal in parallel, significantly relaxing the sampling rate and ADC complexity. However, due to the sidelobe effects of bipolar $m$ -sequences, PSSS shows lower performance than standard digital modulation schemes. This paper proposes real-valued PSSS spreading sequences with attenuated autocorrelation sidelobes. Such sequences show excellent bit error rate (BER) performance. Moreover, our sequences do not have length restrictions of 2 m – 1, like in the case of $m$ -sequences, and reduce the chip area required to implement PSSS transceiver. The proposed sequences also reduce the peak-to-average power ratio (PAPR) of PSSS.
- 14 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 8673-8692
Open AccessReal-Valued Spreading Sequences for PSSS Based High-Speed Wireless Systems
In past years, Parallel Sequence Spread Spectrum (PSSS) has attracted significant attention as a modulation technique for wireless communication systems targeting data rates of 100 Gb/s and beyond. PSSS allows designing high-speed baseband processors, which can be partially implemented in the analog domain. It uses multiple analog-to-digital converters (ADCs) to sample the received baseband signal in parallel, significantly relaxing the sampling rate and ADC complexity. However, due to the sidelobe effects of bipolar $m$ -sequences, PSSS shows lower performance than standard digital modulation schemes. This paper proposes real-valued PSSS spreading sequences with attenuated autocorrelation sidelobes. Such sequences show excellent bit error rate (BER) performance. Moreover, our sequences do not have length restrictions of 2 m – 1, like in the case of $m$ -sequences, and reduce the chip area required to implement PSSS transceiver. The proposed sequences also reduce the peak-to-average power ratio (PAPR) of PSSS.
- Open Access
- 7 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 5378-5389
High-Throughput Multi-Frame Decoding of QC-LDPC Codes With Modified Rejection-Based Minimum Finding
The key computation in the min-sum decoding algorithm of a Low-Density Parity-Check (LDPC) is finding the first two minima and also the location of the first minimum among a set of messages passed from Variable Nodes (VNs) to Check Nodes (CNs) in a Tanner graph. In this paper, we propose a modified rejection-based scheme for this task which is able to find the one-hot sequence of the minimum location instead of its index. We show that this modification effectively reduces the complexity of min-sum decoding algorithm. Additionally, we reveal a pipelining potential in such a rejection-based architecture which facilitates the multi-frame decoding of Low-Density Parity-Check (LDPC) codes and therefore results in an improvement in decoding throughput with bearable hardware overhead. Synthesis and floorplanning in an industrial 28 nm CMOS technology show improved results in terms of throughput, power, and chip area.
- 7 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 5378-5389
Open AccessHigh-Throughput Multi-Frame Decoding of QC-LDPC Codes With Modified Rejection-Based Minimum Finding
The key computation in the min-sum decoding algorithm of a Low-Density Parity-Check (LDPC) is finding the first two minima and also the location of the first minimum among a set of messages passed from Variable Nodes (VNs) to Check Nodes (CNs) in a Tanner graph. In this paper, we propose a modified rejection-based scheme for this task which is able to find the one-hot sequence of the minimum location instead of its index. We show that this modification effectively reduces the complexity of min-sum decoding algorithm. Additionally, we reveal a pipelining potential in such a rejection-based architecture which facilitates the multi-frame decoding of Low-Density Parity-Check (LDPC) codes and therefore results in an improvement in decoding throughput with bearable hardware overhead. Synthesis and floorplanning in an industrial 28 nm CMOS technology show improved results in terms of throughput, power, and chip area.
- Open Access
- 27 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
High-Throughput Multi-Frame Decoding of QC-LDPC Codes with Modified Rejection-Based Minimum Finding
The key computation in the min-sum decoding algorithm of a Low-Density Parity-Check (LDPC) code is finding the first two minima and also the location of the first minimum among a set of messages passed from Variable Nodes (VNs) to Check Nodes (CNs) in a Tanner graph. In this paper, we propose a modified rejection-based scheme for this task which is able to find the one-hot sequence of the minimum location instead of its index. We show that this modification effectively reduces the complexity of min-sum decoding algorithm. Additionally, we reveal a pipelining potential in such a rejection- based architecture which facilitates the multi-frame decoding of LDPC codes and therefore results in improvement in decoding throughput with bearable hardware overhead. Synthesis in an industrial 28nm CMOS technology shows improved results in terms of throughput, power, and chip area.
- 27 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in TechRxiv
Open AccessHigh-Throughput Multi-Frame Decoding of QC-LDPC Codes with Modified Rejection-Based Minimum Finding
The key computation in the min-sum decoding algorithm of a Low-Density Parity-Check (LDPC) code is finding the first two minima and also the location of the first minimum among a set of messages passed from Variable Nodes (VNs) to Check Nodes (CNs) in a Tanner graph. In this paper, we propose a modified rejection-based scheme for this task which is able to find the one-hot sequence of the minimum location instead of its index. We show that this modification effectively reduces the complexity of min-sum decoding algorithm. Additionally, we reveal a pipelining potential in such a rejection- based architecture which facilitates the multi-frame decoding of LDPC codes and therefore results in improvement in decoding throughput with bearable hardware overhead. Synthesis in an industrial 28nm CMOS technology shows improved results in terms of throughput, power, and chip area.
- 1 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 102-107
5G and beyond: Multi Baseband PSSS Architecture for 100 Gbps Wireless Communication
In this paper, our concepts for high-speed wireless transceivers that might achieve 100 Gbps in the near future are shown. The targeted carrier frequency is 240 GHz, and the parallel sequence spread spectrum (PSSS) is proposed as a modulation scheme. Although the PSSS is very rarely used for data communication, we show some exciting concepts for the practical realization of high-speed analog PSSS circuits. The PSSS has several advantages when used in high-speed applications. Moreover, we extend the basic PSSS concept by the idea of baseband signals combining. This significantly reduces processing effort and allows to process the baseband signal in parallel. Each baseband processing core can additionally use a parallel bank of AD and DA converters, so that processing of ultra-high-speed signals with relatively large bandwidth is further simplified.
- 1 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 102-107
5G and beyond: Multi Baseband PSSS Architecture for 100 Gbps Wireless Communication
In this paper, our concepts for high-speed wireless transceivers that might achieve 100 Gbps in the near future are shown. The targeted carrier frequency is 240 GHz, and the parallel sequence spread spectrum (PSSS) is proposed as a modulation scheme. Although the PSSS is very rarely used for data communication, we show some exciting concepts for the practical realization of high-speed analog PSSS circuits. The PSSS has several advantages when used in high-speed applications. Moreover, we extend the basic PSSS concept by the idea of baseband signals combining. This significantly reduces processing effort and allows to process the baseband signal in parallel. Each baseband processing core can additionally use a parallel bank of AD and DA converters, so that processing of ultra-high-speed signals with relatively large bandwidth is further simplified.
- 27 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Microwave Theory and Techniques
- Vol. 68 (1) , 239-251
Frequency Interleaving IF Transmitter and Receiver for 240-GHz Communication in SiGe:C BiCMOS
This article presents a fully integrated modular wideband frequency interleaving (FI) transmitter and receiver for high data rate communication applications. At the transmitter side, three independent in-phase and quadrature-phase (IQ) baseband channels are upconverted to different intermediate frequencies (IFs) and then interleaved. At the receiver side, the interleaved signals are downconverted and separated back to each independent channel. Single-ended inputs and outputs are utilized to reduce the pin count, for a more practical realization and higher potential toward future system scaling. Special design techniques are followed to minimize crosstalk and intermodulation products between the channels. All circuits are manufactured and measured in a 130-nm SiGe:C BiCMOS technology with fT,/,fmax,=,300/500 GHz. The FI transmitter achieves a channel bandwidth of 2.5 GHz with less than 3-dB difference across different channels until 15-GHz IF. It consumes 560 mW from 2.5 and 3.3 V supplies and occupies a silicon area of 1.9 mm². The FI receiver achieves a baseband channel bandwidth of 2.5 GHz with a 1-dB difference between the channels until the same IF. It consumes 860 mW from 2.5 and 3.3 V supplies and has a chip area of 1.55 mm². The circuits are deployed in a communication experiment; first, in a back-to-back test with a direct cable connection, demonstrating a data rate of 15.6 Gb/s across the three IQ channels with a 16-QAM modulation scheme and a worst case transmitter-to-receiver error vector magnitude (EVM) of -18.6 dB. Then, a wireless experiment is performed with a 240-GHz front end with on-chip antenna, demonstrating a data rate of 7.8 Gb/s with QPSK modulation and a worst case EVM of -8.3 dB, across a wireless link of 15 cm. To the best of our knowledge, this is the first article that demonstrates a wireless transmission at sub-terahertz (sub-THz) carrier frequencies utilizing FI architectures.
- 27 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Microwave Theory and Techniques
- Vol. 68 (1) , 239-251
Frequency Interleaving IF Transmitter and Receiver for 240-GHz Communication in SiGe:C BiCMOS
This article presents a fully integrated modular wideband frequency interleaving (FI) transmitter and receiver for high data rate communication applications. At the transmitter side, three independent in-phase and quadrature-phase (IQ) baseband channels are upconverted to different intermediate frequencies (IFs) and then interleaved. At the receiver side, the interleaved signals are downconverted and separated back to each independent channel. Single-ended inputs and outputs are utilized to reduce the pin count, for a more practical realization and higher potential toward future system scaling. Special design techniques are followed to minimize crosstalk and intermodulation products between the channels. All circuits are manufactured and measured in a 130-nm SiGe:C BiCMOS technology with fT,/,fmax,=,300/500 GHz. The FI transmitter achieves a channel bandwidth of 2.5 GHz with less than 3-dB difference across different channels until 15-GHz IF. It consumes 560 mW from 2.5 and 3.3 V supplies and occupies a silicon area of 1.9 mm². The FI receiver achieves a baseband channel bandwidth of 2.5 GHz with a 1-dB difference between the channels until the same IF. It consumes 860 mW from 2.5 and 3.3 V supplies and has a chip area of 1.55 mm². The circuits are deployed in a communication experiment; first, in a back-to-back test with a direct cable connection, demonstrating a data rate of 15.6 Gb/s across the three IQ channels with a 16-QAM modulation scheme and a worst case transmitter-to-receiver error vector magnitude (EVM) of -18.6 dB. Then, a wireless experiment is performed with a 240-GHz front end with on-chip antenna, demonstrating a data rate of 7.8 Gb/s with QPSK modulation and a worst case EVM of -8.3 dB, across a wireless link of 15 cm. To the best of our knowledge, this is the first article that demonstrates a wireless transmission at sub-terahertz (sub-THz) carrier frequencies utilizing FI architectures.
- Open Access
- 11 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 44489-44502
Data Link Layer Processor for 100 Gbps Terahertz Wireless Communications in 28 nm CMOS Technology
In this paper, we show our 165 Gbps data link layer processor for wireless communication in the terahertz band. The design utilizes interleaved Reed-Solomon codes with dedicated link adaptation, fragmentation, aggregation, and hybrid-automatic-repeat-request. The main advantage is the low-chip area required to fabricate the processor, which is at least two times lower than the area of low-density parity-check decoders. Surprisingly, our solution loses only ~1 dB gain when compared to high-speed low-density parity-check decoders. Moreover, with only 2.38 pJ/bit of energy consumption at 0.8 V, one of the best results in the class of comparable implementations has been achieved. Alongside, we show our vision of a complete 100 Gbps wireless transceiver, including radio frequency frontend and baseband processing. For the baseband realization, we propose a parallel sequence spread spectrum and channel combining at the baseband level. Challenges to high-speed wireless transmission at the terahertz band are addressed as well. To the authors’ best knowledge, it is one of the first data link layer implementations that deal with a data rate of ≥ 100 Gbps.
- 11 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 44489-44502
Open AccessData Link Layer Processor for 100 Gbps Terahertz Wireless Communications in 28 nm CMOS Technology
In this paper, we show our 165 Gbps data link layer processor for wireless communication in the terahertz band. The design utilizes interleaved Reed-Solomon codes with dedicated link adaptation, fragmentation, aggregation, and hybrid-automatic-repeat-request. The main advantage is the low-chip area required to fabricate the processor, which is at least two times lower than the area of low-density parity-check decoders. Surprisingly, our solution loses only ~1 dB gain when compared to high-speed low-density parity-check decoders. Moreover, with only 2.38 pJ/bit of energy consumption at 0.8 V, one of the best results in the class of comparable implementations has been achieved. Alongside, we show our vision of a complete 100 Gbps wireless transceiver, including radio frequency frontend and baseband processing. For the baseband realization, we propose a parallel sequence spread spectrum and channel combining at the baseband level. Challenges to high-speed wireless transmission at the terahertz band are addressed as well. To the authors’ best knowledge, it is one of the first data link layer implementations that deal with a data rate of ≥ 100 Gbps.