arXiv subjects

Wen Chen

Publications and source records attributed to Wen Chen.

At least 433 records · Page 24Linked to original sources

arXiv2020

Integer-Forcing Linear Receiver Design with Slowest Descent Method

Compute-and-forward (CPF) strategy is one category of network coding in which a relay will compute and forward a linear combination of source messages according to the observed channel coefficients, based on the algebraic structure of lattice codes. Recently, based on the idea of CPF, integer forcing (IF) linear receiver architecture for MIMO system has been proposed to recover different integer combinations of lattice codewords for further original message detection. In this paper, we consider the problem of IF linear receiver design with respect to the channel conditions. Instead of exhaustive search, we present practical and efficient suboptimal algorithms to design the IF coefficient matrix with full rank such that the total achievable rate is maximized, based on the slowest descent method. Numerical results demonstrate the effectiveness of our proposed algorithms.

eess.SP↗

arXiv2020

Optimal Upward Scaling of Minimum-TSC Binary Signature Sets

We consider upward scaling an overloaded min-TSC binary signature set and propose an optimal solution based on improved sphere decoding algorithm. Instead of previous suboptimal approach, we are guaranteed to find the optimal maximum-likelihood (ML) searching result with low complexity.

eess.SP↗

arXiv2020

Joint Optimization of User Association, Subchannel Allocation, and Power Allocation in Multi-cell Multi-association OFDMA Heterogeneous Networks

Heterogeneous network is a novel network architecture proposed in Long-Term-Evolution~(LTE), which highly increases the capacity and coverage compared with the conventional networks. However, in order to provide the best services, appropriate resource management must be applied. In this paper, we consider the joint optimization problem of user association, subchannel allocation, and power allocation for downlink transmission in Multi-cell Multi-association Orthogonal Frequency Division Multiple Access (OFDMA) heterogeneous networks. To solve the optimization problem, we first divide it into two subproblems: 1) user association and subchannel allocation for fixed power allocation; 2) power allocation for fixed user association and subchannel allocation. Subsequently, we obtain a locally optimal solution for the joint optimization problem by solving these two subproblems alternately. For the first subproblem, we derive the globally optimal solution based on graph theory. For the second subproblem, we obtain a Karush-Kuhn-Tucker (KKT) optimal solution by a low complexity algorithm based on the difference of two convex functions approximation (DCA) method. In addition, the multi-antenna receiver case and the proportional fairness case are also discussed. Simulation results demonstrate that the proposed algorithms can significantly enhance the overall network throughput.

eess.SP↗

arXiv2020

Energy-Efficient Buffer-Aided Relaying Systems with Opportunistic Spectrum Access

In this paper, an energy-efficient cross-layer design framework is proposed for cooperative relaying networks, which takes into account the influence of spectrum utilization probability. Specifically, random arrival traffic is considered and an adaptive modulation and coding (AMC) scheme is adopted in the cooperative transmission system to improve the system performance. The average packet dropping rate of the relay-buffer is studied at first. With the packet dropping rate and stationary distribution of the system state, the closed-form expression of the delay is derived. Then the energy efficiency for relay-assisted transmission is investigated, which takes into account the queueing process of the relay and the source. In this context, an energy efficiency optimization problem is formulated to determine the optimum strategy of power and time allocation for the relay-assisted cooperative system. Finally, the energy efficient switching strategy between the relay assisted transmission and the direct transmission is obtained, where packet transmissions have different delay requirements. In addition, energy efficient transmission policy with AMC is obtained. Numerical results demonstrate the effectiveness of the proposed design improving the energy efficiency.

eess.SP↗

arXiv2020

Towrad 5G Air Interface Technology: Sparse Code Muliple Access

The fifth generation wireless networks focus on the design of low latency, high data rate, high reliability, and massive connectivity communications. Non-orthogonal multiple access (NOMA) is an essential enabling technology to accommodate the wide range of communication requirements. By coordinating the massive devices within the same resource block on power domain, frequency domain or code domain, NOMA is superior to conventional orthogonal multiple access in terms of the network connectivity, the throughputs of system and etc. Sparse code multiple access (SCMA) is a kind of multi-carrier code domain NOMA and has been studied extensively. The challenges for designing a high quality SCMA system is to seek the feasible encoding and decoding schemes to meet the desired requirements. In this article, we present some recent progresses towards the design of multi-dimensional codebooks, the practical low complexity decoder, as well as the Grant-Free multiple access for SCMA system. In particular, we show how the SCMA codebooks construction are motived by the combined design of multi-dimensional constellation and factor graphs. In addition, various low complexity SCMA decoders are also reviewed with a special focus on sphere decoding. Moreover, based on the framework of belief propagation, the SCMA Grant-Free transmission is introduced and the problem of collision resolution is also discussed.

eess.SP↗

arXiv2020

Low Complexity Iterative Receiver Design for Sparse Code Multiple Access

Sparse code multiple access (SCMA) is one of the most promising methods among all the non-orthogonal multiple access techniques in the future 5G communication. Compared with some other non-orthogonal multiple access techniques such as low density signature (LDS), SCMA can achieve better performance due to the shaping gain of the SCMA codewords. However, despite of the sparsity of the codewords, the decoding complexity of the current message passing algorithm (MPA) utilized by SCMA is still prohibitively high. In this paper, by exploring the lattice structure of SCMA codewords, we propose a low complexity decoding algorithm based on list sphere decoding (LSD). The LSD avoids the exhaustive search for all possible hypotheses and only considers signal within a hypersphere. As LSD can be viewed a depth-first tree search algorithm, we further propose several methods to prune the redundancy visited nodes in order to reduce the size of the search tree. Simulation results show that the proposed algorithm can reduce the decoding complexity substantially while the performance loss compared with the existing algorithm is negligible.

eess.SP↗

arXiv2020

Reduction of Feynman Integrals in the Parametric Representation

In this paper, the reduction of Feynman integrals in the parametric representation is considered. This method proves to be more efficient than the integration-by-part (IBP) method in the momentum space. Tensor integrals can directly be parametrized without performing tensor reductions. The integrands of parametric integrals are functions of Lorentz scalars, instead of four momenta. The complexity of a calculation is determined by the number of propagators that are present rather than the number of all the linearly independent propagators. Furthermore, the symmetries of Feynman integrals under permutations of indices are transparent in the parametric representation. Since all the indices of the propagators are nonnegative, an algorithm to solve those identities can easily be developed, which can be used for automatic calculations.

hep-ph↗

arXiv2020

Relativistic corrections to exclusive $χ_{cJ} + γ$ production from $e^+ e^-$ annihilation

We calculate in the non-relativistic QCD (NRQCD) factorization framework all leading relativistic corrections to the exclusive production of $χ_{cJ}+γ$ in $e^+ e^-$ annihilation. In particular, we compute for the first time contributions induced by octet operators with a chromoelectric field. The matching coefficients multiplying production long distance matrix elements (LDMEs) are determined through perturbative matching between QCD and NRQCD at the amplitude level. Technical challenges encountered in the non-relativistic expansion of the QCD amplitudes are discussed in detail. The main source of uncertainty comes from the not so well known LDMEs. Accounting for it, we provide the following estimates for the production cross sections at $\sqrt{s} = 10.6\textrm{ GeV}$: $σ(e^+ e^- \to χ_{ c0} + γ) = (1.3 \pm 0.4) \textrm{ fb}$, $σ(e^+ e^- \to χ_{ c1} + γ) = (15.4 \pm 6.7) \textrm{ fb}$, and $σ(e^+ e^- \to χ_{ c2} + γ) = (4.7 \pm 2.6) \textrm{ fb}$.

hep-ph↗

arXiv2019

Automatic Layout Generation with Applications in Machine Learning Engine Evaluation

Machine learning-based lithography hotspot detection has been deeply studied recently, from varies feature extraction techniques to efficient learning models. It has been observed that such machine learning-based frameworks are providing satisfactory metal layer hotspot prediction results on known public metal layer benchmarks. In this work, we seek to evaluate how these machine learning-based hotspot detectors generalize to complicated patterns. We first introduce a automatic layout generation tool that can synthesize varies layout patterns given a set of design rules. The tool currently supports both metal layer and via layer generation. As a case study, we conduct hotspot detection on the generated via layer layouts with representative machine learning-based hotspot detectors, which shows that continuous study on model robustness and generality is necessary to prototype and integrate the learning engines in DFM flows. The source code of the layout generation tool will be available at https://github. com/phdyang007/layout-generation.

cs.LG↗

arXiv2019

Modelling and Dynamic Tracking Control of Industrial Vehicles with Tractor-trailer Structure

Existing works on control of tractor-trailers systems only consider the kinematics model without taking dynamics into account. Also, most of them treat the issue as a pure control theory problem whose solutions are difficult to implement. This paper presents a trajectory tracking control approach for a full-scale industrial tractor-trailers vehicle composed of a car-like tractor and arbitrary number of passive full trailers. To deal with dynamic effects of trailing units, a force sensor is innovatively installed at the connection between the tractor and the first trailer to measure the forces acting on the tractor. The tractor's dynamic model that explicitly accounts for the measured forces is derived. A tracking controller that compensates the pulling/pushing forces in real time and simultaneously drives the system onto desired trajectories is proposed. The propulsion map between throttle opening and the propulsion force is proposed to be modeled with a fifth-order polynomial. The parameters are estimated by fitting experimental data, in order to provide accurate driving force. Stability of the control algorithm is rigorously proved by Lyapunov methods. Experiments of full-size vehicles are conducted to validate the performance of the control approach.

eess.SY↗

arXiv2019

On the Fundamental Limits of MIMO Massive Access Communication

The multiple access channel (MAC) with many-user is a general model for massive machine type communications. In this paradigm, the number of users may be comparable or even larger than the coding blocklength $n$. In contrast, classical MAC often assumes fixed and small number of the users. In this paper, we consider the massive access channel with multiple antennas system, where the base station (BS) with multiple receiving antennas serves the users in a single cell. The magnitude of users is assumed to grow unbounded with $n$. We investigate the achievable region of MIMO massive access channel, where among the total users, an unknown subset referred to active users may transmit data periodically. The asymptotic active user identification cost is also quantified. With the theoretical analysis, it was shown that given finite number of the receiving antennas, the individual rate for each user can be formulated as the sum rate multiplied by some specific factors, which correspond to the allocation of sum capacity. The successive decoding does not apply due to the interferences from growing unbounded users. Theoretical analysis shows that successive decoding works only when the number of receiving antennas goes to infinity with the increasing codelength.

cs.IT↗

arXiv2019

Observations of radio sources near the Sun

Geodetic Very Long Baseline Interferometry (VLBI) data are capable of measuring the light deflection caused by the gravitational field of the Sun and large planets with high accuracy. The parameter $γ$ of the parametrized Post-Newtonian (PPN) formalism estimated using observations of reference radio sources near the Sun should be equal to unity in the general relativity. We have run several VLBI experiments tracking reference radio sources from 1 to 3 degrees from the Sun. The best formal accuracy of the parameter $γ$ achieved in the single-session mode is less than 0.01 percent, or better than the formal accuracy obtained with a global solution included all available observations at arbitrary elongation from the Sun. We are planning more experiments starting from 2020 using better observing conditions near the minimum of the Solar activity cycle.

astro-ph.IM↗

arXiv2019

A new data fitting method for stretched Gaussian noise: stretched least square method

Stretched Gaussian distribution is the fundamental solution of the Hausdorff derivative diffusion equation and its corresponding stretched Gaussian noise is a widely encountered non-Gaussian noise in science and engineering. The least square method is a standard regression approach to fit Gaussian noisy data, but has distinct limits for non-Gaussian noise. Based on the Hausdorff calculus, this study develops a stretched least square method to fit stretched Gaussian noise by using the Hausdorff fractal distance as the horizontal coordinate. To better compare with the least square method, different high levels of stretched Gaussian noise are added to real values. Numerical experiments show the stretched least square method is more accurate specific in fitting stretched Gaussian noise than the least square method.

math.NA↗

arXiv2019

POG: Personalized Outfit Generation for Fashion Recommendation at Alibaba iFashion

Increasing demand for fashion recommendation raises a lot of challenges for online shopping platforms and fashion communities. In particular, there exist two requirements for fashion outfit recommendation: the Compatibility of the generated fashion outfits, and the Personalization in the recommendation process. In this paper, we demonstrate these two requirements can be satisfied via building a bridge between outfit generation and recommendation. Through large data analysis, we observe that people have similar tastes in individual items and outfits. Therefore, we propose a Personalized Outfit Generation (POG) model, which connects user preferences regarding individual items and outfits with Transformer architecture. Extensive offline and online experiments provide strong quantitative evidence that our method outperforms alternative methods regarding both compatibility and personalization metrics. Furthermore, we deploy POG on a platform named Dida in Alibaba to generate personalized outfits for the users of the online application iFashion. This work represents a first step towards an industrial-scale fashion outfit generation and recommendation solution, which goes beyond generating outfits based on explicit queries, or merely recommending from existing outfit pools. As part of this work, we release a large-scale dataset consisting of 1.01 million outfits with rich context information, and 0.28 billion user click actions from 3.57 million users. To the best of our knowledge, this dataset is the largest, publicly available, fashion related dataset, and the first to provide user behaviors relating to both outfits and fashion items.

cs.IR↗

arXiv2019

Data-Aided Secure Massive MIMO Transmission under the Pilot Contamination Attack

In this paper, we study the design of secure communication for time division duplex 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 of the users. We exploit both the received pilots and the received 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 provided that their signal powers are different. This finding reveals that decreasing (instead of increasing) the desired user's signal power might be an effective approach to combat a strong active attack from an eavesdropper. Inspired by this observation, we propose a data-aided secure downlink transmission scheme and derive an asymptotic achievable secrecy sum-rate expression for the proposed design. For the special case of a single-cell single-user system with independent and identically distributed fading, the obtained expression reveals that the secrecy rate scales logarithmically with the number of transmit antennas. This is the same scaling law as for the achievable rate of a single-user massive MIMO system in the absence of eavesdroppers. Numerical results indicate that the proposed scheme achieves significant secrecy rate gains compared to alternative approaches based on matched filter precoding with artificial noise generation and null space transmission.

cs.IT↗

arXiv2019

On the Fundamental Limits of MIMO Massive Multiple Access Channels

In this paper, we study the multiple-antenna wireless communication networks, where a large number of devices simultaneously communicate with an access point. The capacity region of multiple-input multiple-output massive multiple access channels (MIMO mMAC) is investigated. While joint typicality decoding is utilized to establish the achievability of capacity region for conventional MAC with fixed number of users, the technique is not directly applicable for MIMO mMAC. Instead, an information-theoretic approach based on Gallager's error exponent analysis is exploited to characterize the \textcolor[rgb]{0,0,0}{finite dimension region} of MIMO mMAC. Theoretical results reveal that the finite dimension region of MIMO mMAC is dominated by sum rate constraint only, and the individual user rate is determined by a specific factor that corresponds to the allocation of sum rate. The rate in conventional MAC is not achievable with massive multiple access, which is due to the fact that successive interference cancellation cannot guarantee an arbitrary small error decoding probability for MIMO mMAC. The results further imply that, asymptotically, the individual user rate is independent of the number of transmit antennas, and channel hardening makes the individual user rate close to that when only statistic knowledge of channel is available at receiver. The finite dimension region of MIMO mMAC is a generalization of the symmetric rate in Chen \emph{et al.} (2017).

cs.IT↗

arXiv2019

Channel-Statistics-Based Hybrid Precoding for Millimeter-Wave MIMO Systems With Dynamic Subarrays

This paper investigates the hybrid precoding design for millimeter wave (mmWave) multiple-input multiple-output (MIMO) systems with finite-alphabet inputs. The mmWave MIMO system employs partially-connected hybrid precoding architecture with dynamic subarrays, where each radio frequency (RF) chain is connected to a dynamic subset of antennas. We consider the design of analog and digital precoders utilizing statistical and/or mixed channel state information (CSI), which involve solving an extremely difficult problem in theory: First, designing the optimal partition of antennas over RF chains is a combinatorial optimization problem, whose optimal solution requires an exhaustive search over all antenna partitioning solutions; Second, the average mutual information under mmWave MIMO channels lacks closed-form expression and involves prohibitive computational burden; Third, the hybrid precoding problem with given partition of antennas is nonconvex with respect to the analog and digital precoders. To address these issues, this study first presents a simple criterion and the corresponding low complexity algorithm to design the optimal partition of antennas using statistical CSI. Then it derives the lower bound and its approximation for the average mutual information, in which the computational complexity is greatly reduced compared to calculating the average mutual information directly. In addition, it also shows that the lower bound with a constant shift offers a very accurate approximation to the average mutual information. This paper further proposes utilizing the lower bound approximation as a low-complexity and accurate alternative for developing a manifold-based gradient ascent algorithm to find near optimal analog and digital precoders. Several numerical results are provided to show that our proposed algorithm outperforms existing hybrid precoding algorithms.

cs.IT↗

arXiv2018

Mixed electroweak-QCD corrections to $e^+e^-\to μ^+μ^- H$ at CEPC with finite-width effect

The associated production of Higgs boson with a muon pair, $e^+e^-\to μ^+μ^- H$, is one of the golden channels to pin down the properties of the Higgs boson in the prospective Higgs factories exemplified by \textsf{CEPC}. The projected accuracy of the corresponding cross section measurement is about per cent level at CEPC. In this work, we investigate both ${\mathcal O}(α)$ weak correction and the ${\mathcal O}(αα_s)$ mixed electroweak-QCD corrections for this channel, appropriately taking into account the effect of finite $Z^0$ width. The $μ^+μ^-$ invariant mass spectrum is also predicted. The mixed electroweak-QCD correction turns out to reach 1.5\% of the Born-order result, and thereby must be included in future confrontation with the data. We also observe that, after including higher-order corrections, the simplified prediction for the integrated cross section employing the narrow-width-approximation may deviate from our full result by a few per cents.

hep-ph↗