Dimitrios Alanis

ORCID: 0000-0002-6654-1702
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Quantum Computing Algorithms and Architecture
  • Quantum Information and Cryptography
  • Quantum-Dot Cellular Automata
  • Error Correcting Code Techniques
  • Optical Wireless Communication Technologies
  • Optical Network Technologies
  • Advanced Wireless Communication Techniques
  • Molecular Communication and Nanonetworks
  • Advanced Wireless Communication Technologies
  • Cooperative Communication and Network Coding
  • Energy Harvesting in Wireless Networks
  • Advanced MIMO Systems Optimization
  • Advanced Photonic Communication Systems
  • Advanced Memory and Neural Computing
  • UAV Applications and Optimization
  • Wireless Communication Networks Research
  • Power Line Communications and Noise
  • Indoor and Outdoor Localization Technologies
  • Radio Wave Propagation Studies
  • Satellite Communication Systems
  • Cloud Computing and Resource Management
  • Advancements in Semiconductor Devices and Circuit Design
  • Explainable Artificial Intelligence (XAI)
  • Big Data and Business Intelligence
  • Traffic Prediction and Management Techniques

University of Southampton
2014-2022

Faster, ultra-reliable, low-power, and secure communications has always been high on the wireless evolutionary agenda. However, appetite for faster, more reliable, greener, continues to grow. The state-of-the-art methods conceived achieving performance targets of associated processes may be accompanied by an increase in computational complexity. Alternatively, a degraded have accepted due lack jointly optimized system components. In this survey we investigate employment quantum computing...

10.1109/comst.2018.2882385 article EN cc-by IEEE Communications Surveys & Tutorials 2018-11-20

The near-capacity performance of classical low-density parity check (LDPC) codes and their efficient iterative decoding makes quantum LDPC (QLPDC) a promising candidate for error correction. In this paper, we present comprehensive survey QLDPC from the perspective code design as well in terms algorithms. We also conceive modified non-binary algorithm homogeneous Calderbank-Shor-Steane-type codes, which is capable alleviating problems imposed by unavoidable length-four cycles. Our decoder...

10.1109/access.2015.2503267 article EN cc-by-nc-nd IEEE Access 2015-01-01

Quantum error correction codes (QECCs) can be constructed from the known classical coding paradigm by exploiting inherent isomorphism between and quantum regimes, while also addressing challenges imposed strange laws of physics. In this spirit, paper provides deep insights into duality theory, hence aiming for bridging gap them. Explicitly, we survey rich history both as well codes. We then provide a comprehensive slow-paced tutorial constructing stabilizer-based QECCs arbitrary binary...

10.1109/comst.2018.2861361 article EN cc-by IEEE Communications Surveys & Tutorials 2019-01-01

With the proliferation of smart-phones and tablet PCs, data rates wireless communications have been soaring. Hence, need for power-efficient relying on low-complexity multiple-stream detectors has become more pressing than ever. As a remedy, in this paper we design soft-input soft-output quantum-assisted multi-user (QMUD), which may be conveniently incorporated into state-of-the-art iterative receivers. Our relies extrinsic information transfer charts. QMUDs are then employed multi-carrier...

10.1109/tcomm.2015.2458857 article EN IEEE Transactions on Communications 2015-07-21

Self-organizing networks act autonomously for the sake of achieving best possible performance. The attainable routing depends on a delicate balance diverse and often conflicting quality-of-service requirements. Finding optimal solution typically becomes an nonolynomial-hard problem, as network size increases in terms number nodes. Moreover, employment user-defined utility functions aggregation different objective leads to suboptimal solutions. On other hand, Pareto optimality is capable...

10.1109/access.2014.2327596 article EN cc-by-nc-nd IEEE Access 2014-01-01

Powerful Quantum Error Correction Codes (QECCs) are required for stabilizing and protecting fragile qubits against the undesirable effects of quantum decoherence. Similar to classical codes, hashing bound approaching QECCs may be designed by exploiting a concatenated code structure, which invokes iterative decoding. Therefore, in this paper we provide an extensive step-by-step tutorial designing EXtrinsic Information Transfer (EXIT) chart aided codes based on underlying quantum-to-classical...

10.1109/access.2015.2405533 article EN cc-by-nc-nd IEEE Access 2015-01-01

Large-scale quantum network coding (LQNC) is conceived for distributing entangled qubits over large-scale communication networks supporting both teleportation and key distribution. More specifically, the LQNC characterized by detailing encoding decoding process pairs of to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula> source-and-target users connected via a backbone route...

10.1109/access.2017.2738781 article EN cc-by IEEE Access 2017-01-01

An ideal visible light communication (VLC) system should facilitate reliable data transmission at high throughputs, while also providing flicker-free illumination the user-defined dimming level. In this spirit, we conceive a unary code aided scheme for ON-OFF keying (OOK) modulated VLC systems. The proposed unary-coded facilitates joint and throughput control, relying on iterative decoding. It is demonstrated that provides attractive gains over its contemporaries it capable of approaching...

10.1109/tcomm.2017.2759271 article EN IEEE Transactions on Communications 2017-10-04

Low-complexity suboptimal multiuser detectors (MUDs) are widely used in multiple access communication systems for separating users, since the computational complexity of maximum likelihood (ML) detector is potentially excessive practical implementation. Quantum computing may be invoked detection procedure, by exploiting its inherent parallelism approaching ML MUDs performance at a substantially reduced number cost function evaluations. In this contribution, we propose soft-output (SO)...

10.1109/access.2014.2322013 article EN cc-by-nc-nd IEEE Access 2014-01-01

Abstract When quantum computing becomes a wide-spread commercial reality, Quantum Search Algorithms (QSA) and especially Grover’s QSA will inevitably be one of their main applications, constituting cornerstone. Most the literature assumes that circuits are free from decoherence. Practically, decoherence remain unavoidable as is Gaussian noise classic imposed by Brownian motion electrons, hence it may have to mitigated. In this contribution, we investigate effect on performance QSAs, in terms...

10.1038/srep38095 article EN cc-by Scientific Reports 2016-12-07

With the proliferation of millimeter-Wave (mm-Wave) systems and visible light communications (VLCs), indoor localization may find multiple applications. When high accuracy is required triangulation not possible due to infrastracture scenario limitations, computational complexity searching on a virtual grid become excessive. In this paper, we amalgamate uplink mm-Wave-based downlink VLC-based localization. We employ quantum search algorithms for reducing achieving optimal full-search-based...

10.1109/access.2017.2733557 article EN cc-by IEEE Access 2017-01-01

In this contribution, the Hashing bound of entanglement-assisted quantum channels is investigated in context devices built from a range popular materials, such as trapped ion and relying on solid state nuclear magnetic resonance, which can be modeled so-called asymmetric channel. Then, error correction codes (QECC) are designed based extrinsic information transfer charts for improving performance when employing these devices. The results also verified by simulations. Our QECC schemes capable...

10.1109/access.2016.2591910 article EN cc-by IEEE Access 2016-01-01

With the research on implementing a universal quantum computer being under technological spotlight, new possibilities appear for their employment in wireless communications systems reducing complexity and improving performance. In this treatise, we consider downlink of rank-deficient, multi-user system propose discrete-valued continuous-valued quantum-assisted particle swarm optimization (PSO) algorithms performing vector perturbation precoding, as well lowering required transmission power...

10.1109/access.2016.2591904 article EN cc-by IEEE Access 2016-01-01

Routing in wireless multihop networks (WMHNs) relies on a delicate balance of diverse and often conflicting parameters, when aiming for maximizing the WMHN performance. Classified as non-deterministic polynomial-time hard problem, routing WMHNs requires sophisticated methods. As benefit observing numerous variables parallel, quantum computing offers promising range algorithms complexity reduction by exploiting principle parallelism (QP), while achieving optimum full-search-based In fact,...

10.1109/access.2015.2478793 article EN cc-by-nc-nd IEEE Access 2015-01-01

In order to beneficially exploit the scarce wireless spectral resources, spectrum sharing between communication and radar systems has become a promising research topic. However, traditional network association strategies may not result in efficient hybrid systems. We circumvent this problem by formulating partially observable Markov decision processes (POMDP) aided scheme, where user acts as primary (PU), while cognitive is secondary (SU). For maximizing throughput, whilst minimizing...

10.1109/jsac.2019.2933778 article EN IEEE Journal on Selected Areas in Communications 2019-08-16

Joint channel estimation (CE) and multi-user detection (MUD) have become a crucial part of iterative receivers. In this paper, we propose quantum-assisted repeated weighted boosting search (QRWBS) algorithm for CE employ it in the uplink multiple-input multiple-output orthogonal frequency division multiplexing systems, conjunction with maximum posteriori probability (MAP) MUD near-optimal (QMUD). The performance QRWBS-aided is evaluated rank-deficient where number receive antenna elements...

10.1109/access.2016.2591903 article EN cc-by IEEE Access 2016-01-01

In this letter, we aim for maximizing the throughput of a visible light communication (VLC) system. Explicitly, conceive soft-in soft-out decoder providing soft feedback classic run length limited (RLL) codes, hence facilitating iterative decoding exchanging valuable extrinsic information between RLL and error correction modules VLC Furthermore, propose unity rate code our system, which, hence, becomes capable matching ON-OFF keying capacity, while maintaining flicker-free dimming value 50%.

10.1109/lpt.2016.2625808 article EN IEEE Photonics Technology Letters 2016-11-07

We conceive and investigate the family of classical topological error correction codes (TECCs), which have bits a codeword arranged in lattice structure. then present classical-to-quantum isomorphism to pave way for constructing their quantum dual pairs, namely, TECCs (QTECCs). Finally, we characterize performance QTECCs face depolarizing channel terms both quantum-bit rate (QBER) fidelity. Specifically, from our simulation results, threshold probability QBER curves color codes,...

10.1109/access.2017.2784417 article EN cc-by IEEE Access 2017-12-18

In large-dimensional wireless systems, such as cooperative multicell processing, millimeterwave, and massive MIMO or cells having a high user density, airports, train stations, metropolitan areas, sufficiently accurate estimation of all the channel gains is required for performing coherent detection.Therefore, they may impose an excessive complexity.As attractive design alternative, differential modulation relying on noncoherent detection be invoked eliminating requirement at base station,...

10.1109/access.2015.2432015 article EN cc-by-nc-nd IEEE Access 2015-01-01

Classical row-circulant quasi-cyclic (QC) low-density parity check (LDPC) matrices are known to generate efficient high-rate short and moderate-length QC-LDPC codes, while the comparable random structures exhibit numerous cycles of length-4. Therefore, we conceive a general formalism for constructing nondual-containing Calderbank-Shor-Steane (CSS)-type quantum (QLDPC) codes from arbitrary classical matrices. We apply our proposed balanced incomplete block design (BIBD)-based demonstrating...

10.1109/lcomm.2015.2494020 article EN IEEE Communications Letters 2015-12-10

Realistic public wireless channels and quantum key distribution (QKD) systems are amalgamated. Explicitly, we conceive network coding aided cooperative QKD over free space optical for improving the bit error ratio either rate or reliable operational distance. Our system has provided a 55% improvement against state-of-the-art benchmarker.

10.1109/access.2017.2712288 article EN cc-by IEEE Access 2017-01-01

Coordinated multi-point transmission/reception aided collocated antenna system (CoMP-CAS) and mobile relay assisted fractional frequency reuse distributed (MR-FFR-DAS) constitute a pair of virtual-MIMO based technical options for achieving high spectral efficiency in interference-limited cellular networks. In practice both techniques have their respective pros cons, which are studied this paper by evaluating the achievable cell-edge performance on uplink multicell systems. We show that...

10.1109/tvt.2015.2416333 article EN IEEE Transactions on Vehicular Technology 2015-03-25

The tradeoff between the quantum coding rate and associated error correction capability is characterized by bounds. unique solution for this does not exist, but corresponding lower upper bounds can be found in literature. In treatise, we survey existing provide new insights into classical to duality sake of deriving Moreover, propose an appealingly simple invertible analytical approximation, which describes minimum distance stabilizer codes. For example, a half-rate code having word length n...

10.1109/access.2017.2716367 article EN cc-by IEEE Access 2017-01-01

Wireless multihop networks (WMHNs) have to strike a trade-off among diverse and often conflicting quality-of-service requirements. The resultant solutions may be included by the Pareto front under concept of optimality. However, problem finding all Pareto-optimal routes in WMHNs is classified as non-deterministic polynomial-hard, since number legitimate increases exponentially, nodes proliferate. Quantum computing offers an attractive framework rendering routing tractable. In this context,...

10.1109/tcomm.2018.2803068 article EN cc-by IEEE Transactions on Communications 2018-02-06

The widespread use of mobile networking devices, such as smart phones and tablets, has substantially increased the number nodes in operational networks. These devices often suffer from lack power bandwidth. Hence, we have to optimize their message routing for sake maximizing capabilities. However, optimal typically relies on a delicate balance diverse conflicting objectives, route's delay consumption. network design also consider nodes' user-centric social behavior. employment socially aware...

10.1109/access.2016.2629671 article EN cc-by IEEE Access 2016-01-01
Coming Soon ...