Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2020 ( 1 )

2019 ( 13 )

2018 ( 59 )

2017 ( 55 )

Custom range...

Search Results: 1 - 10 of 2826 matches for " Tiejun Lv "
All listed articles are free for downloading (OA Articles)
Page 1 /2826
Display every page Item
Canceling Interferences for High Data Rate Time Reversal MIMO UWB System: A Precoding Approach
Wang Taotao,Lv Tiejun
EURASIP Journal on Wireless Communications and Networking , 2011,
Abstract: An ultra-high data rate time reversal (TR) multiple-input multiple-output (MIMO) ultra-wideband (UWB) communication system with space-time precoding is proposed. When the symbol duration is set to approach the duration of UWB monocycles, the data rate is close to the limit, resulting in the severe intersymbol interference (ISI). The zero-forcing (ZF) criterion-based space-time precoding presented in this paper eliminates both ISI and multistream interference (MSI) caused by spatial multiplexing at the sampling time. With less demand for the degree of freedom (the number of antennas) than other existing schemes, the proposed scheme enables the data rate to reach the order of Gbps without losing bit error rate (BER) performance. Since TR signal preprocessing and the proposed precoding both require the channel state information (CSI), a simple but effective channel estimation algorithm is also proposed to evaluate the impact of channel estimation on the proposed scheme.
Canceling Interferences for High Data Rate Time Reversal MIMO UWB System: A Precoding Approach
Taotao Wang,Tiejun Lv
EURASIP Journal on Wireless Communications and Networking , 2011, DOI: 10.1155/2011/959478
Relaxed Belief Propagation for MIMO Detection
Feichi Long,Tiejun Lv
Mathematics , 2011,
Abstract: 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.
Large-scale MU-MIMO: It Is Necessary to Deploy Extra Antennas at Base Station
Wei Ding,Tiejun Lv
Computer Science , 2013,
Abstract: 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.
Joint Cross-Layer Design for Wireless QoS Content Delivery
Jie Chen,Tiejun Lv,Haitao Zheng
EURASIP Journal on Advances in Signal Processing , 2005, DOI: 10.1155/asp.2005.167
Abstract: In this paper, we propose a joint cross-layer design for wireless quality-of-service (QoS) content delivery. Central to our proposed cross-layer design is the concept of adaptation. Adaptation represents the ability to adjust protocol stacks and applications to respond to channel variations. We focus our cross-layer design especially on the application, media access control (MAC), and physical layers. The network is designed based on our proposed fast frequency-hopping orthogonal frequency division multiplex (OFDM) technique. We also propose a QoS-awareness scheduler and a power adaptation transmission scheme operating at both the base station and mobile sides. The proposed MAC scheduler coordinates the transmissions of an IP base station and mobile nodes. The scheduler also selects appropriate transmission formats and packet priorities for individual users based on current channel conditions and the users' QoS requirements. The test results show that our cross-layer design provides an excellent framework for wireless QoS content delivery.
DSC and universal bit-level combining for HARQ systems
Lv Tiejun,Xia Jinhuan,Long Feichi
EURASIP Journal on Wireless Communications and Networking , 2011,
Abstract: This paper proposes a Dempster -Shafer theory based combining scheme for single-input single-output (SISO) systems with hybrid automatic retransmission request (HARQ), referred to as DSC, in which two methods for soft information calculations are developed for equiprobable (EP) and non-equiprobable (NEP) sources, respectively. One is based on the distance from the received signal to the decision candidate set consisting of adjacent constellation points when the source bits are equiprobable, and the corresponding DSC is regarded as DSC-D. The other is based on the posterior probability of the transmitted signals when the priori probability for the NEP source bits is available, and the corresponding DSC is regarded as DSC-APP. For the diverse EP and NEP source cases, both DSCD and DSC-APP are superior to maximal ratio combining, the so-called optimal combining scheme for SISO systems. Moreover, the robustness of the proposed DSC is illustrated by the simulations performed in Rayleigh channel and AWGN channel, respectively. The results show that the proposed DSC is insensitive to and especially applicable to the fading channels. In addition, a DS detection-aided bit-level DS combining scheme is proposed for multiple-input multiple-output--HARQ systems. The bit-level DS combining is deduced to be a universal scheme, and the traditional log-likelihood-ratio combining is a special case when the likelihood probability is used as bit-level soft information.
Low-Complexity Blind Symbol Timing Offset Estimation in OFDM Systems
Tiejun Lv,Jie Chen,Hua Li
EURASIP Journal on Advances in Signal Processing , 2005, DOI: 10.1155/asp.2005.532
Abstract: A low-complexity blind timing algorithm is proposed to estimate timing offset in OFDM systems when multiple symbols are received (the timing offset estimation is independent of the frequency offset one). Though the maximum-likelihood estimation (MLE) using two or three symbols is good in offset estimation, its performance can be significantly improved by including more symbols in our previous work. However, timing offset estimation requires exhaustive search and a priori knowledge of the probability distribution of the received data. The method we propose utilizes the second-order statistics embedded in a cyclic prefix. An information vector (IVR) with the same length as the cyclic prefix is formed based on an autocorrelation matrix (AM). The modulus of elements in the IVR is first quantized based on a threshold that is defined by the variance of OFDM symbols. The timing offset is then estimated based on the binary sequence of the IVR. Because the exhaustive search used in the MLE can be avoided, computational complexity is significantly reduced. In practice, the proposed scheme can be used as a coarse synchronization estimation that can rapidly provide a rough and contractible estimation range, which serves as the basis for a fine estimation like the MLE. The proposed estimator will be proved theoretically to be asymptotically unbiased and mean-squared consistent. Simulations and comparisons will be provided in the paper to illustrate the advantages of our design.
Secrecy Transmit Beamforming for Heterogeneous Networks
Tiejun Lv,Hui Gao,Shaoshi Yang
Mathematics , 2015, DOI: 10.1109/JSAC.2015.2416984
Abstract: 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.
A low complexity approach of combining cooperative diversity and multiuser diversity in multiuser cooperative networks
Tiejun Lv,Zhang Zhang,Shaoshi Yang
Computer Science , 2013, DOI: 10.1109/TSP.2013.2284484
Abstract: 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.
Constructing the Energy Landscape for Genetic Switching System Driven by Intrinsic Noise
Cheng Lv, Xiaoguang Li, Fangting Li, Tiejun Li
PLOS ONE , 2014, DOI: 10.1371/journal.pone.0088167
Abstract: Genetic switching driven by noise is a fundamental cellular process in genetic regulatory networks. Quantitatively characterizing this switching and its fluctuation properties is a key problem in computational biology. With an autoregulatory dimer model as a specific example, we design a general methodology to quantitatively understand the metastability of gene regulatory system perturbed by intrinsic noise. Based on the large deviation theory, we develop new analytical techniques to describe and calculate the optimal transition paths between the on and off states. We also construct the global quasi-potential energy landscape for the dimer model. From the obtained quasi-potential, we can extract quantitative results such as the stationary distributions of mRNA, protein and dimer, the noise strength of the expression state, and the mean switching time starting from either stable state. In the final stage, we apply this procedure to a transcriptional cascades model. Our results suggest that the quasi-potential energy landscape and the proposed methodology are general to understand the metastability in other biological systems with intrinsic noise.
Page 1 /2826
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.