arXiv subjects

Liang Liu

Publications and source records attributed to Liang Liu.

At least 271 records · Page 15Linked to original sources

arXiv2018

Channel Diagonalization for Cloud Radio Access

The diagonalization of a conventional multiple-input multiple-output (MIMO) channel into parallel and independent subchannels via singular value decomposition (SVD) is a fundamental strategy that allows the MIMO channel capacity to be achieved using scalar channel codes. This letter establishes a similar channel diagonalization result for the uplink and the downlink of a cloud radio access network (C-RAN), in which a central processor (CP) is connected to a remote radio head (RRH) serving a single user via rate-limit digital fronthaul carrying the compressed baseband signal. Specifically, we show that the diagonalization of the MIMO channel between the RRH and the user via SVD and the subsequent independent and parallel quantization of scalar signals and channel coding in each of the subchannels is optimal. This letter establishes this fact using the majorization theory. Further, an uplink-downlink duality for the multiple-antenna C-RAN is identified for this single-user case.

cs.IT↗

arXiv2018

Achievable Rates and Training Overheads for a Measured LOS Massive MIMO Channel

This paper presents achievable uplink (UL) sumrate predictions for a measured line-of-sight (LOS) massive multiple-input, multiple-output (MIMO) (MMIMO) scenario and illustrates the trade-off between spatial multiplexing performance and channel de-coherence rate for an increasing number of base station (BS) antennas. In addition, an orthogonal frequency division multiplexing (OFDM) case study is formed which considers the 90% coherence time to evaluate the impact of MMIMO channel training overheads in high-speed LOS scenarios. It is shown that whilst 25% of the achievable zero-forcing (ZF) sumrate is lost when the resounding interval is increased by a factor of 4, the OFDM training overheads for a 100-antenna MMIMO BS using an LTE-like physical layer could be as low as 2% for a terminal speed of 90m/s.

cs.IT↗

arXiv2018

Joint Task Assignment and Wireless Resource Allocation for Cooperative Mobile-Edge Computing

This paper studies a multi-user cooperative mobile-edge computing (MEC) system, in which a local mobile user can offload intensive computation tasks to multiple nearby edge devices serving as helpers for remote execution. We focus on the scenario where the local user has a number of independent tasks that can be executed in parallel but cannot be further partitioned. We consider a time division multiple access (TDMA) communication protocol, in which the local user can offload computation tasks to the helpers and download results from them over pre-scheduled time slots. Under this setup, we minimize the local user's computation latency by optimizing the task assignment jointly with the time and power allocations, subject to individual energy constraints at the local user and the helpers. However, the joint task assignment and wireless resource allocation problem is a mixed-integer non-linear program (MINLP) that is hard to solve optimally. To tackle this challenge, we first relax it into a convex problem, and then propose an efficient suboptimal solution based on the optimal solution to the relaxed convex problem. Finally, numerical results show that our proposed joint design significantly reduces the local user's computation latency, as compared against other benchmark schemes that design the task assignment separately from the offloading/downloading resource allocations and local execution.

eess.SP↗

arXiv2018

A hybrid architecture for astronomical computing

With many large science equipment constructing and putting into use, astronomy has stepped into the big data era. The new method and infrastructure of big data processing has become a new requirement of many astronomers. Cloud computing, Map/Reduce, Hadoop, Spark, etc. many new technology has sprung up in recent years. Comparing to the high performance computing(HPC), Data is the center of these new technology. So, a new computing architecture infrastructure is necessary, which can be shared by both HPC and big data processing. Based on Astronomy Cloud project of Chinese Virtual Observatory (China-VO), we have made much efforts to optimize the designation of the hybrid computing platform. which include the hardware architecture, cluster management, Job and Resource scheduling.

cs.DC↗

arXiv2017

Better Algorithms for Hybrid Circuit and Packet Switching in Data Centers

Hybrid circuit and packet switching for data center networking (DCN) has received considerable research attention recently. A hybrid-switched DCN employs a much faster circuit switch that is reconfigurable with a nontrivial cost, and a much slower packet switch that is reconfigurable with no cost, to interconnect its racks of servers. The research problem is, given a traffic demand matrix (between the racks), how to compute a good circuit switch configuration schedule so that the vast majority of the traffic demand is removed by the circuit switch, leaving a remaining demand matrix that contains only small elements for the packet switch to handle. In this paper, we propose two new hybrid switch scheduling algorithms under two different scheduling constraints. Our first algorithm, called 2-hop Eclipse, strikes a much better tradeoff between the resulting performance (of the hybrid switch) and the computational complexity (of the algorithm) than the state of the art solution Eclipse/Eclipse++. Our second algorithm, called BFF (best first fit), is the first hybrid switching solution that exploits the potential partial reconfiguration capability of the circuit switch for performance gains.

cs.NI↗

arXiv2017

A new mechanism of long-term period variations for W UMa-type contact binaries

W UMa-type contact binaries belong to close binary systems whose components exactly overflow their Roche lobes and share a common convective envelope (CCE). In the last twenty years, the long-term variations of their orbital periods have been thought to depend on several mechanisms. Now, we suggest a new mechanism: CCE-dominated mechanism. The CCE-dominated mechanism is found based on our numerical result, especially at high mass ratios, that the orbital periods (P) of contact binaries change very much with their fill-out factors (f). Because f is taken as a measurement of the thickness of CCE, the physical cause for the variation of P is a mass transfer between CCE and components. Further, an f-dominated simplification model for this mechanism is introduced. According to it, P may change in a long-term oscillation way with a similar time scale of the thermal modulation, meanwhile q is decreasing slowly till the two components merge. It could be also applied to explain the presence of extremely short period, high mass ratio and deep contact binaries. Moreover, the CCE-dominated mechanism should always work due to mass transfer and mass loss both occurring via CCE. Therefor, the effect of CCE on the variations of orbital periods may have been underestimated before.

astro-ph.SR↗

arXiv2017

An efficient deep learning hashing neural network for mobile visual search

Mobile visual search applications are emerging that enable users to sense their surroundings with smart phones. However, because of the particular challenges of mobile visual search, achieving a high recognition bitrate has becomes a consistent target of previous related works. In this paper, we propose a few-parameter, low-latency, and high-accuracy deep hashing approach for constructing binary hash codes for mobile visual search. First, we exploit the architecture of the MobileNet model, which significantly decreases the latency of deep feature extraction by reducing the number of model parameters while maintaining accuracy. Second, we add a hash-like layer into MobileNet to train the model on labeled mobile visual data. Evaluations show that the proposed system can exceed state-of-the-art accuracy performance in terms of the MAP. More importantly, the memory consumption is much less than that of other deep learning models. The proposed method requires only $13$ MB of memory for the neural network and achieves a MAP of $97.80\%$ on the mobile location recognition dataset used for testing.

cs.CV↗

arXiv2017

Tests of Cold Atom Clock in Orbit

Since the atomic clock was invented, its performance has been improved for one digit every decade until 90s of last century when the traditional atomic clock almost reached its limit. With laser cooled atoms, the performance can be further improved, and nowadays the cold atom based clocks are widely used as primary frequency standards. Such a kind of cold atom clocks has great applications in space. This paper presents the design and tests of a cold atom clock (CAC) operating in space. In microgravity, the atoms are cooled, trapped, launched and finally detected after being interrogated by microwave field with Ramsey method. The results of laser cooling of atoms in microgravity in orbit are presented and compared with that on ground for the first time. That the full width at half maximum (FWHM) of obtained central Ramsey fringes varies linearly with launching velocity of cold atoms shows the effects of microgravity. With appropriate parameters, a closed-loop locking of the CAC is realized in orbit and the estimated short term frequency stability of $3.0\times 10 ^{-13}/\sqrt{τ}$ has been reached.

physics.atom-ph↗

arXiv2017

Polarization induced interference within electromagnetically induced transparency for atoms of double-V linkage

People have been paying attention to the role of atoms' complex internal level structures in the research of electromagnetically induced transparency (EIT) for a long time, where the various degenerate Zeeman levels usually generate complex linkage patterns for the atomic transitions. It turns out, with special choices of the atomic states and the atomic transitions' linkage structure, clear signatures of quantum interference induced by the probe and coupling light's polarizations can emerge from a typical EIT phenomena. We propose to study a four state system with double-V linkage pattern for the transitions and analyze the polarization induced interference under the EIT condition. We show that such interference arises naturally under mild conditions on the optical field and atom manipulation. Its anticipated properties and its potential application of all optical switching in polarization degree of freedom are also discussed. Moreover, we construct a variation form of double-M linkage pattern where the polarization induced interference enables polarization-dependent cross-modulation between incident lights that can be effective even at the few-photon level. The theme is to gain more insight into the essential question: how can we build non-trivial optical medium where incident lights will induce polarization-dependent non-linear optical interactions, covering a wide range of the incidence intensity from the many-photon level to the few-photon level, respectively.

physics.atom-ph↗

arXiv2017

Performance Characterization of a Real-Time Massive MIMO System with LOS Mobile Channels

The first measured results for massive MIMO performance in a line-of-sight (LOS) scenario with moderate mobility are presented, with 8 users served in real-time using a 100-antenna base Station (BS) at 3.7 GHz. When such a large number of channels dynamically change, the inherent propagation and processing delay has a critical relationship with the rate of change, as the use of outdated channel information can result in severe detection and precoding inaccuracies. For the downlink (DL) in particular, a time division duplex (TDD) configuration synonymous with massive multiple-input, multiple-output (MIMO) deployments could mean only the uplink (UL) is usable in extreme cases. Therefore, it is of great interest to investigate the impact of mobility on massive MIMO performance and consider ways to combat the potential limitations. In a mobile scenario with moving cars and pedestrians, the massive MIMO channel is sampled across many points in space to build a picture of the overall user orthogonality, and the impact of both azimuth and elevation array configurations are considered. Temporal analysis is also conducted for vehicles moving up to 29km/h and real-time bit error rates (BERs) for both the UL and DL without power control are presented. For a 100-antenna system, it is found that the channel state information (CSI) update rate requirement may increase by 7 times when compared to an 8-antenna system, whilst the power control update rate could be decreased by at least 5 times relative to a single antenna system.

cs.IT↗

arXiv2017

The World's First Real-Time Testbed for Massive MIMO: Design, Implementation, and Validation

This paper sets up a framework for designing a massive multiple-input multiple-output (MIMO) testbed by investigating hardware (HW) and system-level requirements such as processing complexity, duplexing mode and frame structure. Taking these into account, a generic system and processing partitioning is proposed which allows flexible scaling and processing distribution onto a multitude of physically separated devices. Based on the given HW constraints such as maximum number of links and maximum throughput for peer-to-peer interconnections combined with processing capabilities, the framework allows to evaluate modular HW components. To verify our design approach, we present the LuMaMi (Lund University Massive MIMO) testbed which constitutes the first reconfigurable real-time HW platform for prototyping massive MIMO. Utilizing up to 100 base station antennas and more than 50 Field Programmable Gate Arrays, up to 12 user equipments are served on the same time/frequency resource using an LTE-like Orthogonal Frequency Division Multiplexing time-division duplex-based transmission scheme. Proof-of-concept tests with this system show that massive MIMO can simultaneously serve a multitude of users in a static indoor and static outdoor environment utilizing the same time/frequency resource.

cs.IT↗

arXiv2017

Modeling of Information Diffusion on Social Networks with Applications to WeChat

Traces of user activities recorded in online social networks such as the creation, viewing and forwarding/sharing of information over time open new possibilities to quantitatively and systematically understand the information diffusion process on social networks. From an online social network like WeChat, we could collect a large number of information cascade trees, each of which tells the spreading trajectory of a message/information such as which user creates the information and which users view or forward the information shared by which neighbors. In this work, we propose two heterogeneous non-linear models. Both models are validated by the WeChat data in reproducing and explaining key features of cascade trees. Specifically, we firstly apply the Random Recursive Tree (RRT) to model the cascade tree topologies, capturing key features, i.e. the average path length and degree variance of a cascade tree in relation to the number of nodes (size) of the tree. The RRT model with a single parameter $θ$ describes the growth mechanism of a tree, where a node in the existing tree has a probability $d_i^θ$ of being connected to a newly added node that depends on the degree $d_i$ of the existing node. The identified parameter $θ$ quantifies the relative depth or broadness of the cascade trees, indicating that information propagates via a star-like broadcasting or viral-like hop by hop spreading. The RRT model explains the appearance of hubs, thus a possibly smaller average path length as the cascade size increases, as observed in WeChat. We further propose the stochastic Susceptible View Forward Removed (SVFR) model to depict the dynamic user behaviors including creating, viewing, forwarding and ignoring a message on a given social network.

cs.SI↗

arXiv2017

Topological phase transition and interface states in hybrid plasmonic-photonic systems

The geometric phase and topological property for one-dimensional hybrid plasmonic-photonic crystals consisting of a simple lattice of graphene sheets are investigated systematically. For transverse magnetic waves, both plasmonic and photonic modes exist in the momentum space. The accidental degeneracy point of these two kinds of modes is identified to be a diabolic point accompanied with a topological phase transition. For a closed loop around this degeneracy point, the Berry phase is Pi as a consequence of the discontinuous jump of the geometric Zak phase. The wave impedance is calculated analytically for the semi-infinite system, and the corresponding topological interface states either start from or terminate at the degeneracy point. This type of localized interface states may find potential applications in photonics and plasmonics.

physics.optics↗

arXiv2017

Temporal Analysis of Measured LOS Massive MIMO Channels with Mobility

The first measured results for massive multiple-input, multiple-output (MIMO) performance in a line-of-sight (LOS) scenario with moderate mobility are presented, with 8 users served by a 100 antenna base Station (BS) at 3.7 GHz. When such a large number of channels dynamically change, the inherent propagation and processing delay has a critical relationship with the rate of change, as the use of outdated channel information can result in severe detection and precoding inaccuracies. For the downlink (DL) in particular, a time division duplex (TDD) configuration synonymous with massive MIMO deployments could mean only the uplink (UL) is usable in extreme cases. Therefore, it is of great interest to investigate the impact of mobility on massive MIMO performance and consider ways to combat the potential limitations. In a mobile scenario with moving cars and pedestrians, the correlation of the MIMO channel vector over time is inspected for vehicles moving up to 29 km/h. For a 100 antenna system, it is found that the channel state information (CSI) update rate requirement may increase by 7 times when compared to an 8 antenna system, whilst the power control update rate could be decreased by at least 5 times relative to a single antenna system.

cs.IT↗

arXiv2017

Reciprocity Calibration for Massive MIMO: Proposal, Modeling and Validation

This paper presents a mutual coupling based calibration method for time-division-duplex massive MIMO systems, which enables downlink precoding based on uplink channel estimates. The entire calibration procedure is carried out solely at the base station (BS) side by sounding all BS antenna pairs. An Expectation-Maximization (EM) algorithm is derived, which processes the measured channels in order to estimate calibration coefficients. The EM algorithm outperforms current state-of-the-art narrow-band calibration schemes in a mean squared error (MSE) and sum-rate capacity sense. Like its predecessors, the EM algorithm is general in the sense that it is not only suitable to calibrate a co-located massive MIMO BS, but also very suitable for calibrating multiple BSs in distributed MIMO systems. The proposed method is validated with experimental evidence obtained from a massive MIMO testbed. In addition, we address the estimated narrow-band calibration coefficients as a stochastic process across frequency, and study the subspace of this process based on measurement data. With the insights of this study, we propose an estimator which exploits the structure of the process in order to reduce the calibration error across frequency. A model for the calibration error is also proposed based on the asymptotic properties of the estimator, and is validated with measurement results.

cs.IT↗

arXiv2017

Joint DOA and Frequency Estimation with Sub-Nyquist Sampling

In this paper, to jointly estimate the frequency and the direction-of-arrival(DOA) of the narrowband far-field signals, a novel array receiver architecture is presented by the concept of the sub-Nyquist sampling techniques. In particular, our contribution is threefold. i) First, we propose a time-space union signal reception model for receiving array signals, where the sub-Nyquist sampling techniques and arbitrary array geometries are employed to decrease the time-domain sampling rate and improve the DOA estimation accuracy. A better joint estimation is obtained in the higher time-space union space. ii) Second, two joint estimation algorithms are proposed for the receiving model. One is based on a trilinear decomposition from the third-order tensor theory and the other is based on subspace decomposition. iii) Third, we derive the corresponding Cramér\text{-}Rao Bound (CRB) for frequency and DOA estimates. In the case of the branch number of our architecture is equal to the reduction factor of the sampling rate, it is observed that the CRB is robust in terms of the number of signals, while the CRB based on the Nyquist sampling scheme will increase with respect to the number of signals. In addition, the new steer vectors of the union time-space model are completely uncorrelated under the limited number of sensors, which improves the estimation performance. Furthermore, the simulation results demonstrate that our estimates via the receiver architecture associated with the proposed algorithms closely match the CRB according to the noise levels, the branch number and the source number as well.

cs.IT↗

arXiv2017

Joint DOA and Frequency Estimation with Sub-Nyquist Sampling for More Sources than Sensors

In this letter, we apply previous array receiver architecture which employs time-domain sub-Nyquist sampling techniques to jointly estimate frequency and direction-of-arrival(DOA) of narrowband far-field signals. Herein, a more general situation is taken into consideration, where there may be more than one signal in a subband. We build time-space union model, analyze the identification of the model, and give the maximum signal number which can be classified. We also proof that the Cramer-Rao Bound (CRB) is lower than that of which employs Nyquist sampling. Simulation results verify the capacity to estimate the number of sources. Meanwhile, simulations show that our estimation performance closely matches the CRB and is superior for more sources than sensors, especially when the minimum redundancy array (MRA) is employed.

cs.IT↗

arXiv2017

AstroCloud: A Distributed Cloud Computing and Application Platform for Astronomy

Virtual Observatory (VO) is a data-intensively online astronomical research and education environment, which takes advantages of advanced information technologies to achieve seamless and global access to astronomical information. AstroCloud is a cyber-infrastructure for astronomy research initiated by Chinese Virtual Observatory (China-VO) project, and also a kind of physical distributed platform which integrates lots of tasks such as telescope access proposal management, data archiving, data quality control, data release and open access, cloud based data processing and analysis. It consists of five application channels, i.e. observation, data, tools, cloud and public and is acting as a full lifecycle management system and gateway for astronomical data and telescopes. Physically, the platform is hosted in six cities currently, i.e. Beijing, Nanjing, Shanghai, Kunming, Lijiang and Urumqi, and serving more than 17 thousand users. Achievements from international Virtual Observatories and Cloud Computing are adopted heavily. In the paper, backgrounds of the project, architecture, Cloud Computing environment, key features of the system, current status and future plans are introduced.

astro-ph.IM↗