SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "WFRF:(Zheng Zhongliang) "

Search: WFRF:(Zheng Zhongliang)

  • Result 1-4 of 4
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Bao, Jinchen, et al. (author)
  • Bit-Interleaved Coded SCMA With Iterative Multiuser Detection : Multidimensional Constellations Design
  • 2018
  • In: IEEE Transactions on Communications. - : IEEE Press. - 0090-6778 .- 1558-0857. ; 66:11, s. 5292-5304
  • Journal article (peer-reviewed)abstract
    • This paper investigates the constellation/codebook design of a promising uplink multiple access technique, sparse code multiple access (SCMA), proposed for the fifth generation mobile networks. The application of bit-interleaved coded modulation with iterative multiuser detection is considered for uplink SCMA over fading channels. Extrinsic information transfer chart is used to aid the analysis and the design of multidimensional constellations, and the design criteria for multidimensional constellations and labelings optimization are thus established. Furthermore, a new and simple approach of multi-stage optimization for the multidimensional constellation design is proposed for SCMA, to improve the bit-error rate performance and alleviate the complexity of turbo multiuser detection. Numerical and simulation results are also provided to demonstrate the performance and verify the efficiency of the proposed scheme, compared with the state of the art.
  •  
2.
  • Bao, Jinchen, et al. (author)
  • Error Performance of Sparse Code Multiple Access Networks with Joint ML Detection
  • 2016
  • In: 2016 IEEE 83RD VEHICULAR TECHNOLOGY CONFERENCE (VTC SPRING). - : IEEE. - 9781509016983
  • Conference paper (peer-reviewed)abstract
    • This paper investigates error performance of sparse code multiple access (SCMA) networks with multiple access channels (MAC) and broadcast channels (BC). We give the closedform expression for the pairwise error probability (PEP) of joint maximum likelihood (ML) detection for multiuser signals over additive white Gaussian noise (AWGN) and Rayleigh fading channels with an arbitrary number of users and multidimensional codebooks. An upper bound for the average symbol error rate (SER) is calculated. The bound is tight in both AWGN channel and Rayleigh fading channels for high SNR regions. The analytical bounds are compared with simulations, and the results confirm the effectiveness of the analysis for both AWGN and Rayleigh fading channels.
  •  
3.
  • Bao, Jinchen, et al. (author)
  • Performance Analysis of Uplink SCMA With Receiver Diversity and Randomly Deployed Users
  • 2018
  • In: IEEE Transactions on Vehicular Technology. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 0018-9545 .- 1939-9359. ; 67:3, s. 2792-2797
  • Journal article (peer-reviewed)abstract
    • This paper considers the performance analysis of sparse code multiple access (SCMA) with receive diversity arrays and randomly deployed users in a cellular uplink scenario. The impact of path loss on the performance of SCMA is characterized, by assuming independent Rayleigh fading and joint maximum likelihood (ML) receivers. A tight upper bound on the probability of symbol detection error is derived, and the achievable diversity and coding gains are investigated. The analytical results are validated by using simulations, and show that a diversity order which is equal to the product of the number of receive antennas and the signal-space diversity can be achieved, and the large-scale path-loss decreases only the coding gain.
  •  
4.
  • Bao, Xing, et al. (author)
  • An efficient hybrid differential evolutionary algorithm for zbilevel optimisation problems
  • 2019
  • In: Ekonomska Istrazivanja. - : ROUTLEDGE JOURNALS, TAYLOR & FRANCIS LTD. - 1331-677X .- 1848-9664. ; 32:1, s. 3016-3033
  • Journal article (peer-reviewed)abstract
    • Bilevel problems are widely used to describe the decision problems with hierarchical upper-lower-level structures in many economic fields. The bilevel optimisation problem (BLOP) is intrinsically NP-hard when its objectives and constraints are complex and the decision variables are large in scale at both levels. An efficient hybrid differential evolutionary algorithm for BLOP (HDEAB) is proposed where the optimal lower level value function mapping method, the differential evolutionary algorithm, k-nearest neighbours (KNN) and a nested local search are hybridised to improve the computational accuracy and efficiency. To show the performance of the HDEAB, numerical studies were conducted on SMD (Sinha, Maro and Deb) instances and an application example of optimising a venture capital staged-financing contract. The results demonstrate that the HDEAB outperforms the BLEAQ (bilevel evolutionary algorithm based on quadratic approximations) greatly in solving the BLOPs with different scales.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-4 of 4

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view