arXiv subjects

Tiejun Lv

Publications and source records attributed to Tiejun Lv.

At least 55 records · Page 3Linked to original sources

arXiv2021

Joint Estimation of Multipath Angles and Delays for Millimeter-Wave Cylindrical Arrays with Hybrid Front-ends

Accurate channel parameter estimation is challenging for wideband millimeter-wave (mmWave) large-scale hybrid arrays, due to beam squint and much fewer radio frequency (RF) chains than antennas. This paper presents a novel joint delay and angle estimation approach for wideband mmWave fully-connected hybrid uniform cylindrical arrays. We first design a new hybrid beamformer to reduce the dimension of received signals on the horizontal plane by exploiting the convergence of the Bessel function, and to reduce the active beams in the vertical direction through preselection. The important recurrence relationship of the received signals needed for subspace-based angle and delay estimation is preserved, even with substantially fewer RF chains than antennas. Then, linear interpolation is generalized to reconstruct the received signals of the hybrid beamformer, so that the signals can be coherently combined across the whole band to suppress the beam squint. As a result, efficient subspace-based algorithm algorithms can be developed to estimate the angles and delays of multipath components. The estimated delays and angles are further matched and correctly associated with different paths in the presence of non-negligible noises, by putting forth perturbation operations. Simulations show that the proposed approach can approach the Cramér-Rao lower bound (CRLB) of the estimation with a significantly lower computational complexity than existing techniques.

cs.IT↗

arXiv2020

Intelligent Reflecting Surface Aided Multi-User Millimeter-Wave Communications for Coverage Enhancement

Intelligent reflecting surface (IRS) is envisioned as a promising solution for controlling radio propagation environments in future wireless systems. In this paper, we propose a distributed intelligent reflecting surface (IRS) assisted multi-user millimeter wave (mmWave) system, where IRSs are exploited to enhance the mmWave signal coverage when direct links between base station and users are unavailable. First, a joint active and passive beamforming problem is established for weighted sum-rate maximization. Then, an alternating iterative algorithm with closed-form expressions is proposed to tackle the challenging non-convex problem, thereby decoupling the active and passive beamforming variables. Moreover, we design a constraint relaxation technique to address the unit modulus constraints pertaining to the IRS. Numerical results demonstrate that the distributed IRS can potentially enhance the communication performance of existing wireless systems.

eess.SP↗

arXiv2020

Tensor-based Multi-dimensional Wideband Channel Estimation for mmWave Hybrid Cylindrical Arrays

Channel estimation is challenging for hybrid millimeter wave (mmWave) large-scale antenna arrays which are promising in 5G/B5G applications. The challenges are associated with angular resolution losses resulting from hybrid front-ends, beam squinting, and susceptibility to the receiver noises. Based on tensor signal processing, this paper presents a novel multi-dimensional approach to channel parameter estimation with large-scale mmWave hybrid uniform circular cylindrical arrays (UCyAs) which are compact in size and immune to mutual coupling but known to suffer from infinite-dimensional array responses and intractability. We design a new resolution-preserving hybrid beamformer and a low-complexity beam squinting suppression method, and reveal the existence of shift-invariance relations in the tensor models of received array signals at the UCyA. Exploiting these relations, we propose a new tensor-based subspace estimation algorithm to suppress the receiver noises in all dimensions (time, frequency, and space). The algorithm can accurately estimate the channel parameters from both coherent and incoherent signals. Corroborated by the Cramér-Rao lower bound (CRLB), simulation results show that the proposed algorithm is able to achieve substantially higher estimation accuracy than existing matrix-based techniques, with a comparable computational complexity.

eess.SP↗

arXiv2020

Analysis and Optimization of Service Delay for Multi-quality Videos in Multi-tier Heterogeneous Network with Random Caching

Aiming to minimize service delay, we propose a new random caching scheme in device-to-device (D2D)-assisted heterogeneous network. To support diversified viewing qualities of multimedia video services, each video file is encoded into a base layer (BL) and multiple enhancement layers (ELs) by scalable video coding (SVC). A super layer, including the BL and several ELs, is transmitted to every user. We define and quantify the service delay of multi-quality videos by deriving successful transmission probabilities when a user is served by a D2D helper, a small-cell base station (SBS) and a macro-cell base station (MBS). We formulate a delay minimization problem subject to the limited cache sizes of D2D helpers and SBSs. The structure of the optimal solutions to the problem is revealed, and then an improved standard gradient projection method is designed to effectively obtain the solutions. Both theoretical analysis and Monte-Carlo simulations validate the successful transmission probabilities. Compared with three benchmark caching policies, the proposed SVC-based random caching scheme is superior in terms of reducing the service delay.

cs.NI↗

arXiv2020

Complex ResNet Aided DoA Estimation for Near-Field MIMO Systems

The near-field effect of short-range multiple-input multiple-output (MIMO) systems imposes many challenges on direction-of-arrival (DoA) estimation. Most conventional scenarios assume that the far-field planar wavefronts hold. In this paper, we investigate the DoA estimation problem in short-range MIMO communications, where the effect of near-field spherical wave is non-negligible. By converting it into a regression task, a novel DoA estimation framework based on complex-valued deep learning (CVDL) is proposed for the near-field region in short-range MIMO communication systems. Under the assumption of a spherical wave model, the array steering vector is determined by both the distance and the direction. However, solving this regression task containing a massive number of variables is challenging, since datasets need to capture numerous complicated feature representations. To overcome this, a virtual covariance matrix (VCM) based on received signals is constructed, and thus such features extracted from the VCM can deal with the complicated coupling relationship between the direction and the distance. Although the emergence of wireless big data driven by future communication networks promotes deep learning-based wireless signal processing, the learning algorithms of complex-valued signals are still ongoing. This paper proposes a one-dimensional (1-D) residual network that can directly tackle complex-valued features due to the inherent 1-D structure of signal subspace vectors. In addition, we put forth a cropped VCM based policy which can be applied to different antenna sizes. The proposed method is able to fully exploit the complex-valued information. Our simulation results demonstrate the superiority of the proposed CVDL approach over the baseline schemes in terms of the accuracy of DoA estimation.

eess.SP↗

arXiv2020

Nested Hybrid Cylindrical Array Design and DoA Estimation for Massive IoT Networks

Reducing cost and power consumption while maintaining high network access capability is a key physical-layer requirement of massive Internet of Things (mIoT) networks. Deploying a hybrid array is a cost- and energy-efficient way to meet the requirement, but would penalize system degree of freedom (DoF) and channel estimation accuracy. This is because signals from multiple antennas are combined by a radio frequency (RF) network of the hybrid array. This paper presents a novel hybrid uniform circular cylindrical array (UCyA) for mIoT networks. We design a nested hybrid beamforming structure based on sparse array techniques and propose the corresponding channel estimation method based on the second-order channel statistics. As a result, only a small number of RF chains are required to preserve the DoF of the UCyA. We also propose a new tensor-based two-dimensional (2-D) direction-of-arrival (DoA) estimation algorithm tailored for the proposed hybrid array. The algorithm suppresses the noise components in all tensor modes and operates on the signal data model directly, hence improving estimation accuracy with an affordable computational complexity. Corroborated by a Cramer-Rao lower bound (CRLB) analysis, simulation results show that the proposed hybrid UCyA array and the DoA estimation algorithm can accurately estimate the 2-D DoAs of a large number of IoT devices.

eess.SP↗

arXiv2020

Learning-Based Multi-Channel Access in 5G and Beyond Networks with Fast Time-Varying Channels

We propose a learning-based scheme to investigate the dynamic multi-channel access (DMCA) problem in the fifth generation (5G) and beyond networks with fast time-varying channels wherein the channel parameters are unknown. The proposed learning-based scheme can maintain near-optimal performance for a long time, even in the sharp changing channels. This scheme greatly reduces processing delay, and effectively alleviates the error due to decision lag, which is cased by the non-immediacy of the information acquisition and processing. We first propose a psychology-based personalized quality of service model after introducing the network model with unknown channel parameters and the streaming model. Then, two access criteria are presented for the living streaming model and the buffered streaming model. Their corresponding optimization problems are also formulated. The optimization problems are solved by learning-based DMCA scheme, which combines the recurrent neural network with deep reinforcement learning. In the learning-based DMCA scheme, the agent mainly invokes the proposed prediction-based deep deterministic policy gradient algorithm as the learning algorithm. As a novel technical paradigm, our scheme has strong universality, since it can be easily extended to solve other problems in wireless communications. The real channel data-based simulation results validate that the performance of the learning-based scheme approaches that derived from the exhaustive search when making a decision at each time-slot, and is superior to the exhaustive search method when making a decision at every few time-slots.

eess.SP↗

arXiv2019

Secure Beamforming Design in Relay-Assisted Internet of Things

A secure downlink transmission system which is exposed to multiple eavesdroppers and is appropriate for Internet of Things (IoT) applications is considered. A worst case scenario is assumed, in the sense that, in order to enhance their interception ability all eavesdroppers are located close to each other, near the controller and collude to form joint receive beamforming. For such a system, a novel cooperative non-orthogonal multiple access (NOMA) secure transmission scheme for which an IoT device with a stronger channel condition acts as an energy harvesting relay in order to assist a second IoT device operating under weaker channel conditions, is proposed and its performance is analyzed and evaluated. A secrecy sum rate (SSR) maximization problem is formulated and solved under three constraints: i) Transmit power; ii) Successive interference cancellation; iii) Quality of Service. By considering both passive and active eavesdroppers scenarios, two optimization schemes are proposed to improve the overall system SSR. On the one hand, for the passive eavesdropper scenario, an artificial noise-aided secure beamforming scheme is proposed. Since this optimization problem is nonconvex, instead of using traditional but highly complex, bruteforce two-dimensional search, it is conveniently transformed into a convex one by using an epigraph reformulation. On the other hand, for the active multi-antennas eavesdroppers' scenario, the orthogonal-projection-based beamforming scheme is considered, and by employing the successive convex approximation method, a suboptimal solution is proposed. Furthermore, since for single antenna transmission the orthogonal-projection-based scheme may not be applicable a simple power control scheme is proposed.

eess.SP↗

arXiv2019

Economical Caching for Scalable Videos in Cache-enabled Heterogeneous Networks

We develop the optimal economical caching schemes in cache-enabled heterogeneous networks, while delivering multimedia video services with personalized viewing qualities to mobile users. By applying scalable video coding (SVC), each video file to be requested is divided into one base layer (BL) and several enhancement layers (ELs). In order to assign different transmission tasks, the serving small-cell base stations (SBSs) are grouped into K clusters. The SBSs are able to cache and cooperatively transmit BL and EL contents to the user. We analytically derive the expressions for successful transmission probability and ergodic service rate, and then the closed form of EConomical Efficiency (ECE) is obtained. In order to enhance the ECE performance, we formulate the ECE optimization problems for two cases. In the first case, with equal cache size equipped at each SBS, the layer caching indicator is determined. Since this problem is NP-hard, after the l0-norm approximation, the discrete optimization variables are relaxed to be continuous, and this relaxed problem is convex. Next, based on the optimal solution derived from the relaxed problem, we devise a greedystrategy based heuristic algorithm to achieve the near-optimal layer caching indicators. In the second case, the cache size for each SBS, the layer size and the layer caching indicator are jointly optimized. This problem is a mixed integer programming problem, which is more challenging. To effectively solve this problem, the original ECE maximization problem is divided into two subproblems. These two subproblems are iteratively solved until the original optimization problem is convergent. Numerical results verify the correctness of theoretical derivations. Additionally, compared to the most popular layer placement strategy, the performance superiority of the proposed SVC-based caching schemes is testified.

cs.MM↗

arXiv2018

Optimization of the Energy-Efficient Relay-Based massive IoT Network

To meet the requirements of high energy efficiency (EE) and large system capacity for the fifth-generation (5G) Internet of Things (IoT), the use of massive multiple-input multipleoutput (MIMO) technology has been launched in the massive IoT (mIoT) network, where a large number of devices are connected and scheduled simultaneously. This paper considers the energyefficient design of a multi-pair decode-and-forward relay-based IoT network, in which multiple sources simultaneously transmit their information to the corresponding destinations via a relay equipped with a large array. In order to obtain an accurate yet tractable expression of the EE, firstly, a closed-form expression of the EE is derived under an idealized simplifying assumption, in which the location of each device is known by the network. Then, an exact integral-based expression of the EE is derived under the assumption that the devices are randomly scattered following a uniform distribution and transmit power of the relay is equally shared among the destination devices. Furthermore, a simple yet efficient lower bound of the EE is obtained. Based on this, finally, a low-complexity energy-efficient resource allocation strategy of the mIoT network is proposed under the specific qualityof- service (QoS) constraint. The proposed strategy determines the near-optimal number of relay antennas, the near-optimal transmit power at the relay and near-optimal density of active mIoT device pairs in a given coverage area. Numerical results demonstrate the accuracy of the performance analysis and the efficiency of the proposed algorithms.

eess.SP↗

arXiv2018

Millimeter-Wave NOMA Transmission in Cellular M2M Communications for Internet of Things

Massive connectivity and low latency are two important challenges for the Internet of Things (IoT) to achieve the Quality of Service (QoS) provisions required by the numerous devices it is designed to service. Motivated by these challenges, in the paper we introduce a new millimeter-wave non-orthogonal multiple access (mmWave-NOMA) transmission scheme designed for cellular machine-to-machine (M2M) communication systems for IoT applications. It consists of one base station (BS) and numerous multiple machine type communication (MTC) devices operating in a cellular communication environment. We consider its down-link performance and assume that multiple MTC devices share the same communication resources offered by the proposed mmWave-NOMA transmission scheme, which can support massive connectivity. For this system, a novel MTC pairing scheme is introduced the design of which is based upon the distance between the BS and the MTC devices aiming at reducing the system overall overhead for massive connectivity and latency. In particular, we consider three different MTC device pairing schemes, namely i) the random near and the random far MTC devices (RNRF); ii) the nearest near and the nearest far MTC devices (NNNF); and iii) the nearest near and the farthest far MTC device (NNFF). For all three pairing schemes, their performance is analyzed by deriving closed-form expressions of the outage probability and the sum rate. Furthermore, performance comparison studies of the three MTC device pairing schemes have been carried out.

eess.SP↗

arXiv2018

Energy-Efficient Caching for Scalable Videos in Heterogeneous Networks

By suppressing repeated content deliveries, wireless caching has the potential to substantially improve the energy efficiency (EE) of the fifth generation (5G) communication networks. In this paper, we propose two novel energy-efficient caching schemes in heterogeneous networks, namely, scalable video coding (SVC)-based fractional caching and SVC-based random caching, which can provide on-demand video services with different perceptual qualities. We derive the expressions for successful transmission probabilities and ergodic service rates. Based on the derivations and the established power consumption models, the EE maximization problems are formulated for the two proposed caching schemes. By taking logarithmic approximations of the l0-norm, the problems are efficiently solved by the standard gradient projection method. Numerical results validate the theoretical analysis and demonstrate the superiority of our proposed caching schemes, compared to three benchmark strategies.

eess.SP↗

arXiv2016

A Belief Propagation Based Framework for Soft Multiple-Symbol Differential Detection

Soft noncoherent detection, which relies on calculating the \textit{a posteriori} probabilities (APPs) of the bits transmitted with no channel estimation, is imperative for achieving excellent detection performance in high-dimensional wireless communications. In this paper, a high-performance belief propagation (BP)-based soft multiple-symbol differential detection (MSDD) framework, dubbed BP-MSDD, is proposed with its illustrative application in differential space-time block-code (DSTBC)-aided ultra-wideband impulse radio (UWB-IR) systems. Firstly, we revisit the signal sampling with the aid of a trellis structure and decompose the trellis into multiple subtrellises. Furthermore, we derive an APP calculation algorithm, in which the forward-and-backward message passing mechanism of BP operates on the subtrellises. The proposed BP-MSDD is capable of significantly outperforming the conventional hard-decision MSDDs. However, the computational complexity of the BP-MSDD increases exponentially with the number of MSDD trellis states. To circumvent this excessive complexity for practical implementations, we reformulate the BP-MSDD, and additionally propose a Viterbi algorithm (VA)-based hard-decision MSDD (VA-HMSDD) and a VA-based soft-decision MSDD (VA-SMSDD). Moreover, both the proposed BP-MSDD and VA-SMSDD can be exploited in conjunction with soft channel decoding to obtain powerful iterative detection and decoding based receivers. Simulation results demonstrate the effectiveness of the proposed algorithms in DSTBC-aided UWB-IR systems.

cs.IT↗

arXiv2016

Detecting Byzantine Attacks Without Clean Reference

We consider an amplify-and-forward relay network composed of a source, two relays, and a destination. In this network, the two relays are untrusted in the sense that they may perform Byzantine attacks by forwarding altered symbols to the destination. Note that every symbol received by the destination may be altered, and hence no clean reference observation is available to the destination. For this network, we identify a large family of Byzantine attacks that can be detected in the physical layer. We further investigate how the channel conditions impact the detection against this family of attacks. In particular, we prove that all Byzantine attacks in this family can be detected with asymptotically small miss detection and false alarm probabilities by using a sufficiently large number of channel observations \emph{if and only if} the network satisfies a non-manipulability condition. No pre-shared secret or secret transmission is needed for the detection of these attacks, demonstrating the value of this physical-layer security technique for counteracting Byzantine attacks.

cs.IT↗

arXiv2016

Phase-Rotation-Aided Relay Selection in Two-Way Decode-and-Forward Relay Networks

This paper proposes a relay selection scheme that aims to improve the end-to-end symbol error rate (SER) performance of a two-way relay network (TWRN). The TWRN consists of two single-antenna sources and multiple relays employing decode-and-forward (DF) protocol. It is shown that the SER performance is determined by the minimum decision distance (DD) observed in the TWRN. However, the minimum DD is likely to be made arbitrarily small by channel fading. To tackle this problem, a phase rotation (PR) aided relay selection (RS) scheme is proposed to enlarge the minium DD, which in turn improves the SER performance. The proposed PR based scheme rotates the phases of the transmitted symbols of one source and of the selected relay according to the channel state information, aiming for increasing all DDs to be above a desired bound. The lower bound is further optimized by using a MaxMin-RS criterion associated with the channel gains. It is demonstrated that the PR aided MaxMin-RS approach achieves full diversity gain and an improved array gain. Furthermore, compared with the existing DF based schemes, the proposed scheme allows more flexible relay antenna configurations.

cs.IT↗

arXiv2016

Large-Scale MIMO is Capable of Eliminating Power-Thirsty Channel Coding for Wireless Transmission of HEVC/H.265 Video

A wireless video transmission architecture relying on the emerging large-scale multiple-input--multiple-output (LS-MIMO) technique is proposed. Upon using the most advanced High Efficiency Video Coding (HEVC) (also known as H.265), we demonstrate that the proposed architecture invoking the low-complexity linear zero-forcing (ZF) detector and dispensing with any channel coding is capable of significantly outperforming the conventional small-scale MIMO based architecture, even if the latter employs the high-complexity optimal maximum-likelihood (ML) detector and a rate-$1/3$ recursive systematic convolutional (RSC) channel codec. Specifically, compared to the conventional small-scale MIMO system, the effective system throughput of the proposed LS-MIMO based scheme is increased by a factor of up to three and the quality of reconstructed video quantified in terms of the peak signal-to-noise ratio (PSNR) is improved by about $22.5\, \text{dB}$ at a channel-SNR of $E_b/N_0 \approx 6\,\text{dB}$ for delay-tolerant video-file delivery applications, and about $20\,\text{dB}$ for lip-synchronized real-time interactive video applications. Alternatively, viewing the attainable improvement from a power-saving perspective, a channel-SNR gain as high as $Δ_{E_b/N_0}\approx 5\,\text{dB}$ is observed at a PSNR of $36\, \text{dB}$ for the scenario of delay-tolerant video applications and again, an even higher gain is achieved in the real-time video application scenario. Therefore, we envisage that LS-MIMO aided wireless multimedia communications is capable of dispensing with power-thirsty channel codec altogether!

cs.IT↗

arXiv2015

Space-Time Hierarchical-Graph Based Cooperative Localization in Wireless Sensor Networks

It has been shown that cooperative localization is capable of improving both the positioning accuracy and coverage in scenarios where the global positioning system (GPS) has a poor performance. However, due to its potentially excessive computational complexity, at the time of writing the application of cooperative localization remains limited in practice. In this paper, we address the efficient cooperative positioning problem in wireless sensor networks. A space-time hierarchical-graph based scheme exhibiting fast convergence is proposed for localizing the agent nodes. In contrast to conventional methods, agent nodes are divided into different layers with the aid of the space-time hierarchical-model and their positions are estimated gradually. In particular, an information propagation rule is conceived upon considering the quality of positional information. According to the rule, the information always propagates from the upper layers to a certain lower layer and the message passing process is further optimized at each layer. Hence, the potential error propagation can be mitigated. Additionally, both position estimation and position broadcasting are carried out by the sensor nodes. Furthermore, a sensor activation mechanism is conceived, which is capable of significantly reducing both the energy consumption and the network traffic overhead incurred by the localization process. The analytical and numerical results provided demonstrate the superiority of our space-time hierarchical-graph based cooperative localization scheme over the benchmarking schemes considered.

cs.IT↗

arXiv2015

Distributed User Scheduling for MIMO-Y Channel

In this paper, distributed user scheduling schemes are proposed for the multi-user MIMO-Y channel, where three $N_{T}$-antenna users ($N_{T}=2N,\,3N$) are selected from three clusters to exchange information via an $N_{R}$-antenna amplify-and-forward (AF) relay ($N_{R}=3N$), and $N\geq1$ represents the number of data stream(s) of each unicast transmission within the MIMO-Y channel. The proposed schemes effectively harvest multi-user diversity (MuD) without the need of global channel state information (CSI) or centralized computations. In particular, a novel reference signal space (RSS) is proposed to enable the distributed scheduling for both cluster-wise (CS) and group-wise (GS) patterns. The minimum user-antenna (Min-UA) transmission with $N_{T}=2N$ is first considered. Next, we consider an equal number of relay and user antenna (ER-UA) transmission with ${N_{T}=3N}$, with the aim of reducing CSI overhead as compared to Min-UA. For ER-UA transmission, the achievable MuD orders of the proposed distributed scheduling schemes are analytically derived, which proves the superiority and optimality of the proposed RSS-based distributed scheduling. These results reveal some fundamental behaviors of MuD and the performance-complexity tradeoff of user scheduling schemes in the MIMO-Y channel.

cs.IT↗