Source author record

Tiejun Lv

Tiejun Lv appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

31works
8topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

31 published item(s)

preprint2026arXiv

Adaptive Dual-Path Framework for Covert Semantic Communication

This paper proposes a novel adaptive dual-path framework for covert semantic communication (SemCom), which integrates covert information transmission with task-oriented semantic coding. Unlike conventional covert communication methods that embed hidden messages through power-domain signal superposition, our framework embeds covert data within task-specific features via semantic-level intrinsic encoding. This new architecture introduces dual encoding paths with adaptive block selection: an Explicit path for public task execution and a Stego path that jointly encodes both public and covert information through contrastive representation alignment. A Gumbel-Softmax enabled adaptive path selection mechanism dynamically activates network blocks based on task require- ments. We formulate a multi-objective optimization framework that simultaneously ensures accurate semantic understanding and reliable covert transmission. We rigorously evaluate our framework's security against a powerful, independently trained attacker. Experimental results on the Cityscapes dataset demon- strate a state-of-the-art level of covertness: our method suppresses the attacker's detection accuracy to a near-random guessing level of 56.12%. This robust security is achieved while simultaneously maintaining superior performance on the primary semantic tasks compared to the baselines.

preprint2022arXiv

Caching Scalable Videos in the Edge of Wireless Cellular Networks

By pre-fetching popular videos into the local caches of edge nodes, wireless edge caching provides an effective means of reducing repeated content deliveries. To meet the various viewing quality requirements of multimedia users, scalable video coding (SVC) is integrated with edge caching, where the constituent layers of scalable videos are flexibly cached and transmitted to users. In this article, we discuss the challenges arising from the different content popularity and various viewing requirements of scalable videos, and present the diverse types of cached contents as well as the corresponding transmission schemes. We provide an overview of the existing caching schemes, and summarize the criteria of making caching decisions. A case study is then presented, where the transmission delay is quantified and used as the performance metric. Simulation results confirm that giving cognizance to the realistic requirements of end users is capable of significantly reducing the content transmission delay, compared to the existing caching schemes operating without SVC. The results also verify that the transmission delay of the proposed random caching scheme is lower than that of the caching scheme which only provides local caching gain.

preprint2022arXiv

Energy-Delay Minimization of Task Migration Based on Game Theory in MEC-assisted Vehicular Networks

Roadside units (RSUs), which have strong computing capability and are close to vehicle nodes, have been widely used to process delay- and computation-intensive tasks of vehicle nodes. However, due to their high mobility, vehicles may drive out of the coverage of RSUs before receiving the task processing results. In this paper, we propose a mobile edge computing-assisted vehicular network, where vehicles can offload their tasks to a nearby vehicle via a vehicle-to-vehicle (V2V) link or a nearby RSU via a vehicle-to-infrastructure link. These tasks are also migrated by a V2V link or an infrastructure-to-infrastructure (I2I) link to avoid the scenario where the vehicles cannot receive the processed task from the RSUs. Considering mutual interference from the same link of offloading tasks and migrating tasks, we construct a vehicle offloading decision-based game to minimize the computation overhead. We prove that the game can always achieve Nash equilibrium and convergence by exploiting the finite improvement property. We then propose a task migration (TM) algorithm that includes three task-processing methods and two task-migration methods. Based on the TM algorithm, computation overhead minimization offloading (COMO) algorithm is presented. Extensive simulation results show that the proposed TM and COMO algorithms reduce the computation overhead and increase the success rate of task processing.

preprint2022arXiv

Low-Complexity Distributed Precoding in User-Centric Cell-Free mmWave MIMO Systems

User-centric (UC) based cell-free (CF) structures can provide the benefits of coverage enhancement for millimeter wave (mmWave) multiple input multiple output (MIMO) systems, which is regarded as the key technology of the reliable and high-rate services. In this paper, we propose a new beam selection scheme and precoding algorithm for the UC CF mmWave MIMO system, where a weighted sum-rate maximization problem is formulated. Since the joint design of beam selection and precoding is non-convex and tractable with high complexity, this paper designs the beam selection and precoding separately. Particularly, the proposed beam selection aims at reducing the inter-cluster inter-beam interference, then we also propose a precoding algorithm based on the weighted sum mean-square error (WSMSE) framework, where the precoding matrix can be updated in a distributed manner. We further employ the low-rank decomposition and Neumann series expansion (NSE) to reduce the computational complexity of the precoding. Simulations and complexity analysis verify the effectiveness of the proposed algorithm with a considerable reduction in computational complexity.

preprint2022arXiv

Multi-Agent Deep Reinforcement Learning for Cost- and Delay-Sensitive Virtual Network Function Placement and Routing

This paper proposes an effective and novel multiagent deep reinforcement learning (MADRL)-based method for solving the joint virtual network function (VNF) placement and routing (P&R), where multiple service requests with differentiated demands are delivered at the same time. The differentiated demands of the service requests are reflected by their delay- and cost-sensitive factors. We first construct a VNF P&R problem to jointly minimize a weighted sum of service delay and resource consumption cost, which is NP-complete. Then, the joint VNF P&R problem is decoupled into two iterative subtasks: placement subtask and routing subtask. Each subtask consists of multiple concurrent parallel sequential decision processes. By invoking the deep deterministic policy gradient method and multi-agent technique, an MADRL-P&R framework is designed to perform the two subtasks. The new joint reward and internal rewards mechanism is proposed to match the goals and constraints of the placement and routing subtasks. We also propose the parameter migration-based model-retraining method to deal with changing network topologies. Corroborated by experiments, the proposed MADRL-P&R framework is superior to its alternatives in terms of service cost and delay, and offers higher flexibility for personalized service demands. The parameter migration-based model-retraining method can efficiently accelerate convergence under moderate network topology changes.

preprint2022arXiv

Placement and Resource Allocation of Wireless-Powered Multiantenna UAV for Energy-Efficient Multiuser NOMA

This paper investigates a new downlink nonorthogonal multiple access (NOMA) system, where a multiantenna unmanned aerial vehicle (UAV) is powered by wireless power transfer (WPT) and serves as the base station for multiple pairs of ground users (GUs) running NOMA in each pair. An energy efficiency (EE) maximization problem is formulated to jointly optimize the WPT time and the placement for the UAV, and the allocation of the UAV's transmit power between different NOMA user pairs and within each pair. To efficiently solve this nonconvex problem, we decompose the problem into three subproblems using block coordinate descent. For the subproblem of intra-pair power allocation within each NOMA user pair, we construct a supermodular game with confirmed convergence to a Nash equilibrium. Given the intra-pair power allocation, successive convex approximation is applied to convexify and solve the subproblem of WPT time allocation and inter-pair power allocation between the user pairs. Finally, we solve the subproblem of UAV placement by using the Lagrange multiplier method. Simulations show that our approach can substantially outperform its alternatives that do not use NOMA and WPT techniques or that do not optimize the UAV location.

preprint2022arXiv

Two-Timescale Optimization for Intelligent Reflecting Surface-Assisted MIMO Transmission in Fast-Changing Channels

The application of intelligent reflecting surface (IRS) depends on the knowledge of channel state information (CSI), and has been hindered by the heavy overhead of channel training, estimation, and feedback in fast-changing channels. This paper presents a new two-timescale beamforming approach to maximizing the average achievable rate (AAR) of IRS-assisted MIMO systems, where the IRS is configured relatively infrequently based on statistical CSI (S-CSI) and the base station precoder and power allocation are updated frequently based on quickly outdated instantaneous CSI (I-CSI). The key idea is that we first reveal the optimal small-timescale power allocation based on outdated I-CSI yields a water-filling structure. Given the optimal power allocation, a new mini-batch sampling (mbs)- based particle swarm optimization (PSO) algorithm is developed to optimize the large-timescale IRS configuration with reduced channel samples. Another important aspect is that we develop a model-driven PSO algorithm to optimize the IRS configuration, which maximizes a lower bound of the AAR by only using the S-CSI and eliminates the need of channel samples. The modeldriven PSO serves as a dependable lower bound for the mbs-PSO. Simulations corroborate the superiority of the new two-timescale beamforming strategy to its alternatives in terms of the AAR and efficiency, with the benefits of the IRS demonstrated.

preprint2022arXiv

When Internet of Things meets Metaverse: Convergence of Physical and Cyber Worlds

In recent years, the Internet of Things (IoT) is studied in the context of the Metaverse to provide users immersive cyber-virtual experiences in mixed reality environments. This survey introduces six typical IoT applications in the Metaverse, including collaborative healthcare, education, smart city, entertainment, real estate, and socialization. In the IoT-inspired Metaverse, we also comprehensively survey four pillar technologies that enable augmented reality (AR) and virtual reality (VR), namely, responsible artificial intelligence (AI), high-speed data communications, cost-effective mobile edge computing (MEC), and digital twins. According to the physical-world demands, we outline the current industrial efforts and seven key requirements for building the IoT-inspired Metaverse: immersion, variety, economy, civility, interactivity, authenticity, and independence. In addition, this survey describes the open issues in the IoT-inspired Metaverse, which need to be addressed to eventually achieve the convergence of physical and cyber worlds.

preprint2021arXiv

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.

preprint2020arXiv

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.

preprint2020arXiv

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.

preprint2020arXiv

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.

preprint2020arXiv

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.

preprint2016arXiv

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.

preprint2016arXiv

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.

preprint2016arXiv

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!

preprint2016arXiv

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.

preprint2015arXiv

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.

preprint2015arXiv

Joint Multiple Symbol Differential Detection and Channel Decoding for Noncoherent UWB Impulse Radio by Belief Propagation

This paper proposes a belief propagation (BP) message passing algorithm based joint multiple symbol differential detection (MSDD) and channel decoding scheme for noncoherent differential ultra-wideband impulse radio (UWB-IR) systems. MSDD is an effective means to improve the performance of noncoherent differential UWB-IR systems. To optimize the overall detection and decoding performance, in this paper, we propose a novel soft-in soft-out (SISO) MSDD scheme and its integration with SISO channel decoding for noncoherent differential UWB-IR. we first propose a new auto-correlation receiver (AcR) architecture to sample the received UWB-IR signal. The proposed AcR can exploit the dependencies (imposed by the differential modulation) among data symbols throughout the whole packet. The signal probabilistic model has a hidden Markov chain structure. We use a factor graph to represent this hidden Markov chain. Then, we apply BP message passing algorithm on the factor graph to develop a SISO MSDD scheme, which has better performance than the previous MSDD scheme and is easy to be integrated with SISO channel decoding to form a joint MSDD and channel decoding scheme. Simulation results indicate the performance advantages of our MSDD scheme and joint MSDD and channel decoding scheme.

preprint2015arXiv

Low-Complexity Downlink User Selection for Massive MIMO Systems

In this paper we propose a pair of low-complexity user selection schemes with zero-forcing precoding for multiuser massive MIMO downlink systems, in which the base station is equipped with a large-scale antenna array. First, we derive approximations of the ergodic sum rates of the systems invoking the conventional random user selection (RUS) and the location-dependant user selection (LUS). Then, the optimal number of simultaneously served user equipments (UEs), $K^*$, is investigated to maximize the sum rate approximations. Upon exploiting $K^*$, we develop two user selection schemes, namely $K^*$-RUS and $K^*$-LUS, where $K^*$ UEs are selected either randomly or based on their locations. Both of the proposed schemes are independent of the instantaneous channel state information of small-scale fading, therefore enjoying the same extremely-low computational complexity as that of the conventional RUS scheme. Moreover, both of our proposed schemes achieve significant sum rate improvement over the conventional RUS. In addition, it is worth noting that like the conventional RUS, the $K^*$-RUS achieves good fairness among UEs.

preprint2015arXiv

Secrecy Transmit Beamforming for Heterogeneous Networks

In this paper, we pioneer the study of physical-layer security in heterogeneous networks (HetNets). We investigate secure communications in a two-tier downlink HetNet, which comprises one macrocell and several femtocells. Each cell has multiple users and an eavesdropper attempts to wiretap the intended macrocell user. Firstly, we consider an orthogonal spectrum allocation strategy to eliminate co-channel interference, and propose the secrecy transmit beamforming only operating in the macrocell (STB-OM) as a partial solution for secure communication in HetNet. Next, we consider a secrecy-oriented non-orthogonal spectrum allocation strategy and propose two cooperative STBs which rely on the collaboration amongst the macrocell base station (MBS) and the adjacent femtocell base stations (FBSs). Our first cooperative STB is the STB sequentially operating in the macrocell and femtocells (STB-SMF), where the cooperative FBSs individually design their STB matrices and then feed their performance metrics to the MBS for guiding the STB in the macrocell. Aiming to improve the performance of STB-SMF, we further propose the STB jointly designed in the macrocell and femtocells (STB-JMF), where all cooperative FBSs feed channel state information to the MBS for designing the joint STB. Unlike conventional STBs conceived for broadcasting or interference channels, the three proposed STB schemes all entail relatively sophisticated optimizations due to QoS constraints of the legitimate users. In order to efficiently use these STB schemes, the original optimization problems are reformulated and convex optimization techniques, such as second-order cone programming and semidefinite programming, are invoked to obtain the optimal solutions. Numerical results demonstrate that the proposed STB schemes are highly effective in improving the secrecy rate performance of HetNet.

preprint2015arXiv

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.

preprint2014arXiv

A Novel Scheme for Downlink Opportunistic Interference Alignment

In this paper we propose a downlink codebook-based opportunistic interference alignment (OIA) in a three-cell MIMO system. A codebook composed of multiple transmit vector sets is utilized to improve the multiuser selection diversity. The sum rate increases as the size of the codebook grows. In addition, during the user selection, effective channel gain and alignment metric are combined to generate a novel criterion, which improves the system performance, especially at low SNR. Furthermore, a threshold-based feedback approach is introduced to reduce the feedback load in the proposed scheme. Both the analytical results and simulations show that the proposed scheme provides significant improvement in terms of sum rates with no feedback load growth and slight increase of complexity.

preprint2014arXiv

An ESPRIT-Based Approach for 2-D Localization of Incoherently Distributed Sources in Massive MIMO Systems

In this paper, an approach of estimating signal parameters via rotational invariance technique (ESPRIT) is proposed for two-dimensional (2-D) localization of incoherently distributed (ID) sources in large-scale/massive multiple-input multiple-output (MIMO) systems. The traditional ESPRIT-based methods are valid only for one-dimensional (1-D) localization of the ID sources. By contrast, in the proposed approach the signal subspace is constructed for estimating the nominal azimuth and elevation direction-of-arrivals and the angular spreads. The proposed estimator enjoys closed-form expressions and hence it bypasses the searching over the entire feasible field. Therefore, it imposes significantly lower computational complexity than the conventional 2-D estimation approaches. Our analysis shows that the estimation performance of the proposed approach improves when the large-scale/massive MIMO systems are employed. The approximate Cramér-Rao bound of the proposed estimator for the 2-D localization is also derived. Numerical results demonstrate that albeit the proposed estimation method is comparable with the traditional 2-D estimators in terms of performance, it benefits from a remarkably lower computational complexity.

preprint2014arXiv

Limited Feedback-Based Interference Alignment for Interfering Multi-Access Channels

A limited feedback-based interference alignment (IA) scheme is proposed for the interfering multi-access channel (IMAC). By employing a novel performance-oriented quantization strategy, the proposed scheme is able to achieve the minimum overall residual inter-cell interference (ICI) with the optimized transceivers under limited feedback. Consequently, the scheme outperforms the existing counterparts in terms of system throughput. In addition, the proposed scheme can be implemented with flexible antenna configurations.

preprint2014arXiv

Low-Complexity Transmission Mode Selection in MU-MIMO Systems

We propose a low-complexity transmission strategy in multi-user multiple-input multiple-output downlink systems. The adaptive strategy adjusts the precoding methods, denoted as the transmission mode, to improve the system sum rates while maintaining the number of simultaneously served users. Three linear precoding transmission modes are discussed, i.e., the block diagonalization zero-forcing, the cooperative zero-forcing (CZF), and the cooperative matched-filter (CMF). Considering both the number of data streams and the multiple-antenna configuration of users, we modify the common CZF and CMF modes by allocating data streams. Then, the transmission mode is selected between the modified ones according to the asymptotic sum rate analyses. As instantaneous channel state information is not needed for the mode selection, the computational complexity is significantly reduced. Numerical simulations confirm our analyses and demonstrate that the proposed scheme achieves substantial performance gains with very low computational complexity.

preprint2013arXiv

A low complexity approach of combining cooperative diversity and multiuser diversity in multiuser cooperative networks

In this paper, we investigate the scheduling scheme to combine cooperative diversity (CD) and multiuser diversity (MUD) in multiuser cooperative networks under the time resource allocation (TRA) framework in which the whole transmission is divided into two phases: the broadcast phase and the relay phase. The broadcast phase is for direct transmission whereas the relay phase is for relay transmission. Based on this TRA framework, a user selection based low complexity relay protocol (US-LCRP) is proposed to combine CD and MUD. In each time slot (TS) of the broadcast phase, a "best" user is selected for transmission in order to obtain MUD. In the relay phase, the relays forward the messages of some specific users in a fixed order and then invoke the limited feedback information to achieve CD. We demonstrate that the diversity-multiplexing tradeoff (DMT) of the US-LCRP is superior to that of the existing schemes, where more TSs are allocated for direct transmission in order to jointly exploit CD and MUD. Our analytical and numerical results show that the US-LCRP constitutes a more efficient resource utilization approach than the existing schemes. Additionally, the US-LCRP can be implemented with low complexity because only the direct links' channel state information (CSI) is estimated during the whole transmission.

preprint2013arXiv

Approximate Bayesian Probabilistic-Data-Association-Aided Iterative Detection for MIMO Systems Using Arbitrary M-ary Modulation

In this paper, the issue of designing an iterative-detection-and-decoding (IDD)-aided receiver, relying on the low-complexity probabilistic data association (PDA) method, is addressed for turbo-coded multiple-input-multiple-output (MIMO) systems using general M-ary modulations. We demonstrate that the classic candidate-search-aided bit-based extrinsic log-likelihood ratio (LLR) calculation method is not applicable to the family of PDA-based detectors. Additionally, we reveal that, in contrast to the interpretation in the existing literature, the output symbol probabilities of existing PDA algorithms are not the true a posteriori probabilities (APPs) but, rather, the normalized symbol likelihoods. Therefore, the classic relationship, where the extrinsic LLRs are given by subtracting the a priori LLRs from the a posteriori LLRs, does not hold for the existing PDA-based detectors. Motivated by these revelations, we conceive a new approximate Bayesian-theorem-based logarithmic-domain PDA (AB-Log-PDA) method and unveil the technique of calculating bit-based extrinsic LLRs for the AB-Log-PDA, which facilitates the employment of the AB-Log-PDA in a simplified IDD receiver structure. Additionally, we demonstrate that we may dispense with inner iterations within the AB-Log-PDA in the context of IDD receivers. Our complexity analysis and numerical results recorded for Nakagami-m fading channels demonstrate that the proposed AB-Log-PDA-based IDD scheme is capable of achieving a performance comparable with that of the optimal maximum a posteriori (MAP)-detector-based IDD receiver, while imposing significantly lower computational complexity in the scenarios considered.

preprint2013arXiv

BER Analysis of Decision-Feedback Multiple Symbol Detection in Noncoherent MIMO Ultra-Wideband Systems

In this paper, we investigate noncoherent multiple-input multiple-output (MIMO) ultra-wideband (UWB) systems where the signal is encoded by differential space-time block code (DSTBC). DSTBC enables noncoherent MIMO UWB systems to achieve diversity gain. However, the traditional noncoherent symbol-by-symbol differential detection (DD) for DSTBC-UWB suffers from performance degradation compared with the coherent detection. We introduce a noncoherent multiple symbol detection (MSD) scheme to enhance the performance of DSTBC-UWB system. Although the MSD scheme can boost the performance more as the observation window size gets to larger, the complexity of the exhaustive search for MSD also exponentially increases in terms of the window size. To decrease the computational complexity, the concept of decision-feedback (DF) is introduced to MSD for DSTBC-UWB in this paper. The resultant DF-MSD yields reasonable complexity and also solid performance improvement. We provide the bit error rate (BER) analysis for the proposed DF-MSD. Both theoretical analysis and simulation results validate the proposed scheme.

preprint2013arXiv

Large-scale MU-MIMO: It Is Necessary to Deploy Extra Antennas at Base Station

In this paper, the large-scale MU-MIMO system is considered where a base station (BS) with extremely large number of antennas (N) serves relatively less number of users (K). In order to achieve largest sum rate, it is proven that the amount of users must be limited such that the number of antennas at the BS is preponderant over that of the antennas at all the users. In other words, the antennas at the BS should be excess. The extra antennas at the BS are no longer just an optional approach to enhance the system performance but the prerequisite to the largest sum rate. Based on this factor, for a fixed N, the optimal K that maximizes the sum rate is further obtained. Additionally, it is also pointed out that the sum rate can be substantially improved by only adding a few antennas at the BS when the system is N=KM with M denoting the antennas at each user. The derivations are under the assumption of N and M going to infinity, and being implemented on different precoders. Numerical simulations verify the tightness and accuracy of our asymptotic results even for small N and M.

preprint2011arXiv

Relaxed Belief Propagation for MIMO Detection

In this paper, relaxed belief propagation (RBP) based detectors are proposed for multiple-input multiple-out (MIMO) system. The factor graph is leveraged to represent the MIMO channels, and based on which our algorithms are developed. Unlike the existing complicated standard belief propagation (SBP) detector that considers all the edges of the factor graph when updating messages, the proposed RBP focuses on partial edges, which largely reduces computational complexity. In particular, relax degree is introduced in to determine how many edges to be selected, whereby RBP is a generalized edge selection based BP method and SBP is a special case of RBP having the smallest relax degree. Moreover, we propose a novel Gaussian approximation with feedback information mechanism to enable the proposed RBP detector. In order to further improve the detection performance, we also propose to cascade a minimum mean square error (MMSE) detector before the RBP detector, from which pseudo priori information is judiciously exploited. Convergence and complexity analyses, along with the numerical simulation results, verify that the proposed RBP outperform other BP methods having the similar complexity, and the MMSE cascaded RBP even outperform SBP at the largest relax degree in large MIMO systems.