Christopher Husmann

Christopher Husmann

Auto-generated profile, based on publicly available information

Christopher Husmann

G Innovation Centre at the Institute for Communication Systems, University of Surrey, Guildford, Surrey, GU2 7XH, UK

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
24 October 2017 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
CHChristopher Camilo Mischa Husmann
Christopher Camilo Mischa Husmann
PNPanagiotis Chatzi Nikolaou
Panagiotis Chatzi Nikolaou
KNKonstantinos Nikitopoulos
Konstantinos Nikitopoulos
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.

23 December 2019 in IEEE Access
Verified
Journal Article
Open access
GGGeorgios Georgis
Georgios Georgis
MFMarcin Filo
Marcin Filo
ATAlexios Thanos
Alexios Thanos
KNKonstantinos Nikitopoulos
Konstantinos Nikitopoulos
JDJ. C. De Luna Ducoing
J. C. De Luna Ducoing
KNKonstantinos Nikitopoulos
Konstantinos Nikitopoulos
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, research-grade 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.

30 October 2020 in IEEE Communications Letters
Verified
Journal Article
Closed access
KNKonstantinos Nikitopoulos
Konstantinos Nikitopoulos
CJChathura Jayawardena
Chathura Jayawardena
AMAmine Maaref
Amine Maaref
Pei XiaoPei Xiao
Pei Xiao
KNKonstantinos Nikitopoulos
Konstantinos Nikitopoulos
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.