arXiv subjects

Wen Chen

Publications and source records attributed to Wen Chen.

At least 451 records · Page 25Linked to original sources

arXiv2018

A time-space Hausdorff fractal model for non-Fickian transport in porous media

This paper presents a time-space Hausdorff derivative model for depicting solute transport in aquifers or water flow in heterogeneous porous media. In this model, the time and space Hausdorff derivatives are defined on non-Euclidean fractal metrics with power law scaling transform which, respectively, connect the temporal and spatial complexity during transport. The Hausdorff derivative model can be transformed to an advection-dispersion equation with time- and space-dependent dispersion and convection coefficients. This model is a fractal partial differential equation (PDE) defined on a fractal space and differs from the fractional PDE which is derived for non-local transport of particles on a non-fractal Euclidean space. As an example of applications of this model, an explicit solution with a constant diffusion coefficient and flow velocity subject to an instantaneous source is derived and fitted to the breakthrough curves of tritium as a tracer in porous media. These results are compared with those of a scale-dependent dispersion model and a time-scale dependent dispersion model. Overall, it is found that the fractal PDE based on the Hausdorff derivatives better captures the early arrival and heavy tail in the scaled breakthrough curves for variable transport distances. The estimated parameters in the fractal Hausrdorff model represent clear physical mechanisms such as linear relationships between the orders of Hausdorff derivatives and the transport distance. The mathematical formulation is applicable to both solute transport and water flow in porous media.

physics.flu-dyn↗

arXiv2018

Polar Coding Strategies for the Interference Channel with Partially-Joint Decoding

Existing polar coding schemes for the two-user interference channel follow the original idea of Han and Kobayashi, in which component messages are encoded independently and then mapped by some deterministic functions (i.e., homogeneous superposition coding). In this paper, we propose a new polar coding scheme for the interference channel based on the heterogeneous superposition coding approach of Chong, Motani and Garg. We prove that fully-joint decoding (the receivers simultaneously decode both senders' common messages and the intended sender's private message) in the Han-Kobayashi strategy can be simplified to two types of partially-joint decoding, which are friendly to polar coding with practical decoding algorithms. The proposed coding scheme requires less auxiliary random variables and no deterministic functions, and can be efficiently constructed. Further, we extend this result to interference networks and show that the proposed partially-joint decoding scheme is a general method for designing heterogeneous superposition polar coding schemes in interference networks.

cs.IT↗

arXiv2018

Secure SWIPT for Directional Modulation Aided AF Relaying Networks

Secure wireless information and power transfer based on directional modulation is conceived for amplify-and-forward (AF) relaying networks. Explicitly, we first formulate a secrecy rate maximization (SRM) problem, which can be decomposed into a twin-level optimization problem and solved by a one-dimensional (1D) search and semidefinite relaxation (SDR) technique. Then in order to reduce the search complexity, we formulate an optimization problem based on maximizing the signal-to-leakage-AN-noise-ratio (Max-SLANR) criterion, and transform it into a SDR problem. Additionally, the relaxation is proved to be tight according to the classic Karush-Kuhn-Tucker (KKT) conditions. Finally, to reduce the computational complexity, a successive convex approximation (SCA) scheme is proposed to find a near-optimal solution. The complexity of the SCA scheme is much lower than that of the SRM and the Max-SLANR schemes. Simulation results demonstrate that the performance of the SCA scheme is very close to that of the SRM scheme in terms of its secrecy rate and bit error rate (BER), but much better than that of the zero forcing (ZF) scheme.

cs.IT↗

arXiv2018

Interstellar Scintillation observations for PSR B0355+54

In this paper, we report our investigation of pulsar scintillation phenomena by monitoring PSR B0355$+$54 at 2.25 GHz for three successive months using \emph{Kunming 40-m radio telescope}. We have measured the dynamic spectrum, the two-dimensional correlation function, and the secondary spectrum. In those observations with high signal-to-noise ratio ($S/N\ge100$), we have detected the scintillation arcs, which are rarely observable using such a small telescope. The sub-microsecond scale width of the scintillation arc indicates that the transverse scale of structures on scattering screen is as compact as AU size. Our monitoring has also shown that both the scintillation bandwidth, timescale, and arc curvature of PSR B0355$+$54 were varying temporally. The plausible explanation would need to invoke multiple-scattering-screen or multiple-scattering-structure scenario that different screens or ray paths dominate the scintillation process at different epochs.

astro-ph.GA↗

arXiv2018

Distributed order Hausdorff derivative diffusion model to characterize non-Fickian diffusion in porous media

Many theoretical and experimental results show that solute transport in heterogeneous porous media exhibits multi-scaling behaviors. To describe such non-Fickian diffusions, this work provides a distributed order Hausdorff diffusion model to describe the tracer transport in porous media. This model is proved to be equivalent with the diffusion equation model with a nonlinear time dependent diffusion coefficient. In conjunction with the structural derivative, its mean squared displacement (MSD) of the tracer particles is explicitly derived as a dilogarithm function when the weight function of the order distribution is a linear function of the time derivative order. This model can capture both accelerating and decelerating anomalous and ultraslow diffusions by varying the weight parameter c. In this study, the tracer transport in water-filled pore spaces of two-dimensional Euclidean is demonstrated as a decelerating sub-diffusion, and can well be described by the distributed order Hausdorff diffusion model with c = 1.73. While the Hausdorff diffusion model can accurately fit the sub-diffusion experimental data of the tracer transport in the pore-solid prefractal porous media.

physics.flu-dyn↗

arXiv2018

Spectral and Energy Efficient Wireless Powered IoT Networks: NOMA or TDMA?

Wireless powered communication networks (WPCNs), where multiple energy-limited devices first harvest energy in the downlink and then transmit information in the uplink, have been envisioned as a promising solution for the future Internet-of-Things (IoT). Meanwhile, non-orthogonal multiple access (NOMA) has been proposed to improve the system spectral efficiency (SE) of the fifth-generation (5G) networks by allowing concurrent transmissions of multiple users in the same spectrum. As such, NOMA has been recently considered for the uplink of WPCNs based IoT networks with a massive number of devices. However, simultaneous transmissions in NOMA may also incur more transmit energy consumption as well as circuit energy consumption in practice which is critical for energy constrained IoT devices. As a result, compared to orthogonal multiple access schemes such as time-division multiple access (TDMA), whether the SE can be improved and/or the total energy consumption can be reduced with NOMA in such a scenario still remains unknown. To answer this question, we first derive the optimal time allocations for maximizing the SE of a TDMA-based WPCN (T-WPCN) and a NOMA-based WPCN (N-WPCN), respectively. Subsequently, we analyze the total energy consumption as well as the maximum SE achieved by these two networks. Surprisingly, it is found that N-WPCN not only consumes more energy, but also is less spectral efficient than T-WPCN. Simulation results verify our theoretical findings and unveil the fundamental performance bottleneck, i.e., "worst user bottleneck problem", in multiuser NOMA systems.

cs.IT↗

arXiv2018

Data-Aided Secure Massive MIMO Transmission with Active Eavesdropping

In this paper, we study the design of secure communication for time division duplexing multi-cell multi-user massive multiple-input multiple-output (MIMO) systems with active eavesdropping. We assume that the eavesdropper actively attacks the uplink pilot transmission and the uplink data transmission before eavesdropping the downlink data transmission phase of the desired users. We exploit both the received pilots and data signals for uplink channel estimation. We show analytically that when the number of transmit antennas and the length of the data vector both tend to infinity, the signals of the desired user and the eavesdropper lie in different eigenspaces of the received signal matrix at the base station if their signal powers are different. This finding reveals that decreasing (instead of increasing) the desire user's signal power might be an effective approach to combat a strong active attack from an eavesdropper. Inspired by this result, we propose a data-aided secure downlink transmission scheme and derive an asymptotic achievable secrecy sum-rate expression for the proposed design. Numerical results indicate that under strong active attacks, the proposed design achieves significant secrecy rate gains compared to the conventional design employing matched filter precoding and artificial noise generation.

cs.IT↗

arXiv2017

Quarkonium decay into photon plus graviton: a golden channel to discriminate General Relativity from Massive Gravity?

After the recent historical discovery of gravitational wave, it is curious to speculate upon the detection prospect of the quantum graviton in the terrestrial accelerator-based experiment. We carefully investigate the "golden" channels, $J/ψ(Υ)\toγ+\text{graviton}$, which can be pursued at \textsf{BESIII} and \textsf{Belle 2} experiments, by searching for single-photon plus missing energy events. Within the effective field theory (EFT) framework of General Relativity (GR) together with Nonrelativistic QCD (NRQCD), we are capable of making solid predictions for the corresponding decay rates. It is found that these extremely suppressed decays are completely swamped by the Standard Model background events $J/ψ(Υ)\to γ+ν\barν$. Meanwhile, we also study these rare decay processes in the context of massive gravity, and find the respective decay rates in the limit of vanishing graviton mass drastically differ from their counterparts in GR. Counterintuitive as the failure of smoothly recovering GR results may look, our finding is reminiscent of the van Dam-Veltman-Zakharov (vDVZ) discontinuity widely known in classical gravity, which can be traced to the finite contribution of the helicity-zero graviton in the massless limit. Nevertheless, at this stage we are not certain about the fate of the discontinuity encountered in this work, whether it is merely a pathology or not. If it could be endowed with some physical significance, the future observation of these rare decay channels, would, in principle, shed important light on the nature of gravitation, whether the graviton is strictly massless, or bears a very small but nonzero mass.

hep-ph↗

arXiv2017

Message-Passing Receiver Design for Joint Channel Estimation and Data Decoding in Uplink Grant-Free SCMA Systems

The conventional grant-based network relies on the handshaking between base station and active users to achieve dynamic multi-user scheduling, which may cost large signaling overheads as well as system latency. To address those problems, the grant-free receiver design is considered in this paper based on sparse code multiple access (SCMA), one of the promising air interface technologies for 5G wireless networks. With the presence of unknown multipath fading, the proposed receiver blindly performs joint channel estimation and data decoding without knowing the user activity in the network. Based on the framework of belief propagation (BP), we formulate a messagepassing receiver for uplink SCMA that performs joint estimation iteratively. However, the direct application of BP for the multivariable detection problem is complex. Motivated by the idea of approximate inference, we use expectation propagation to project the intractable distributions into Gaussian families such that a linear complexity decoder is obtained.Simulation results show that the proposed receiver can detect active users in the network with a high accuracy and can achieve an improved bit-error-rate performance compared with existing methods.

eess.SP↗

arXiv2017

Next-to-leading-order QCD corrections to $e^+e^-\to H+γ$

The associated production of Higgs boson with a hard photon at lepton collider, i.e., $e^+e^-\to Hγ$, is known to bear a rather small cross section in Standard Model, and can serve as a sensitive probe for the potential new physics signals. Similar to the loop-induced Higgs decay channels $H\to γγ, Zγ$, the $e^+e^-\to Hγ$ process also starts at one-loop order provided that the tiny electron mass is neglected. In this work, we calculate the next-to-leading-order (NLO) QCD corrections to this associated $H+γ$ production process, which mainly stem from the gluonic dressing to the top quark loop. The QCD corrections are found to be rather modest at lower center-of-mass energy range ($\sqrt{s}<300$ GeV), thus of negligible impact on Higgs factory such as CEPC. Nevertheless, when the energy is boosted to the ILC energy range ($\sqrt{s}\approx 400$ GeV), QCD corrections may enhance the leading-order cross section by $20\%$. In any event, the $e^+e^-\to Hγ$ process has a maximal production rate $σ_{\rm max}\approx 0.08$ fb around $\sqrt{s}= 250$ GeV, thus CEPC turns out to be the best place to look for this rare Higgs production process. In the high energy limit, the effect of NLO QCD corrections become completely negligible, which can be simply attributed to the different asymptotic scaling behaviors of the LO and NLO cross sections, where the former exhibits a milder decrement $\propto 1/s$ , but the latter undergoes a much faster decrease $\propto 1/s^2$.

hep-ph↗

arXiv2017

Polar Coding for the Cognitive Interference Channel with Confidential Messages

In this paper, we propose a low-complexity, secrecy capacity achieving polar coding scheme for the cognitive interference channel with confidential messages (CICC) under the strong secrecy criterion. Existing polar coding schemes for interference channels rely on the use of polar codes for the multiple access channel, the code construction problem of which can be complicated. We show that the whole secrecy capacity region of the CICC can be achieved by simple point-to-point polar codes due to the cognitivity, and our proposed scheme requires the minimum rate of randomness at the encoder.

cs.IT↗

arXiv2017

Secure Polar Coding for the Two-Way Wiretap Channel

We consider the problem of polar coding for secure communications over the two-way wiretap channel, where two legitimate users communicate with each other simultaneously while a passive eavesdropper overhears a combination of their exchanged signals. The legitimate users wish to design a cooperative jamming code such that the interference between their codewords can jam the eavesdropper. In this paper, we design a polar coded cooperative jamming scheme that achieves the whole secrecy rate region of the general two-way wiretap channel under the strong secrecy criterion. The chaining method is used to make proper alignment of polar indices. The randomness required to be shared between two legitimate users is treated as a limited resource and we show that its rate can be made negligible by increasing the blocklength and the number of chained blocks. For the special case when the eavesdropper channel is degraded with respect to the legitimate ones, a simplified scheme is proposed which can simultaneously ensure reliability and weak secrecy within a single transmission block. An example of the binary erasure channel case is given to demonstrate the performance of our scheme.

cs.IT↗

arXiv2017

A Spatial Structural Derivative Model for Ultraslow Diffusion

This study investigates the ultraslow diffusion by a spatial structural derivative, in which the exponential function exp(x)is selected as the structural function to construct the local structural derivative diffusion equation model. The analytical solution of the diffusion equation is a form of Biexponential distribution. Its corresponding mean squared displacement is numerically calculated, and increases more slowly than the logarithmic function of time. The local structural derivative diffusion equation with the structural function exp(x)in space is an alternative physical and mathematical modeling model to characterize a kind of ultraslow diffusion.

cond-mat.stat-mech↗

arXiv2017

Feasibility study on the least square method for fitting non-Gaussian noise data

This study is to investigate the feasibility of least square method in fitting non-Gaussian noise data. We add different levels of the two typical non-Gaussian noises, Lévy and stretched Gaussian noises, to exact value of the selected functions including linear equations, polynomial and exponential equations, and the maximum absolute and the mean square errors are calculated for the different cases. Lévy and stretched Gaussian distributions have many applications in fractional and fractal calculus. It is observed that the non-Gaussian noises are less accurately fitted than the Gaussian noise, but the stretched Gaussian cases appear to perform better than the Lévy noise cases. It is stressed that the least-squares method is inapplicable to the non-Gaussian noise cases when the noise level is larger than 5%.

stat.OT↗

arXiv2017

Polar Coding for Block Fading Channels

In this paper, we consider the problem of polar coding for block fading channels, with emphasis on those with instantaneous channel state information (CSI) at neither the transmitter nor the receiver. Our approach is to decompose a block fading channel of $T_c$ symbols per coherent interval into $T_c$ binary-input sub-channels in a capacity-preserving way, and design a polar code for each of them. For the case when instantaneous CSI is available at the receiver, a random interleaver can be used to enable joint encoding and decoding of all sub-channels so as to enhance the finite length performance. It is shown that our proposed schemes achieve the ergodic capacity of binary-input block fading channels under various CSI assumptions.

cs.IT↗

arXiv2016

Dynamic Spectrum Leasing with Two Sellers

This paper studies dynamic spectrum leasing in a cognitive radio network. There are two spectrum sellers, who are two primary networks, each with an amount of licensed spectrum bandwidth. When a seller has some unused spectrum, it would like to lease the unused spectrum to secondary users. A coordinator helps to perform the spectrum leasing stage-by-stage. As the two sellers may have different leasing period, there are three epochs, in which seller 1 has spectrum to lease in Epochs II and III, while seller 2 has spectrum to lease in Epochs I and II. Each seller needs to decide how much spectrum it should lease to secondary users in each stage of its leasing period, with a target at revenue maximization. It is shown that, when the two sellers both have spectrum to lease (i.e., in Epoch II), the spectrum leasing can be formulated as a non-cooperative game. Nash equilibria of the game are found in closed form. Solutions of the two users in the three epochs are derived.

cs.GT↗

arXiv2016

An Overview of Sustainable Green 5G Networks

The stringent requirements of a 1,000 times increase in data traffic and one millisecond round trip latency have made limiting the potentially tremendous ensuing energy consumption one of the most challenging problems for the design of the upcoming fifth-generation (5G) networks. To enable sustainable 5G networks, new technologies have been proposed to improve the system energy efficiency and alternative energy sources are introduced to reduce our dependence on traditional fossil fuels. In particular, various 5G techniques target the reduction of the energy consumption without sacrificing the quality-of-service. Meanwhile, energy harvesting technologies, which enable communication transceivers to harvest energy from various renewable resources and ambient radio frequency signals for communi- cation, have drawn significant interest from both academia and industry. In this article, we provide an overview of the latest research on both green 5G techniques and energy harvesting for communication. In addition, some technical challenges and potential research topics for realizing sustainable green 5G networks are also identified.

cs.IT↗

arXiv2016

Energy-Efficient Small Cell with Spectrum-Power Trading

In this paper, we investigate spectrum-power trading between a small cell (SC) and a macro cell (MC), where the SC consumes power to serve the macro cell users (MUs) in exchange for some bandwidth from the MC. Our goal is to maximize the system energy efficiency (EE) of the SC while guaranteeing the quality of service of each MU as well as small cell users (SUs). Specifically, given the minimum data rate requirement and the bandwidth provided by the MC, the SC jointly optimizes MU selection, bandwidth allocation, and power allocation while guaranteeing its own minimum required system data rate. The problem is challenging due to the binary MU selection variables and the fractional- form objective function. We first show that the bandwidth of an MU is shared with at most one SU in the SC. Then, for a given MU selection, the optimal bandwidth and power allocation is obtained by exploiting the fractional programming. To perform MU selection, we first introduce the concept of the trading EE to characterize the data rate obtained as well as the power consumed for serving an MU. We then reveal a sufficient and necessary condition for serving an MU without considering the total power constraint and the minimum data rate constraint: the trading EE of the MU should be higher than the system EE of the SC. Based on this insight, we propose a low complexity MU selection method and also investigate the optimality condition. Simulation results verify our theoretical findings and demonstrate that the proposed resource allocation achieves near-optimal performance.

cs.IT↗