Dr Konstantinos Nikitopoulos

Multi-user (MU) MIMO-OFDM systems with aggressive spatial multiplexing are promising to enhance through-put and enable massive connectivity. In such systems, residual carrier frequency offsets (CFOs), due to the instability of oscilla-tors and doppler shifts, can substantially degrade the achievable uplink throughput, especially when the number of connected devices becomes large. Existing approaches to mitigate CFOs in MU scenarios, typically involve closed-loop feedback that can result in high signaling overhead and/or significant residual CFO. Being able to compensate for the CFO of the multiple users at the receiver side, can enable the joint transmission of frequency asynchronous users, can obviate the need for high overhead synchronization procedures, can enable the use of cheaper oscillators, and can potentially unlock new user access schemes. However, as we discuss here in detail, compensating for the multiple user CFOs at the receiver is currently impractical due to the corresponding exponential complexity requirements. At the same time, methods that are typically used in single-user MIMO-OFDM systems are inappropriate for MU-MIMO scenarios and, as we show, can result in substantial (e.g., 80%) throughput degradation. To fill this gap, for the first time, we propose a joint CFO compensation and MU detection scheme that can support a large number of spatially transmitted information streams with practical processing complexity and latency requirements. We show that the proposed scheme enables frequency asynchronous user transmission and approaches the performance of perfectly synchronized systems with complexity requirements that are comparable to current MU-MIMO detection schemes that assume perfect synchronization.

The recent paradigm shift towards the transmission of large numbers of mutually interfering information streams, as in the case of aggressive spatial multiplexing, combined with requirements towards very low processing latency despite the frequency plateauing of traditional processors, initiates a need to revisit the fundamental maximum-likelihood (ML) and, consequently, the sphere-decoding (SD) detection problem. This work presents the design and VLSI architecture of MultiSphere; the first method to massively parallelize the tree search of large sphere decoders in a nearly-concurrent manner, without compromising their maximum-likelihood performance, and by keeping the overall processing complexity comparable to that of highly-optimized sequential sphere decoders. For a 10 ⇥ 10 MIMO spatially multiplexed system with 16-QAM modulation and 32 processing elements, our MultiSphere architecture can reduce latency by 29⇥ against well-known sequential SDs, approaching the processing latency of linear detection methods, without compromising ML optimality. In MIMO multicarrier systems targeting exact ML decoding, MultiSphere achieves processing latency and hardware efficiency that are orders of magnitude improved compared to approaches employing one SD per subcarrier. In addition, for 16⇥16 both “hard”- and “soft”-output MIMO systems, approximate MultiSphere versions are shown to achieve similar error rate performance with state-of-the art approximate SDs having akin parallelization properties, by using only one tenth of the processing elements, and to achieve up to approximately 9⇥ increased energy efficiency.

Hybrid beamforming for frequency-selective channels is a challenging problem, as the phase shifters provide the same phase shift to all the subcarriers. The existing approaches solely rely on the channel’s frequency response, and the hybrid beamformers maximize the average spectral efficiency over the whole frequency band. Compared to state-of-the-art, we show that substantial sum-rate gains can be achieved, both for rich and sparse scattering channels, by jointly exploiting the frequency- and time-domain characteristics of the massive multiple-input multiple-output (MIMO) channels. In our proposed approach, the radio frequency (RF) beamformer coherently combines the received symbols in the time domain and, thus, it concentrates the signal’s power on a specific time sample. As a result, the RF beamformer flattens the frequency response of the “effective” transmission channel and reduces its root-mean-square delay spread. Then, a baseband combiner mitigates the residual interference in the frequency domain. We present the closed-form expressions of the proposed beamformer and its performance by leveraging the favorable propagation condition of massive MIMO channels, and we prove that our proposed scheme can achieve the performance of fully digital zero-forcing when the number of employed phases shifter networks is twice the resolvable multipath components in the time domain.characteristics of the massive multiple-input multiple-output (MIMO) channels. In our proposed approach, the radio frequency (RF) beamformer coherently combines the received symbols in the time domain and, thus, it concentrates the signal's power on a specific time sample. As a result, the RF beamformer flattens the frequency response of the ``effective'' transmission channel and reduces its root-mean-square delay spread. Then, a baseband combiner mitigates the residual interference in the frequency domain. We present the closed-form expressions of the proposed beamformer and its performance by leveraging the favorable propagation condition of massive MIMO channels, and we prove that our proposed scheme can achieve the performance of fully digital zero-forcing when the number of employed phases shifter networks is twice the resolvable multipath components in the time domain.

The increasing demand for connectivity and throughput, despite the spectrum limitations, has triggered a paradigm shift towards non-orthogonal signal transmissions. However, the complexity requirements of near-optimal detection methods for such systems becomes impractical, due to the large number of mutually interfering streams and to the rank-deficient or ill-determined nature of the corresponding interference matrix. This work introduces g-MultiSphere; a generic massively parallel and near-optimal sphere-decoding-based approach that, in contrast to prior work, applies to both well- and ill-determined non-orthogonal systems. We show that g-MultiSphere is the first approach that can support large uplink multi-user MIMO systems with numbers of concurrently transmitting users that exceed the number of receive antennas by a factor of two or more, while attaining throughput gains of up to 60% and with reduced complexity requirements in comparison to known approaches. By eliminating the need for sparse signal transmissions for nonorthogonal multiple access (NOMA) schemes, g-MultiSphere can support more users than existing systems with better detection performance and practical complexity requirements. In comparison to state- of-the-art detectors for NOMA schemes and nonorthogonal signal waveforms (e.g., SEFDM) g-MultiSphere can be up to an order of magnitude less complex, and can provide throughput gains of up to 60%.

Discrete cosine transform (DCT) based orthogonal frequency division multiplexing (OFDM), which has double number of subcarrier compared to the classic discrete fourier transform (DFT) based OFDM (DFT-OFDM) at the same bandwidth, is a promising high spectral efficiency multicarrier techniques for future wireless communication. In this paper, an enhanced DCT-OFDM with index modulation (IM) (EDCT-OFDM-IM) is proposed to further exploit the benefits of the DCT-OFDM and IM techniques. To be more specific, a pre-filtering method based DCT-OFDM-IM transmitter is first designed and the non-linear maximum likelihood (ML) is developed for our EDCT-OFDM-IM system. Moreover, the average bit error probability (ABEP) of the proposed EDCT-OFDM-IM system is derived, which is confirmed by our simulation results. Both simulation and theoretical results are shown that the proposed EDCT-OFDM-IM system exhibits better bit error rate (BER) performance over the conventional DFT-OFDM-IM and DCT-OFDM-IM counterparts.

This paper presents the algorithmic design, experimental evaluation, and VLSI implementation of Geosphere, a depth-first sphere decoder able to provide the exact maximumlikelihood solution in dense (e.g., 64) and very dense (e.g., 256, 1024) QAM constellations by means of a geometrically inspired enumeration. In general, linear detection methods can be highly effective when the MIMO channel is well-conditioned. However, this is not the case when the size of the MIMO system increases and the number of transmit antennas approaches the number of the receive antennas. Via our WARP testbed implementation we gather indoor channel traces in order to evaluate the performance gains of sphere detection against zero-forcing and MMSE in an actual indoor environment. We show that Geosphere can nearly linearly scale performance with the number of user antennas; in 4 × 4 multi-user MIMO for 256-QAM modulation at 30 dB SNR there is a 1.7× gain over MMSE and 2.4× over zeroforcing and a 14% and 22% respective gain in 2 × 2 systems. In addition, by using a new node labeling based enumeration technique, low-complexity integer arithmetic and fine-grained clock gating, we implement for up to 1024-QAM constellations and compare in terms of area, delay, power characteristics, the Geosphere VLSI architecture and the best-known best-scalable exact ML sphere decoder. Results show that Geosphere is twice as area-efficient and 70% more energy efficient in 1024-QAM. Even for 16-QAM Geosphere is 13% more area efficient than the best-known implementation for 16-QAM and it is at least 80% more area efficient than state-of-the-art K-best detectors for 64-QAM.

The vision, as we move to future wireless communication systems, embraces diverse qualities targeting significant enhancements from the spectrum, to user experience. Newly-defined air-interface features, such as large number of base station antennas and computationally complex physical layer approaches come with a non-trivial development effort, especially when scalability and flexibility need to be factored in. In addition, testing those features without commercial, off-the-shelf equipment has a high deployment, operational and maintenance cost. On one hand, industry-hardened solutions are inaccessible to the research community due to restrictive legal and financial licensing. On the other hand, researchgrade real-time solutions are either lacking versatility, modularity and a complete protocol stack, or, for those that are full-stack and modular, only the most elementary transmission modes are on offer (e.g., very low number of base station antennas). Aiming to address these shortcomings towards an ideal research platform, this paper presents SWORD, a SoftWare Open Radio Design that is flexible, open for research, low-cost, scalable and software-driven, able to support advanced large and massive Multiple-Input Multiple- Output (MIMO) approaches. Starting with just a single-input single-output air-interface and commercial off-the-shelf equipment, we create a software-intensive baseband platform that, together with an acceleration/ profiling framework, can serve as a research-grade base station for exploring advancements towards future wireless systems and beyond.

The recent studies on hybrid beamformers with a combination of switches and phase shifters indicate that such methods can reduce the cost and power consumption of massive multiple-input multiple-output (MIMO) systems. However, most of the works have focused on the scenarios with frequency-flat channel models. This letter proposes an effective approach for such systems in frequency-selective channels and presents the closed-form expressions of the beamformer and the corresponding sum-rates. Compared to the traditional subconnected structures, our approach with a significantly smaller number of phase shifters results in a promising performance.

The future mobile networks will face challenges in support of heterogeneous services over a unified physical layer, calling for a waveform with good frequency localization. Filtered orthogonal frequency division multiplexing (f-OFDM), as a representative subband filtered waveform, can be employed to improve the spectrum localization of orthogonal frequency-division multiplexing (OFDM) signal. However, the applied filtering operations will impact the performance in various aspects, especially for narrow subband cases. Unlike existing studies which mainly focus its benefits, this paper investigates two negative consequences inflicted on single subband f-OFDM systems: in-band interference and filter frequency response (FFR) selectivity. The exact-form expression for the in-band interference is derived, and the effect of FFR selectivity is analyzed for both single antenna and multiple antenna cases. The in-band interference-free and nearly-free conditions for f-OFDM systems are studied. A low-complexity blockwise parallel interference cancellation (BwPIC) algorithm and a pre-equalizer are proposed to tackle the two issues caused by the filtering operations, respectively. Numerical results show that narrower subbands suffer more performance degradation compared to wider bands. In addition, the proposed BwPIC algorithm effectively suppresses interference, and pre-equalized f-OFDM (pf-OFDM) considerably outperforms f- OFDM in both single antenna and multi-antenna systems.

The complexity of depth-first sphere decoders (SDs) is determined by the employed tree search and pruning strategies. Proposed is a new SD approach for maximum-likelihood (ML) detection of spatially multiplexed, high-order, QAM symbols. In contrast to typical ML approaches, the proposed tree traversal skips the computationally intensive requirement of visiting the nodes in ascending order of their partial distances (PDs). Then, a new pruning method efficiently narrows the search space and preserves the ML performance despite the non-ordered tree traversal. This proposed approach results in substantially reduced PD calculations when compared to typical ML SDs and, for high SNRs, the necessary calculations can be reduced down to the number of transmit antennas. © 2012 The Institution of Engineering and Technology.

In this paper two complexity efficient soft sphere-decoder modifications are proposed for computing the max-log LLR values in iterative MIMO systems, which avoid the costly, typically needed, full enumeration and sorting (FES) procedure during the tree traversal without compromising the max-log performance. It is shown that despite the resulting increase in the number of expanded nodes, they can be more computationally efficient than the typical soft sphere decoders by avoiding the unnecessary complexity of FES.

Millimeter wave (mmWave) systems with effective beamforming capability play a key role in fulfilling the high data-rate demands of current and future wireless technologies. Hybrid analog-todigital beamformers have been identified as a cost-effective and energy-efficient solution towards deploying such systems. Most of the existing hybrid beamforming architectures rely on a subconnected phase shifter network with a large number of antennas. Such approaches, however, cannot fully exploit the advantages of large arrays. On the other hand, the current fully-connected beamformers accommodate only a small number of antennas, which substantially limits their beamforming capabilities. In this paper, we present a mmWave hybrid beamformer testbed with a fully-connected network of phase shifters and adjustable attenuators and a large number of antenna elements. To our knowledge, this is the first platform that connects two RF inputs from the baseband to a 16 8 antenna array, and it operates at 26 GHz with a 2 GHz bandwidth. It provides a wide scanning range of 60, and the flexibility to control both the phase and the amplitude of the signals between each of the RF chains and antennas. This beamforming platform can be used in both short and long-range communications with linear equivalent isotropically radiated power (EIRP) variation between 10 dBm and 60 dBm. In this paper, we present the design, calibration procedures and evaluations of such a complex system as well as discussions on the critical factors to consider for their practical implementation.

We introduce the concept of Space-Time Super-Modulation according to which additional lowrate and highly reliable information can be transmitted on top of traditionally modulated and spacetime encoded information, without increasing the transmitted block length or degrading their error-rate performance. This is achieved by exploiting the temporal redundancy introduced by the space-time block codes and, specifically, by efficiently mapping transmission patterns to specific information content. We show that Space-Time Super-Modulation can be efficiently used in the context of machine-type communications to enable “one-shot”, “grant-free" joint medium access and rateless data transmission while reducing or even eliminating the need for transmitting preamble sequences. As a result, compared with traditional approaches that use correlatable preamble sequences or encoded preambles to transmit the signature information of transmitted packets, Space-Time Super-Modulation can achieve significant throughput gains. For example, we show up to 35% throughput gains from the second best examined preamble-based scheme when transmitting blocks of 200 bits.

A-posteriori probability (APP) receivers operating over multiple-input, multiple-output channels provide enhanced bit error rate (BER) performance at the cost of increased complexity. However, employing full APP processing over favorable transmission environments, where less efficient approaches may already provide the required performance at a reduced complexity, results in unnecessary processing. For slowly varying channel statistics substantial complexity savings can be achieved by simple adaptive schemes. Such schemes track the BER performance and adjust the complexity of the soft output sphere decoder by adaptively setting the related log-likelihood ratio (LLR) clipping value.

Targeting always the best achievable bit error rate (BER) performance in iterative receivers operating over multiple-input multiple-output (MIMO) channels may result in significant waste of resources, especially when the achievable BER is orders of magnitude better than the target performance (e.g., under good channel conditions and at high signal-to-noise ratio (SNR)). In contrast to the typical iterative schemes, a practical iterative decoding framework that approximates the soft-information exchange is proposed which allows reduced complexity sphere and channel decoding, adjustable to the transmission conditions and the required bit error rate. With the proposed approximate soft information exchange the performance of the exact soft information can still be reached with significant complexity gains.

Sphere decoding (SD) has been proposed as an efficient way to perform maximum-likelihood (ML) decoding of Polar codes. Its latency requirements, however, are determined by its ability to promptly exclude from the ML search (i.e., prune) large parts of the corresponding SD tree, without compromising the ML optimality. Traditional depth-first approaches initially find a “promising" candidate solution and then prune parts of the tree that cannot result to a “better" solution. Still, if this candidate solution is far (in terms of Euclidean distance) from the ML one, pruning becomes inefficient and decoding latency explodes. To reduce this processing latency, an early termination approach is, first, introduced that exploits the binary nature of the transmitted information. Then, a simple but very efficient SD approach is proposed that performs multiple tree searches that perform decreasingly aggressive pruning. These searches are almost independent and can take place sequentially, in parallel, or even in a hybrid (sequential/parallel) manner. For Polar codes of 128 block size, both realizations can provide a latency reduction of up to four orders of magnitude compared to state-of-the-art Polar sphere decoders. Then, a further 50% latency reduction can be achieved by exploiting the parallel nature of the approach.

The simultaneous perturbation of an orthogonal frequency-division multiplexing receiver by phase noise plus a residual frequency offset (due to synchronization errors) is modeled here as a combined phase impairment, whose effect is evaluated analytically for the case of a frequency-selective fading channel. A nonpilot-aided (decision-directed) scheme is proposed, which compensates for the common (over all the subcarriers) phase-impairment effect. By representing the resulting intercarrier interference as an uncorrelated, unequal-variance process in the frequency domain, maximum-likelihood (ML) and approximate ML estimators of the complex-vector and phase-only types are derived and analytically evaluated. The present schemes are also compared with other current methods based on individual phase trackers, one per subcarrier. Finally, two suggestions are introduced for increasing the robustness of the algorithms to tentative-decision errors. It is demonstrated through simulations that the analysis is accurate, and that the proposed schemes achieve error-rate performance close to that of ideal compensation. © 2005 IEEE.

This paper presents the design and implementation of Geosphere, a physical- and link-layer design for access point-based MIMO wireless networks that consistently improves network throughput. To send multiple streams of data in a MIMO system, prior designs rely on a technique called zero-forcing, a way of "nulling" the interference between data streams by mathematically inverting the wireless channel matrix. In general, zero-forcing is highly effective, significantly improving throughput. But in certain physical situations, the MIMO channel matrix can become "poorly conditioned," harming performance. With these situations in mind, Geosphere uses sphere decoding, a more computationally demanding technique that can achieve higher throughput in such channels. To overcome the sphere decoder's computational complexity when sending dense wireless constellations at a high rate, Geosphere introduces search and pruning techniques that incorporate novel geometric reasoning about the wireless constellation. These techniques reduce computational complexity of 256-QAM systems by almost one order of magnitude, bringing computational demands in line with current 16- and 64-QAM systems already realized in ASIC. Geosphere thus makes the sphere decoder practical for the first time in a 4 x 4 MIMO, 256-QAM system. Results from our WARP testbed show that Geosphere achieves throughput gains over multi-user MIMO of 2x in 4 x 4 systems and 47% in 2 x 2 MIMO systems. © 2014 ACM.

Large multi-user MIMO systems with spatial multiplexing are among the most promising approaches for increasing wireless throughput while serving many clients. Yet, the achievable spectral efficiency of current large MIMO systems is limited by the adoption of simple, but sub-optimal, linear precoding techniques (e.g, minimum-mean-square-error (MMSE)). Nonlinear precoding methods, like Vector Perturbation (VP), claim to be able to provide improved network throughput. However, such methods are still purely theoretical and they do not account for the practical aspects of actual wireless systems, as the corresponding complexity and latency requirements, or the need for practical rate adaptation. This paper presents ViPer, the first practical VP-based MIMO system design. ViPer substantially reduces the latency requirements of VP by employing massively parallel processing and realizes a practical rate adaptation method that efficiently translates VP’s signal-to-noise-ratio (SNR) gains into actual throughput gains. In our first systematic experimental evaluation of VP-based precoders, we show that ViPer can deliver in practice up to 30% higher throughput than MMSE precoding with comparable latency requirements. In addition, ViPer can match the performance of state-of-the-art parallel VP precoding schemes, by utilizing less than one tenth of the processing elements.

This work introduces Generalized Space-Time Super-Modulation (GSTSM), a generalization of the recently proposed Space-Time Super-Modulation scheme that enables the transmission of additional, highly-reliable information on the top of conventionally transmitted symbols, without increasing the corresponding packet length. GSTSM jointly exploits the spatial and temporal dimensions of multiple-antenna systems but, in contrast to the initially proposed approach, it does not require the use of space-time block codes. Instead, GSTSM jointly elaborates on the concepts of spatial modulation and spatial diversity, while intentionally introducing temporal correlation to the transmitted symbol sequence. In the context of machine-type communications, GSTSM enables one-shot and grant-free medium access without transmitting additional headers to convey each machine’s ID. As a result, we show that GSTSM can provide throughput gains of up to 2.5 X compared to conventional header-based schemes, even in the case of colliding packets.

—In this work, Generalized Space-Time Super-Modulation (GSTSM) is introduced which enables the transmission of an additional flexible-rate and highly-reliable information stream concurrently with the conventionally transmitted symbols , without the need for increasing the corresponding packet length. This is attained by jointly exploiting the spatial and temporal dimensions of multiple-antenna systems, which enables efficient detection for conventional and additional information subchannels even in highly correlated channel conditions or AWGN channels. In the context of machine-type communications, GSTSM enables grant-free medium access without transmitting additional headers to convey each machine's signature information. Hence, it is shown that even at an extreme case where the data packets of two users are always colliding, GSTSM offers throughput gains of up to 33% compared to the best examined header-based scheme. For the same scenario, it is shown that GSTSM based on joint multiuser detection provides throughput gains of up to 2.5× compared with the case where users' signals are detected independently. In addition, it yields over 90% improvement in achievable rates compared with the schemes that require centralized medium-access coordination. For both joint and independent signal detection schemes, it is also shown that adopting an iterative detection/decoding approach allows to further improve the throughput gains.

The increasing demand for massive connectivity with low latency requirements has triggered a paradigm shift towards Non-Orthogonal transmissions. Still, to translate the theoretical gains of Non-Orthogonal transmissions into practical, efficient “soft” detection schemes are required. The detection latency and/or complexity of state-of-the-art detection methods becomes impractical for large Non-Orthogonal systems, both due to the large number of interfering streams and due to the rank-deficient or ill-determined nature of the corresponding interference matrix. Extending the recently proposed MultiSphere framework, this work introduces NorthCore; a massively parallel sphere-decoding-based scheme for the detection of large and illdetermined Non-Orthogonal systems. Similarly to MultiSphere, NorthCore reduces the corresponding search space by focusing the available processing power to the most promising vector solutions that are processed in parallel. As a result, the proposed detection scheme can attain a detection processing latency similar to that of highly-suboptimal linear detectors and even outperform state-of-the-art sophisticated detection approaches with up to an order of magnitude reduced complexity. To identify the most promising vector solutions, NorthCore introduces a sortfree candidate selection technique that reduces the necessary preprocessing complexity by up to an order of magnitude, making the proposed approach practical.

This paper presents a DSP acceleration and assessment framework targeting SDR platforms on x86 64 architectures. Driven by the potential of rapid prototyping and evaluation of breakthrough concepts that these platforms provide, our work builds upon the wellknown OpenAirInterface codebase, extending it for advanced, previously unsupported modes towards large and massive MIMO such as non-codebook-based multi-user transmissions. We then develop an acceleration/profiling framework, through which we present finegrained execution results for DSP operations. Incorporating the latest SIMD instructions, our acceleration framework achieves a unitary speedup of up to 10. Integrated into OpenAirInterface, it accelerates computationally expensive MIMO operations by up to 88% across tested modes. Besides resulting in a useful tool for the community, this work provides insight on runtime DSP complexity and the potential of modern x86 64 systems.

To avoid unnecessarily using a massive number of base station antennas to support a large number of users spatially multiplexed multi-user MIMO systems, optimal detection methods are required to demultiplex the mutually interfering information streams. Sphere decoding (SD) can achieve this, but its complexity and latency becomes impractical for large MIMO systems. Low complexity detection solutions such as linear detectors (e.g., MMSE) or likelihood ascendant search (LAS) approaches, have significantly lower latency requirements than SD but their achievable throughput is far from optimal. This work presents the concept of Antipodal detection and decoding, that can deliver very high throughput with practical latency requirements, even in systems where the number of user antennas reaches the number of base station antennas. The Antipodal detector either results in a highly reliable vector solution, or it does not find a vector solution at all (i.e., it results in an erasure), skipping the heavy processing load related to finding vector solutions that have a very high likelihood to be erroneous. Then, a belief-propagation-based decoder is proposed, that restores these erasures and further corrects remaining erroneous vector solutions. We show that for 32⇥32, 64-QAM modulated systems, and for packet error rates below 10%, Antipodal detection and decoding requires 9 dB less transmitted power than systems employing soft MMSE or LAS detection and LDPC decoding with similar complexity requirements. For the same scenario, our Antipodal method achieves practical throughput gains of more than 50% compared to soft MMSE and soft LAS-based methods.

An index modulation (IM) assisted Discrete Cosine Transform based Orthogonal Frequency Division Multiplexing (DCT-OFDM) with Enhanced Transmitter Design (termed as EDCT-OFDM-IM) is proposed. It amalgamates the concept of Discrete Cosine Transform assisted Orthogonal Frequency Division Multiplexing (DCT-OFDM) and Index Modulation (IM) to exploit the design freedom provided by the double number of available subcarrier under the same bandwidth. In the proposed EDCT-OFDM-IM scheme, the maximum likelihood (ML) detector used for symbol bits and index bits recovering is derived and the sophisticated designing guidelines for EDCTOFDM-IM are provided. Based on the derived pairwise error event probability, a theoretical upper bound on the average biterror probability (ABEP) of EDCT-OFDM-IM is provided over multipath fading channels. Furthermore, the maximum peak-toaverage power ratio (PAPR) of our proposed EDCT-OFDM-IM scheme is derived and compared to than the general Discrete Fourier Transform (DFT) based OFDM-IM counterpart.

This paper presents the measurement results and analysis for outdoor wireless propagation channels at 26 GHz over 2 GHz bandwidth for two receiver antenna polarization modes. The angular and wideband properties of directional and virtually omni-directional channels, such as angular spread, root-mean-square delay spread and coherence bandwidth, are analyzed. The results indicate that the reflections can have a significant contribution in some realistic scenarios and increase the angular and delay spreads, and reduce the coherence bandwidth of the channel. The analysis in this paper also show that using a directional transmission can result in an almost frequencyflat fading channel over the measured 2 GHz bandwidth; which consequently has a major impact on the choice of system design choices such as beamforming and transmission numerology.

—This work introduces Gyre Precoding (GP), a novel linear multiuser multiple-input multiple-output (MU-MIMO) precoding approach. GP performs rotations of the symbols of each spatial layer to optimize the precoding performance. To find the rotation angles, we propose a near-optimal, gradient descent–based low-complexity algorithm. GP is constellation-agnostic and does not require significant changes to conventional receiver procedures or wireless standards. Computer evaluation results show that GP can achieve 8 dB SNR gains over linear precoding techniques and 2 dB over suboptimal symbol-level precoding (SLP) methods for a 16 × 16 MU-MIMO system. Furthermore, in a 64×12 massive-MIMO scenario in a 5G New Radio (5GNR) setup, GP achieves a 13% higher throughput gain over zero-forcing precoding. Index Terms—Multi-user multiple-input multiple-output (MU-MIMO), precoding.

MIMO mobile systems, with a large number of antennas at the base-station side, enable the concurrent transmission of multiple, spatially separated information streams, and therefore, enable improved network throughput and connectivity both in uplink and downlink transmissions. Traditionally, such MIMO transmissions adopt linear base-station processing, that translates the MIMO channel into several single-antenna channels. While such approaches are relatively easy to implement, they can leave on the table a significant amount of unexploited MIMO capacity and connectivity capabilities. Recently-proposed non-linear base-station processing methods claim this unexplored capacity and promise substantially increased network throughput and connectivity capabilities. Still, to the best of the authors' knowledge, non-linear base-station processing methods not only have not yet been adopted by actual systems, but have not even been evaluated in a standard-compliant framework, involving of all the necessary algorithmic modules required by a practical system. In this work, for the first time, we incorporate and evaluate non-linear base-station processing in a 3GPP standard environment. We outline the required research platform modifications and we verify that significant throughput gains can be achieved, both in indoor and outdoor settings, even when the number of base-station antennas is much larger than the number of transmitted information streams. Then, we identify missing algorithmic components that need to be developed to make non-linear base-station practical, and discuss future research directions towards potentially transformative next-generation mobile systems and base-stations (i.e., 6G) that explore currently unexploited non-linear processing gains.

In conventional hybrid beamforming approaches, the number of radio-frequency (RF) chains is the bottleneck on the achievable spatial multiplexing gain. Recent studies have overcome this limitation by increasing the update-rate of the RF beamformer. This paper presents a framework to design and evaluate such approaches, which we refer to as agile RF beamforming, from theoretical and practical points of view. In this context, we consider the impact of the number of RF-chains, phase shifters speed, and resolution to design agile RF beamformers. Our analysis and simulations indicate that even an RF-chain-free transmitter, which its beamformer has no RF-chains, can provide a promising performance compared with fully-digital systems and significantly outperform the conventional hybrid beamformers. Then, we show that the phase shifter's limited switching speed can result in signal aliasing, in-band distortion, and out-of-band emissions. We introduce performance metrics and approaches to measure such effects and compare the performance of the proposed agile beamformers using the Gram-Schmidt orthogonalization process. Although this paper aims to present a generic framework for deploying agile RF beamformers, it also presents extensive performance evaluations in communication systems in terms of adjacent channel leakage ratio, sum-rate, power efficiency, error vector magnitude, and bit-error rates.

Non-orthogonal multiple access schemes (NOMA), such as sparse code multiple access (SCMA), are among the most promising technologies to support massive numbers of connected devices. Still, to minimize the transmission delay and to maximize the utilization of the transmission channel, "grant-free" NOMA techniques are required that eliminate any prior information exchange between the users and the base-stations. However, if a large number of users transmit simultaneously in an "unsupervised" manner, (i.e., without any prior signaling for controlling the number of users and the corresponding transmission patterns), it is likely that a large number of users may share the same frequency-resource element, rendering the corresponding user detection impractical. In this context, we present a new multi-user detection approach, which aims to maximize the detection performance, with respect to given processing and latency limitations. We show that our approach enables practical detection for grant-free SCMA schemes that support hundreds of interfering users, with a complexity that is up to two orders of magnitude less than that of conventional detection approaches.

In the last few years, Internet of Things, Cloud computing, Edge computing, and Fog computing have gained a lot of attention in both industry and academia. However, a clear and neat definition of these computing paradigms and their correlation is hard to find in the literature. This makes it difficult for researchers new to this area to get a concrete picture of these paradigms. This work tackles this deficiency, representing a helpful resource for those who will start next. First, we show the evolution of modern computing paradigms and related research interest. Then, we address each paradigm, neatly delineating its key points and its relation with the others. There after, we extensively address Fog computing, remarking its outstanding role as the glue between IoT, Cloud, and Edge computing. In the end, we briefly present open challenges and future research directions for IoT, Cloud, Edge, and Fog computing.

It is well documented that the achievable throughput of MIMO systems that employ linear beamforming can significantly degrade when the number of concurrently transmitted information streams approaches the number of base-station antennas. To increase the number of the supported streams, and therefore, to increase the achievable net throughput, non-linear beamforming techniques have been proposed. These beamforming approaches are typically evaluated via simulations or via simplified over-the-air experiments that are sufficient for validating their basic principles, but they neither provide insights about potential practical challenges when trying to adopt such approaches in a standards-compliant framework, nor they provide any indication about the achievable performance when they are part of a standards-compliant protocol stack. In this work, for first time, we evaluate non-linear beamforming in a 3GPP standards- compliant framework, using our recently-proposed SWORD research platform. SWORD is a flexible, open for research, software-driven platform that enables the rapid evaluation of advanced algorithms without extensive hardware optimizations that can prevent promising algorithms from being evaluated in a standards-compliant stack. We show that in an indoor environment, vector perturbation-based non-linear beamforming can provide up to 46% throughput gains compared to linear approaches for 4×4 MIMO systems, while it can still provide gains of nearly 10% even if the number of base-station antennas is doubled.

The paper introduces the concept of Space-Time Super-Modulation according to which additional low rate and highly reliable information can be transmitted by further supermodulating blocks of traditionally modulated and space-time encoded information. This is achieved by exploiting the redundant information introduced by the space-time-block codes and, specifically, by efficiently mapping transmission patterns to specific information content. It is shown that Space-Time SuperModulation can be efficiently used in the context of MachineType-Communications to enable joint medium access and rateless data transmission while minimizing or even eliminating the need for transmitting preamble sequences. Compared with traditional approaches that use encoded preambles or preambles based on Zadoff-Chu sequences to transmit the signature information of transmitted packets, Space-Time Super-Modulation can achieve throughput gains of more than 45% when transmitting blocks of 200 symbols.

The discrete cosine transform (DCT) based multicarrier modulation (MCM) system is regarded as one of the promising transmission techniques for future wireless communications. By employing cosine basis as orthogonal functions for multiplexing each real-valued symbol with symbol period of T , it is able to maintain the subcarrier orthogonality while reducing frequency spacing to 1/(2T ) Hz, which is only half of that compared to discrete Fourier transform (DFT) based multicarrier systems. In this paper, following one of the effective transmission models by which zeros are inserted as guard sequence and the DCT operation at the receiver is replaced by DFT of double length, we reformulate and evaluate three classic detection methods by appropriately processing the post- DFT signals both for single antenna and multiple-input multipleoutput (MIMO) DCT-MCM systems. In all cases, we show that with our reformulated detection approaches, DCT-MCM schemes can outperform, in terms of error-rate, conventional OFDMbased systems.

This paper proposes a complex-valued discrete multicarrier modulation (MCM) system based on the real-valued discrete Hartley transform (DHT) and its inverse (IDHT). Unlike conventional discrete Fourier transform (DFT), DHT can not diagonalize the multipath fading channel due to its inherent properties, which results in the mutual interference between subcarriers in the same mirror-symmetrical pair.We explore the interference pattern in order to seek an optimal solution to utilize the channel diversity for the purpose of enhancing system bit error performance (BEP). It is shown that the optimal channel diversity gain can be achieved via a pairwise maximum likelihood (ML) detection, taking into account not only the subcarrier’s own channel quality but also the channel state of its mirror-symmetrical peer. Performance analysis indicates that DHT-based MCM mitigates the fast fading effect by averaging the channel power gain on the mirror-symmetrical subcarriers. Simulation results show that the proposed system has a substantial improvement in BEP over conventional DFT-Based MCM.

State-of-the-art channel coding schemes promise data rates close to the wireless channel capacity. However, efficient link adaptation techniques are required in order to deliver such throughputs in practice. Traditional rate adaptation schemes, which are reactive and try to “predict” the transmission mode that maximizes throughput based on “transmission quality indicators”, can be highly inefficient in an evolving wireless ecosystem where transmission can become increasingly dynamic and unpredictable. In such scenarios, “rateless” link adaptation can be highly beneficial. Here, we compare popular rateless approaches in terms of gains and practicality in both traditional and more challenging operating scenarios. We also discuss challenges that need to be addressed to make such systems practical for future wireless communication systems.

Large MIMO base stations remain among wireless network designers’ best tools for increasing wireless throughput while serving many clients, but current system designs, sacrifice throughput with simple linear MIMO detection algorithms. Higher-performance detection techniques are known, but remain off the table because these systems parallelize their computation at the level of a whole OFDM subcarrier, sufficing only for the lessdemanding linear detection approaches they opt for. This paper presents FlexCore, the first computational architecture capable of parallelizing the detection of large numbers of mutually-interfering information streams at a granularity below individual OFDM subcarriers, in a nearly-embarrassingly parallel manner while utilizing any number of available processing elements. For 12 clients sending 64-QAM symbols to a 12-antenna base station, our WARP testbed evaluation shows similar network throughput to the state-of-the-art while using an order of magnitude fewer processing elements. For the same scenario, our combined WARP-GPU testbed evaluation demonstrates a 19× computational speedup, with 97% increased energy efficiency when compared with the state of the art. Finally, for the same scenario, an FPGAbased comparison between FlexCore and the state of the art shows that FlexCore can achieve up to 96% better energy efficiency, and can offer up to 32× the processing throughput.

Next-generation 6G networks are expected to feature an extremely high density of network and user devices. MU-MIMO non-linear processing can provide substantially improved performance over linear processing in dense conditions, but suffers from a high complexity and processing latency. The use of the massively parallel non-linear (MPNL) processing framework can overcome such limitations. This work discusses three potential 6G transmission scenarios and evaluates their detection and precoding performance using link-level simulations and a system-level, over-the-air, 3GPP standards-based testbed. The results validate that MPNL processing has the potential to transform the way 6G MU-MIMO systems are designed.

Typical receiver processing, targeting always the best achievable bit error rate performance, can result in a waste of resources, especially, when the transmission conditions are such that the best performance is orders of magnitude better than the required. In this work, a processing framework is proposed which allows adjusting the processing requirements to the transmission conditions and the required bit error rate. It applies a-posteriori probability receivers operating over multiple-input multiple-output channels. It is demonstrated that significant complexity savings can be achieved both at the soft, sphere-decoder based detector and the channel decoder with only minor modifications.

© 2022 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.”

—This work introduces MultiSphere, a method to massively parallelize the tree search of large sphere decoders in a nearly-independent manner, without compromising their maximum-likelihood performance, and by keeping the overall processing complexity at the levels of highly-optimized sequential sphere decoders. MultiSphere employs a novel sphere decoder tree partitioning which can adjust to the transmission channel with a small latency overhead. It also utilizes a new method to distribute nodes to parallel sphere decoders and a new tree traversal and enumeration strategy which minimize redundant computations despite the nearly-independent parallel processing of the subtrees. For an 8 × 8 MIMO spatially multiplexed system with 16-QAM modulation and 32 processing elements MultiSphere can achieve a latency reduction of more than an order of magnitude, approaching the processing latency of linear detection methods, while its overall complexity can be even smaller than the complexity of well-known sequential sphere decoders. For 8×8 MIMO systems, MultiSphere’s sphere decoder tree partitioning method can achieve the processing latency of other partitioning schemes by using half of the processing elements. In addition, it is shown that for a multi-carrier system with 64 subcarriers, when performing sequential detection across subcarriers and using MultiSphere with 8 processing elements to parallelize detection, a smaller processing latency is achieved than when parallelizing the detection process by using a single processing element per subcarrier (64 in total).