arXiv subjects

John Thompson

Publications and source records attributed to John Thompson.

At least 37 records · Page 2Linked to original sources

arXiv2022

Low Complexity Channel estimation with Neural Network Solutions

Research on machine learning for channel estimation, especially neural network solutions for wireless communications, is attracting significant current interest. This is because conventional methods cannot meet the present demands of the high speed communication. In the paper, we deploy a general residual convolutional neural network to achieve channel estimation for the orthogonal frequency-division multiplexing (OFDM) signals in a downlink scenario. Our method also deploys a simple interpolation layer to replace the transposed convolutional layer used in other networks to reduce the computation cost. The proposed method is more easily adapted to different pilot patterns and packet sizes. Compared with other deep learning methods for channel estimation, our results for 3GPP channel models suggest improved mean squared error performance for our approach.

eess.SP↗

arXiv2020

Effects of Turbulence Induced Scattering on Underwater Optical Wireless Communications

This paper presents a comprehensive description of the relative effect of optical underwater turbulence in combination with absorption and scattering. Turbulence induced scattering is shown to cause and increase both spatial and temporal spreading at the receiver plane. It is also demonstrated that the relative impact of turbulence on a received signal is lower in a highly scattering channel. Received intensity distributions are presented confirming that fluctuations in received power from this method follow the commonly used Log-Normal fading model. The impact of turbulence induced scattering on maximum achievable data rate in the underwater channel is investigated.

eess.SP↗

arXiv2020

Knowledge Patterns

This paper describes a new technique, called "knowledge patterns", for helping construct axiom-rich, formal ontologies, based on identifying and explicitly representing recurring patterns of knowledge (theory schemata) in the ontology, and then stating how those patterns map onto domain-specific concepts in the ontology. From a modeling perspective, knowledge patterns provide an important insight into the structure of a formal ontology: rather than viewing a formal ontology simply as a list of terms and axioms, knowledge patterns views it as a collection of abstract, modular theories (the "knowledge patterns") plus a collection of modeling decisions stating how different aspects of the world can be modeled using those theories. Knowledge patterns make both those abstract theories and their mappings to the domain of interest explicit, thus making modeling decisions clear, and avoiding some of the ontological confusion that can otherwise arise. In addition, from a computational perspective, knowledge patterns provide a simple and computationally efficient mechanism for facilitating knowledge reuse. We describe the technique and an application built using them, and then critique its strengths and weaknesses. We conclude that this technique enables us to better explicate both the structure and modeling decisions made when constructing a formal axiom-rich ontology.

cs.AI↗

arXiv2020

Location-Enabled IoT (LE-IoT): A Survey of Positioning Techniques, Error Sources, and Mitigation

The Internet of Things (IoT) has started to empower the future of many industrial and mass-market applications. Localization techniques are becoming key to add location context to IoT data without human perception and intervention. Meanwhile, the newly-emerged Low-Power Wide-Area Network (LPWAN) technologies have advantages such as long-range, low power consumption, low cost, massive connections, and the capability for communication in both indoor and outdoor areas. These features make LPWAN signals strong candidates for mass-market localization applications. However, there are various error sources that have limited localization performance by using such IoT signals. This paper reviews the IoT localization system through the following sequence: IoT localization system review -- localization data sources -- localization algorithms -- localization error sources and mitigation -- localization performance evaluation. Compared to the related surveys, this paper has a more comprehensive and state-of-the-art review on IoT localization methods, an original review on IoT localization error sources and mitigation, an original review on IoT localization performance evaluation, and a more comprehensive review of IoT localization applications, opportunities, and challenges. Thus, this survey provides comprehensive guidance for peers who are interested in enabling localization ability in the existing IoT systems, using IoT systems for localization, or integrating IoT signals with the existing localization sensors.

cs.NI↗

arXiv2020

Energy Efficiency Maximization in Millimeter Wave Hybrid MIMO Systems for 5G and Beyond

At millimeter wave (mmWave) frequencies, the higher cost and power consumption of hardware components in multiple-input multiple output (MIMO) systems do not allow beamforming entirely at the baseband with a separate radio frequency (RF) chain for each antenna. In such scenarios, to enable spatial multiplexing, hybrid beamforming, which uses phase shifters to connect a fewer number of RF chains to a large number of antennas is a cost effective and energy-saving alternative. This paper describes our research on fully adaptive transceivers that adapt their behaviour on a frame-by-frame basis, so that a mmWave hybrid MIMO system always operates in the most energy efficient manner. Exhaustive search based brute force approach is computationally intensive, so we study fractional programming as a low-cost alternative to solve the problem which maximizes energy efficiency. The performance results indicate that the resulting mmWave hybrid MIMO transceiver achieves significantly improved energy efficiency results compared to the baseline cases involving analogue-only or digital-only signal processing solutions, and shows performance trade-offs with the brute force approach.

eess.SP↗

arXiv2020

Joint Bit Allocation and Hybrid Beamforming Optimization for Energy Efficient Millimeter Wave MIMO Systems

In this paper, we aim to design highly energy efficient end-to-end communication for millimeter wave multiple-input multiple-output systems. This is done by jointly optimizing the digital-to-analog converter (DAC)/analog-to-digital converter (ADC) bit resolutions and hybrid beamforming matrices. The novel decomposition of the hybrid precoder and the hybrid combiner to three parts is introduced at the transmitter (TX) and the receiver (RX), respectively, representing the analog precoder/combiner matrix, the DAC/ADC bit resolution matrix and the baseband precoder/combiner matrix. The unknown matrices are computed as a solution to the matrix factorization problem where the optimal fully digital precoder or combiner is approximated by the product of these matrices. A novel and efficient solution based on the alternating direction method of multipliers is proposed to solve these problems at both the TX and the RX. The simulation results show that the proposed solution, where the DAC/ADC bit allocation is dynamic during operation, achieves higher energy efficiency when compared with existing benchmark techniques that use fixed DAC/ADC bit resolutions.

eess.SP↗

arXiv2019

Energy Efficient ADC Bit Allocation and Hybrid Combining for Millimeter Wave MIMO Systems

Low resolution analog-to-digital converters (ADCs) can be employed to improve the energy efficiency (EE) of a wireless receiver since the power consumption of each ADC is exponentially related to its sampling resolution and the hardware complexity. In this paper, we aim to jointly optimize the sampling resolution, i.e., the number of ADC bits, and analog/digital hybrid combiner matrices which provides highly energy efficient solutions for millimeter wave multiple-input multiple output systems. A novel decomposition of the hybrid combiner to three parts is introduced: the analog combiner matrix, the bit resolution matrix and the baseband combiner matrix. The unknown matrices are computed as the solution to a matrix factorization problem where the optimal, fully digital combiner is approximated by the product of these matrices. An efficient solution based on the alternating direction method of multipliers is proposed to solve this problem. The simulation results show that the proposed solution achieves high EE performance when compared with existing benchmark techniques that use fixed ADC resolutions.

eess.SP↗

arXiv2019

A Bayesian hierarchical meta-analytic method for modelling surrogate relationships that vary across treatment classes using aggregate data

Surrogate endpoints play an important role in drug development when they can be used to measure treatment effect early compared to the final clinical outcome and to predict clinical benefit or harm. Such endpoints are assessed for their predictive value of clinical benefit by investigating the surrogate relationship between treatment effects on the surrogate and final outcomes using meta-analytic methods. When surrogate relationships vary across treatment classes, such validation may fail due to limited data within each treatment class. In this paper, two alternative Bayesian meta-analytic methods are introduced which allow for borrowing of information from other treatment classes when exploring the surrogacy in a particular class. The first approach extends a standard model for the evaluation of surrogate endpoints to a hierarchical meta-analysis model assuming full exchangeability of surrogate relationships across all the treatment classes, thus facilitating borrowing of information across the classes. The second method is able to relax this assumption by allowing for partial exchangeability of surrogate relationships across treatment classes to avoid excessive borrowing of information from distinctly different classes. We carried out a simulation study to assess the proposed methods in nine data scenarios and compared them with subgroup analysis using the standard model within each treatment class. We also applied the methods to an illustrative example in colorectal cancer which led to obtaining the parameters describing the surrogate relationships with higher precision.

stat.ME↗

arXiv2019

Critical Reflections on Visualization Authoring Systems

An emerging generation of visualization authoring systems support expressive information visualization without textual programming. As they vary in their visualization models, system architectures, and user interfaces, it is challenging to directly compare these systems using traditional evaluative methods. Recognizing the value of contextualizing our decisions in the broader design space, we present critical reflections on three systems we developed -- Lyra, Data Illustrator, and Charticulator. This paper surfaces knowledge that would have been daunting within the constituent papers of these three systems. We compare and contrast their (previously unmentioned) limitations and trade-offs between expressivity and learnability. We also reflect on common assumptions that we made during the development of our systems, thereby informing future research directions in visualization authoring systems.

cs.HC↗

arXiv2019

A User-based Visual Analytics Workflow for Exploratory Model Analysis

Many visual analytics systems allow users to interact with machine learning models towards the goals of data exploration and insight generation on a given dataset. However, in some situations, insights may be less important than the production of an accurate predictive model for future use. In that case, users are more interested in generating of diverse and robust predictive models, verifying their performance on holdout data, and selecting the most suitable model for their usage scenario. In this paper, we consider the concept of Exploratory Model Analysis (EMA), which is defined as the process of discovering and selecting relevant models that can be used to make predictions on a data source. We delineate the differences between EMA and the well-known term exploratory data analysis in terms of the desired outcome of the analytic process: insights into the data or a set of deployable models. The contributions of this work are a visual analytics system workflow for EMA, a user study, and two use cases validating the effectiveness of the workflow. We found that our system workflow enabled users to generate complex models, to assess them for various qualities, and to select the most relevant model for their task.

cs.HC↗

arXiv2019

Massive MIMO Channel Estimation for Millimeter Wave Systems via Matrix Completion

Millimeter Wave (mmWave) massive Multiple Input Multiple Output (MIMO) systems realizing directive beamforming require reliable estimation of the wireless propagation channel. However, mmWave channels are characterized by high variability that severely challenges their recovery over short training periods. Current channel estimation techniques exploit either the channel sparsity in the beamspace domain or its low rank property in the antenna domain, nevertheless, they still require large numbers of training symbols for satisfactory performance. In this paper, we present a novel channel estimation algorithm that jointly exploits the latter two properties of mmWave channels to provide more accurate recovery, especially for shorter training intervals. The proposed iterative algorithm is based on the Alternating Direction Method of Multipliers (ADMM) and provides the global optimum solution to the considered convex mmWave channel estimation problem with fast convergence properties.

cs.IT↗

arXiv2018

Joint Optimization of Computation and Communication Power in Multi-user Massive MIMO Systems

With the growing interest in the deployment of massive multiple-input-multiple-output (MIMO) systems and millimeter wave technology for fifth generation (5G) wireless systems, the computation power to the total power consumption ratio is expected to increase rapidly due to high data traffic processing at the baseband unit. Therefore in this paper, a joint optimization problem of computation and communication power is formulated for multi-user massive MIMO systems with partially-connected structures of radio frequency (RF) transmission systems. When the computation power is considered for massiv MIMO systems, the results of this paper reveal that the energy efficiency of massive MIMO systems decreases with increasing the number of antennas and RF chains, which is contrary with the conventional energy efficiency analysis results of massive MIMO systems, i.e., only communication power is considered. To optimize the energy efficiency of multi-user massive MIMO systems, an upper bound on energy efficiency is derived. Considering the constraints on partially-connected structures, a suboptimal solution consisting of baseband and RF precoding matrices is proposed to approach the upper bound on energy efficiency of multi-user massive MIMO systems. Furthermore, an oPtimized Hybrid precOding with computation and commuNication powEr (PHONE) algorithm is developed to realize the joint optimization of computation and communication power. Simulation results indicate that the proposed algorithm improves energy and cost efficiencies and the maximum power saving is achieved by 76.59\% for multi-user massive MIMO systems with partially-connected structures.

cs.NI↗

arXiv2017

Sensor scheduling with time, energy and communication constraints

In this paper we present new algorithms and analysis for the linear inverse sensor placement and scheduling problems over multiple time instances with power and communications constraints. The proposed algorithms, which deal directly with minimizing the mean squared error (MSE), are based on the convex relaxation approach to address the binary optimization scheduling problems that are formulated in sensor network scenarios. We propose to balance the energy and communications demands of operating a network of sensors over time while we still guarantee a minimum level of estimation accuracy. We measure this accuracy by the MSE for which we provide average case and lower bounds analyses that hold in general, irrespective of the scheduling algorithm used. We show experimentally how the proposed algorithms perform against state-of-the-art methods previously described in the literature.

cs.IT↗

arXiv2017

Learning Fast Sparsifying Transforms

Given a dataset, the task of learning a transform that allows sparse representations of the data bears the name of dictionary learning. In many applications, these learned dictionaries represent the data much better than the static well-known transforms (Fourier, Hadamard etc.). The main downside of learned transforms is that they lack structure and therefore they are not computationally efficient, unlike their classical counterparts. These posse several difficulties especially when using power limited hardware such as mobile devices, therefore discouraging the application of sparsity techniques in such scenarios. In this paper we construct orthogonal and non-orthogonal dictionaries that are factorized as a product of a few basic transformations. In the orthogonal case, we solve exactly the dictionary update problem for one basic transformation, which can be viewed as a generalized Givens rotation, and then propose to construct orthogonal dictionaries that are a product of these transformations, guaranteeing their fast manipulation. We also propose a method to construct fast square but non-orthogonal dictionaries that are factorized as a product of few transforms that can be viewed as a further generalization of Givens rotations to the non-orthogonal setting. We show how the proposed transforms can balance very well data representation performance and computational complexity. We also compare with classical fast and learned general and orthogonal transforms.

cs.LG↗

arXiv2016

Capacity and Delay Tradeoff of Secondary Cellular Networks with Spectrum Aggregation

Cellular communication networks are plagued with redundant capacity, which results in low utilization and cost-effectiveness of network capital investments. The redundant capacity can be exploited to deliver secondary traffic that is ultra-elastic and delay-tolerant. In this paper, we propose an analytical framework to study the capacity-delay tradeoff of elastic/secondary traffic in large scale cellular networks with spectrum aggregation. Our framework integrates stochastic geometry and queueing theory models and gives analytical insights into the capacity-delay performance in the interference limited regime. Closed-form results are obtained to characterize the mean delay and delay distribution as functions of per user throughput capacity. The impacts of spectrum aggregation, user and base station (BS) densities, traffic session payload, and primary traffic dynamics on the capacity-delay tradeoff relationship are investigated. The fundamental capacity limit is derived and its scaling behavior is revealed. Our analysis shows the feasibility of providing secondary communication services over cellular networks and highlights some critical design issues.

cs.NI↗

arXiv2016

Wireless Fractal Cellular Networks

With the seamless coverage of wireless cellular networks in modern society, it is interesting to consider the shape of wireless cellular coverage. Is the shape a regular hexagon, an irregular polygon, or another complex geometrical shape? Based on fractal theory, the statistical characteristic of the wireless cellular coverage boundary is determined by the measured wireless cellular data collected from Shanghai, China. The measured results indicate that the wireless cellular coverage boundary presents an extremely irregular geometrical shape, which is also called a statistical fractal shape. Moreover, the statistical fractal characteristics of the wireless cellular coverage boundary have been validated by values of the Hurst parameter estimated in angular scales. The statistical fractal characteristics of the wireless cellular coverage boundary can be used to evaluate and design the handoff scheme of mobile user terminals in wireless cellular networks.

cs.NI↗

arXiv2016

Energy Efficiency Optimization of 5G Radio Frequency Chain Systems

With the massive multi-input multi-output (MIMO) antennas technology adopted for the fifth generation (5G) wireless communication systems, a large number of radio frequency (RF) chains have to be employed for RF circuits. However, a large number of RF chains not only increase the cost of RF circuits but also consume additional energy in 5G wireless communication systems. In this paper we investigate energy and cost efficiency optimization solutions for 5G wireless communication systems with a large number of antennas and RF chains. An energy efficiency optimization problem is formulated for 5G wireless communication systems using massive MIMO antennas and millimeter wave technology. Considering the nonconcave feature of the objective function, a suboptimal iterative algorithm, i.e., the energy efficient hybrid precoding (EEHP) algorithm is developed for maximizing the energy efficiency of 5G wireless communication systems. To reduce the cost of RF circuits, the energy efficient hybrid precoding with the minimum number of RF chains (EEHP-MRFC) algorithm is also proposed. Moreover, the critical number of antennas searching (CNAS) and user equipment number optimization (UENO) algorithms are further developed to optimize the energy efficiency of 5G wireless communication systems by the number of transmit antennas and UEs. Compared with the maximum energy efficiency of conventional zero-forcing (ZF) precoding algorithm, numerical results indicate that the maximum energy efficiency of the proposed EEHP and EEHP-MRFC algorithms are improved by 220% and 171%, respectively.

cs.NI↗

arXiv2015

5G green cellular networks considering power allocation schemes

It is important to assess the effect of transmit power allocation schemes on the energy consumption on random cellular networks. The energy efficiency of 5G green cellular networks with average and water-filling power allocation schemes is studied in this paper. Based on the proposed interference and achievable rate model, an energy efficiency model is proposed for MIMO random cellular networks. Furthermore, the energy efficiency with average and water-filling power allocation schemes are presented, respectively. Numerical results indicate that the maximum limits of energy efficiency are always there for MIMO random cellular networks with different intensity ratios of mobile stations (MSs) to base stations (BSs) and channel conditions. Compared with the average power allocation scheme, the water-filling scheme is shown to improve the energy efficiency of MIMO random cellular networks when channel state information (CSI) is attainable for both transmitters and receivers.

cs.NI↗