Viktor Öwall
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Viktor Öwall has a total of 46 co-authors. Here are the top co-authors by number of shared publications:
John B. Anderson
Lund University
8 shared publications- Liang Liu
Department of Electrical and Information Technology, Lund University, Lund, Sweden
7 shared publications - Deepak Dasalukunte
Intel Labs, Intel Corporation, Hillsboro, OR, USA
6 shared publications - Fredrik Rusek
Department of Electrical and Information Technology Lund University Lund Sweden
6 shared publications - Ove Edfors
Department of Electrical and Information Technology, Lund University, Lund, Sweden
6 shared publications Chenxin Zhang
3 shared publications
Latest Publications
- Open Access
The Effect of Coupling Memory and Block Length on Spatially Coupled Serially Concatenated Codes
Spatially coupled serially concatenated codes (SC-SCCs) are a class of spatially coupled turbo-like codes, which have a close-to-capacity performance and low error floor. In this paper we investigate the impact of coupling memory, block length, decoding window size, and number of iterations on the performance, complexity, and latency of SC-SCCs. Several design tradeoffs are presented to see the relation between these parameters in a wide range. Also, our analysis provides design guidelines for SC-SCCs in different scenarios to make the code design independent of block length. As a result, block length and coupling memory can be exchanged flexibly without changing the latency and complexity. Also, we observe that the performance of SC-SCCs is improved with respect to the uncoupled ensembles for a fixed latency and complexity.
Open AccessThe Effect of Coupling Memory and Block Length on Spatially Coupled Serially Concatenated Codes
Spatially coupled serially concatenated codes (SC-SCCs) are a class of spatially coupled turbo-like codes, which have a close-to-capacity performance and low error floor. In this paper we investigate the impact of coupling memory, block length, decoding window size, and number of iterations on the performance, complexity, and latency of SC-SCCs. Several design tradeoffs are presented to see the relation between these parameters in a wide range. Also, our analysis provides design guidelines for SC-SCCs in different scenarios to make the code design independent of block length. As a result, block length and coupling memory can be exchanged flexibly without changing the latency and complexity. Also, we observe that the performance of SC-SCCs is improved with respect to the uncoupled ensembles for a fixed latency and complexity.
- 31 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 67 (6) , 1948-1961
Angular-Domain Massive MIMO Detection: Algorithm, Implementation, and Design Tradeoffs
In massive multiple-input multiple-output (MIMO) systems, the large size of channel state information (CSI) matrix significantly increases the computational complexity of uplink detection and size of required memory to store the channel data. To address these challenges, we propose to perform detection in the angular domain, where the channel information can be presented in a more condensed way. The underlying idea is to exploit the sparsity of massive MIMO channel in the angular domain to reduce the size of CSI matrix by selecting dominant beams. Then, an angular-domain linear detector followed by a non-linear post-processing scheme is proposed to perform detection using the reduced-size CSI. Evaluated using measured massive MIMO channels, our method results in 35%-73% reduction in complexity and required memory compared to traditional detectors while it achieves better performance. Moreover, this paper provides a framework, which trades between performance, complexity, and size of required memory. As a proof of concept, we implement the angular-domain detector in a 28 nm FD-SOI CMOS for a massive MIMO with 128 antennas communicating with up to 16 users. Synthesis result shows that our design attains a throughput of 2240 Mbps with an area of 829 k gates.
- 31 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 67 (6) , 1948-1961
Angular-Domain Massive MIMO Detection: Algorithm, Implementation, and Design Tradeoffs
In massive multiple-input multiple-output (MIMO) systems, the large size of channel state information (CSI) matrix significantly increases the computational complexity of uplink detection and size of required memory to store the channel data. To address these challenges, we propose to perform detection in the angular domain, where the channel information can be presented in a more condensed way. The underlying idea is to exploit the sparsity of massive MIMO channel in the angular domain to reduce the size of CSI matrix by selecting dominant beams. Then, an angular-domain linear detector followed by a non-linear post-processing scheme is proposed to perform detection using the reduced-size CSI. Evaluated using measured massive MIMO channels, our method results in 35%-73% reduction in complexity and required memory compared to traditional detectors while it achieves better performance. Moreover, this paper provides a framework, which trades between performance, complexity, and size of required memory. As a proof of concept, we implement the angular-domain detector in a 28 nm FD-SOI CMOS for a massive MIMO with 128 antennas communicating with up to 16 users. Synthesis result shows that our design attains a throughput of 2240 Mbps with an area of 829 k gates.
- 27 February 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 66 (7) , 2763-2774
A Low Latency FFT/IFFT Architecture for Massive MIMO Systems Utilizing OFDM Guard Bands
A considerable part of latency in the baseband of massive multiple-input multiple-output (MIMO) systems is introduced by orthogonal frequency division multiplexing (OFDM) (de)modulation. To address the low-latency demand of massive MIMO systems, a fast Fourier transform (FFT) processor and corresponding reordering scheme are proposed, which reduce the processing latency and reordering latency of OFDM-based systems, respectively. The main idea is to utilize the OFDM guard bands to decrease the number of required computations and thus the processing time. In case of a 2048-point IFFT, the proposed scheme leads to 42% reduction in latency compared to the reported pipelined schemes at the cost of 4% additional memory, which is around 2.4% of the total chip area. To realize this idea, a modified pipelined architecture with a reorganized memory structure and also an efficient data scheduling mechanism for memories and butterflies are developed. Using the proposed scheme, a 2048-point FFT/IFFT processor has been implemented in a 28-nm complementary metal-oxide-semiconductor technology. The post-layout simulations show that our design achieves a throughput of 0.6 GS/s and 1200 clock cycles latency, the lowest latency reported to-date for single-input pipelined FFT/IFFT architectures.
- 27 February 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 66 (7) , 2763-2774
A Low Latency FFT/IFFT Architecture for Massive MIMO Systems Utilizing OFDM Guard Bands
A considerable part of latency in the baseband of massive multiple-input multiple-output (MIMO) systems is introduced by orthogonal frequency division multiplexing (OFDM) (de)modulation. To address the low-latency demand of massive MIMO systems, a fast Fourier transform (FFT) processor and corresponding reordering scheme are proposed, which reduce the processing latency and reordering latency of OFDM-based systems, respectively. The main idea is to utilize the OFDM guard bands to decrease the number of required computations and thus the processing time. In case of a 2048-point IFFT, the proposed scheme leads to 42% reduction in latency compared to the reported pipelined schemes at the cost of 4% additional memory, which is around 2.4% of the total chip area. To realize this idea, a modified pipelined architecture with a reorganized memory structure and also an efficient data scheduling mechanism for memories and butterflies are developed. Using the proposed scheme, a 2048-point FFT/IFFT processor has been implemented in a 28-nm complementary metal-oxide-semiconductor technology. The post-layout simulations show that our design achieves a throughput of 0.6 GS/s and 1200 clock cycles latency, the lowest latency reported to-date for single-input pipelined FFT/IFFT architectures.
- 24 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 66 (1) , 417-427
An Area-Efficient On-Chip Memory System for Massive MIMO Using Channel Data Compression
Massive multiple-input-multiple-output has proven to deliver improvements in both spectral and transmitted energy efficiency. However, these improvements come at the cost of critical design challenges for the hardware implementation due to the huge amount of data that has to be processed immediately, especially the storage of large channel state information (CSI) matrices. This paper presents an on-chip memory system equipped with CSI which provides high area efficiency, while supporting flexible accesses and high bandwidths. Optimization across system-algorithm-hardware is used to develop hardware-friendly compression algorithms exploring propagation characteristics and large antenna-array features. More specifically, group-based and spatial-angular transform algorithms are implemented in a heterogeneous memory system, which consists of an unified memory for storing compressed CSI and a parallel memory for flexible access. Up to 75% memory can be saved for a 128-antenna system, at a less than 0.8dB performance loss. Implemented in ST 28nm FD-SOI technology, the capacity of designed system is 1.06Mb, which is equivalent to 4Mb uncompressed memory and can store 100 128 × 10 channel matrices. The area is 0.47 mm 2 , demonstrating a 58% reduction compared with a memory system without CSI compression. With a supply voltage of 1.0V, the memory system can run at 833 MHz, providing a 833Gb/s access bandwidth.
- 24 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 66 (1) , 417-427
An Area-Efficient On-Chip Memory System for Massive MIMO Using Channel Data Compression
Massive multiple-input-multiple-output has proven to deliver improvements in both spectral and transmitted energy efficiency. However, these improvements come at the cost of critical design challenges for the hardware implementation due to the huge amount of data that has to be processed immediately, especially the storage of large channel state information (CSI) matrices. This paper presents an on-chip memory system equipped with CSI which provides high area efficiency, while supporting flexible accesses and high bandwidths. Optimization across system-algorithm-hardware is used to develop hardware-friendly compression algorithms exploring propagation characteristics and large antenna-array features. More specifically, group-based and spatial-angular transform algorithms are implemented in a heterogeneous memory system, which consists of an unified memory for storing compressed CSI and a parallel memory for flexible access. Up to 75% memory can be saved for a 128-antenna system, at a less than 0.8dB performance loss. Implemented in ST 28nm FD-SOI technology, the capacity of designed system is 1.06Mb, which is equivalent to 4Mb uncompressed memory and can store 100 128 × 10 channel matrices. The area is 0.47 mm 2 , demonstrating a 58% reduction compared with a memory system without CSI compression. With a supply voltage of 1.0V, the memory system can run at 833 MHz, providing a 833Gb/s access bandwidth.
- 1 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 224-226
A 1.8Gb/s 70.6pJ/b 128×16 link-adaptive near-optimal massive MIMO detector in 28nm UTBB-FDSOI
This work presents a 2.0mm 2 128×16 massive MIMO detector IC that provides 21dB array gain and 16x multiplexing gain at the system level. The detector implements iterative expectation-propagation detection (EPD) for up to 256-QAM modulation. Tested with measured channel data [1], the detector achieves 4.3dB processing gain over state-of-the-art massive MlMo detectors [2, 3], enabling 2.7x reduction in transmit power for battery-powered mobile terminals. The iC uses link-adaptive processing to meet a variety of practical channel conditions with scalable energy consumption. The design is realized in a condensed systolic array architecture and an approximate moment-matching circuitry to reach 1.8Gb/s at 70.6pJ/b. The performance and energy efficiency can be tuned over a wide range by UTBB-FDSOI body bias.
- 1 February 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 224-226
A 1.8Gb/s 70.6pJ/b 128×16 link-adaptive near-optimal massive MIMO detector in 28nm UTBB-FDSOI
This work presents a 2.0mm 2 128×16 massive MIMO detector IC that provides 21dB array gain and 16x multiplexing gain at the system level. The detector implements iterative expectation-propagation detection (EPD) for up to 256-QAM modulation. Tested with measured channel data [1], the detector achieves 4.3dB processing gain over state-of-the-art massive MlMo detectors [2, 3], enabling 2.7x reduction in transmit power for battery-powered mobile terminals. The iC uses link-adaptive processing to meet a variety of practical channel conditions with scalable energy consumption. The design is realized in a condensed systolic array architecture and an approximate moment-matching circuitry to reach 1.8Gb/s at 70.6pJ/b. The performance and energy efficiency can be tuned over a wide range by UTBB-FDSOI body bias.
- 8 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 25 (10) , 2976-2980
Architecture Design of a Memory Subsystem for Massive MIMO Baseband Processing
This brief presents an on-chip memory subsystem for massive multiple-input-multiple-output (MIMO) baseband processing at the base station. In massive MIMO systems, the required memory bandwidth and capacity are orders of magnitude higher than those used in conventional wireless systems, due to the large number of serving antennas. These are further combined with design targets on low access latency and flexibility in data organization and access modes. This brief applies and improves the concept of parallel memories to achieve the challenging design target with low hardware overhead. As a case study, a memory subsystem for 128-antenna and 16-user massive MIMO systems is evaluated using ST 28-nm technology. According to postlayout simulation results, the proposed memory subsystem provides 512-Gb/s throughput and offers 1-Mb capacity with a cost of 0.30 mm 2 .
- 8 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 25 (10) , 2976-2980
Architecture Design of a Memory Subsystem for Massive MIMO Baseband Processing
This brief presents an on-chip memory subsystem for massive multiple-input-multiple-output (MIMO) baseband processing at the base station. In massive MIMO systems, the required memory bandwidth and capacity are orders of magnitude higher than those used in conventional wireless systems, due to the large number of serving antennas. These are further combined with design targets on low access latency and flexibility in data organization and access modes. This brief applies and improves the concept of parallel memories to achieve the challenging design target with low hardware overhead. As a case study, a memory subsystem for 128-antenna and 16-user massive MIMO systems is evaluated using ST 28-nm technology. According to postlayout simulation results, the proposed memory subsystem provides 512-Gb/s throughput and offers 1-Mb capacity with a cost of 0.30 mm 2 .
- 1 January 2016
- Published by Springer Nature
Heterogeneous Reconfigurable Processors for Real-Time Baseband Processing
- 1 January 2016
- Published by Springer Nature
Heterogeneous Reconfigurable Processors for Real-Time Baseband Processing
- 1 November 2015
- Published by Elsevier in Microprocessors and Microsystems
- Vol. 39 (8) , 889-900
A new digital front-end for flexible reception in software defined radio
- 1 November 2015
- Published by Elsevier in Microprocessors and Microsystems
- Vol. 39 (8) , 889-900
A new digital front-end for flexible reception in software defined radio
- 1 April 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 62 (5) , 1220-1229
Energy Efficient Group-Sort QRD Processor With On-Line Update for MIMO Channel Pre-Processing
This paper presents a Sorted QR-Decomposition (SQRD) processor for 3GPP LTE-A system. It achieves energy-efficiency by co-optimizing techniques, such as heterogeneous processing, reconfigurable architecture, and dual-supply voltage operation. At algorithm level, a low-complexity hybrid decomposition scheme is adopted, which switches, depending on the energy distribution of spatial channels, between the traditional brute-force SQRD and a proposed group-sort QR-update strategy. A reconfigurable vector processor is accordingly developed to support the adaptive processing with high hardware efficiency. Furthermore, on-chip power management technique is also integrated to obtain real-time power-saving by adapting the voltage supply based on the instantaneous workload. As a proof-of-concept, we implemented the processor using a 65 nm CMOS technology and conducted post-layout simulation. The proposed SQRD processor occupies 0.71 mm 2 core area and has a throughput of up to 69 MQRD/s. Compared to the brute-force approach, an energy reduction of 10 ~ 61.8% is achieved.
- 1 April 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 62 (5) , 1220-1229
Energy Efficient Group-Sort QRD Processor With On-Line Update for MIMO Channel Pre-Processing
This paper presents a Sorted QR-Decomposition (SQRD) processor for 3GPP LTE-A system. It achieves energy-efficiency by co-optimizing techniques, such as heterogeneous processing, reconfigurable architecture, and dual-supply voltage operation. At algorithm level, a low-complexity hybrid decomposition scheme is adopted, which switches, depending on the energy distribution of spatial channels, between the traditional brute-force SQRD and a proposed group-sort QR-update strategy. A reconfigurable vector processor is accordingly developed to support the adaptive processing with high hardware efficiency. Furthermore, on-chip power management technique is also integrated to obtain real-time power-saving by adapting the voltage supply based on the instantaneous workload. As a proof-of-concept, we implemented the processor using a 65 nm CMOS technology and conducted post-layout simulation. The proposed SQRD processor occupies 0.71 mm 2 core area and has a throughput of up to 69 MQRD/s. Compared to the brute-force approach, an energy reduction of 10 ~ 61.8% is achieved.
- 27 March 2015
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 34 (11) , 3631-3660
A New Approach to Sign-Bit-Based Parameter Estimation in OFDM Receivers
- 27 March 2015
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 34 (11) , 3631-3660
A New Approach to Sign-Bit-Based Parameter Estimation in OFDM Receivers