Yuejun Wei
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Yuejun Wei has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
Wen Chen
Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China
5 shared publicationsYuhang Yang
Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China
4 shared publicationsLili Wei
Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China
3 shared publications- Liang Ma
Center for Joint Quantum Studies Department of Physics School of Science Tianjin University 300350 Tianjin China
2 shared publications Ming Jiang
National Mobile Communications Research Laboratory Southeast University, Nanjing, P. R. China
2 shared publicationsYing Xu
2 shared publications
Latest Publications
- Top Cited Papers
- 19 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 69 (5) , 2830-2840
ORBGRAND Is Almost Capacity-Achieving
Decoding via sequentially guessing the error pattern in a received noisy sequence has received attention recently, and ORBGRAND has been proposed as one such decoding algorithm that is capable of utilizing the soft information embedded in the received noisy sequence. An information theoretic study is conducted for ORBGRAND, and it is shown that the achievable rate of ORBGRAND using independent and identically distributed random codebooks almost coincides with the channel capacity, for an additive white Gaussian noise channel under antipodal input. For finite-length codes, improved guessing schemes motivated by the information theoretic study are proposed that attain lower error rates than ORBGRAND, especially in the high signal-to-noise ratio regime.
- 19 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 69 (5) , 2830-2840
Top Cited PapersORBGRAND Is Almost Capacity-Achieving
Decoding via sequentially guessing the error pattern in a received noisy sequence has received attention recently, and ORBGRAND has been proposed as one such decoding algorithm that is capable of utilizing the soft information embedded in the received noisy sequence. An information theoretic study is conducted for ORBGRAND, and it is shown that the achievable rate of ORBGRAND using independent and identically distributed random codebooks almost coincides with the channel capacity, for an additive white Gaussian noise channel under antipodal input. For finite-length codes, improved guessing schemes motivated by the information theoretic study are proposed that attain lower error rates than ORBGRAND, especially in the high signal-to-noise ratio regime.
- 10 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 67 (12) , 8818-8833
Design and Analysis of Probabilistic Shaping Scheme for Uplink Nonorthogonal Multiple Access Systems
- 10 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 67 (12) , 8818-8833
Design and Analysis of Probabilistic Shaping Scheme for Uplink Nonorthogonal Multiple Access Systems
- 12 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 7 (5) , 800-803
Low-Rate PBRL-LDPC Codes for URLLC in 5G
In this letter, we propose a class of rate-compatible raptor-like protographs, which is aimed at the design of low-rate low-density parity-check (LDPC) codes with short length and fast convergence for ultra-reliable and low-latency communications in 5G. In the proposed protographs, the connection degrees can be progressively optimized by the protograph-based extrinsic information transfer analysis with a limited number of iterations. Following the protograph optimization, we construct the rate-compatible LDPC codes by a simplified error minimization progressive edge-growth algorithm and carry out simulations for performance comparisons. The simulation results show that our proposed LDPC codes have noticeable advantages over the existing low-rate LDPC codes with short length and limited numbers of decoding iterations.
- 12 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 7 (5) , 800-803
Low-Rate PBRL-LDPC Codes for URLLC in 5G
In this letter, we propose a class of rate-compatible raptor-like protographs, which is aimed at the design of low-rate low-density parity-check (LDPC) codes with short length and fast convergence for ultra-reliable and low-latency communications in 5G. In the proposed protographs, the connection degrees can be progressively optimized by the protograph-based extrinsic information transfer analysis with a limited number of iterations. Following the protograph optimization, we construct the rate-compatible LDPC codes by a simplified error minimization progressive edge-growth algorithm and carry out simulations for performance comparisons. The simulation results show that our proposed LDPC codes have noticeable advantages over the existing low-rate LDPC codes with short length and limited numbers of decoding iterations.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
A universal interleaver design for bit-interleaved QC-LDPC coded modulation
A universal design methodology for inter-leavers in bit-interleaved coded modulation (BICM) systems deploying binary irregular quasi-cyclic low-density parity-check (QC-LDPC) codes and higher-order modulation is presented. The interleaver is introduced to lower decoding threshold when higher-order modulation is adopted. For this purpose, an optimization procedure with modified numerical analysis as cost function is applied to derive good mapping distributions, which are used to describe the interleaver configuration. Decoding simulation, being consistent with numerical results shows that our method works effectively for LDPC coded modulation.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
A universal interleaver design for bit-interleaved QC-LDPC coded modulation
A universal design methodology for inter-leavers in bit-interleaved coded modulation (BICM) systems deploying binary irregular quasi-cyclic low-density parity-check (QC-LDPC) codes and higher-order modulation is presented. The interleaver is introduced to lower decoding threshold when higher-order modulation is adopted. For this purpose, an optimization procedure with modified numerical analysis as cost function is applied to derive good mapping distributions, which are used to describe the interleaver configuration. Decoding simulation, being consistent with numerical results shows that our method works effectively for LDPC coded modulation.
- 1 June 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 35-38
Improved list decoding of tail-biting convolutional codes
The novel decoding algorithm for the list decoding of tail-biting convolutional codes is described. The main idea is first to estimate the most reliable state from all state spaces for transmitted codeword by using a Soft Input Soft Output decoder, and then to perform the list Viterbi decoding algorithm from this state around the circular tail-biting trellis. For the LTE standard concatenated coding scheme this algorithm provides block error rate performance that is almost the same as for the optimal brute-force list decoding algorithm with significantly less complexity (about 11 times) for list size L=4.
- 1 June 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 35-38
Improved list decoding of tail-biting convolutional codes
The novel decoding algorithm for the list decoding of tail-biting convolutional codes is described. The main idea is first to estimate the most reliable state from all state spaces for transmitted codeword by using a Soft Input Soft Output decoder, and then to perform the list Viterbi decoding algorithm from this state around the circular tail-biting trellis. For the LTE standard concatenated coding scheme this algorithm provides block error rate performance that is almost the same as for the optimal brute-force list decoding algorithm with significantly less complexity (about 11 times) for list size L=4.
- 30 January 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 17 (3) , 545-548
Speech Quality Improvement Based on List Viterbi and Joint Source-Channel Decoding in UMTS
In this letter, we propose a simple and efficient method, called `Dual-CRC', to improve speech quality based on the list Viterbi algorithm (LVA) in the Universal Mobile Telecommunications System (UMTS). We also employ the well-known joint source-channel decoding (JSCD) scheme together with LVA decoding to further improve the speech quality. Simulation results show that the two proposed decoders, the Dual-CRC LVA and the combination of the LVA and the JSCD, can significantly improve the speech quality for UMTS, especially in low signal-to-noise ratio and low mean opinion score regions.
- 30 January 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 17 (3) , 545-548
Speech Quality Improvement Based on List Viterbi and Joint Source-Channel Decoding in UMTS
In this letter, we propose a simple and efficient method, called `Dual-CRC', to improve speech quality based on the list Viterbi algorithm (LVA) in the Universal Mobile Telecommunications System (UMTS). We also employ the well-known joint source-channel decoding (JSCD) scheme together with LVA decoding to further improve the speech quality. Simulation results show that the two proposed decoders, the Dual-CRC LVA and the combination of the LVA and the JSCD, can significantly improve the speech quality for UMTS, especially in low signal-to-noise ratio and low mean opinion score regions.
- 22 October 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 16 (12) , 2060-2063
Joint Shortening and Puncturing Optimization for Structured LDPC Codes
The demand for flexible broadband wireless services makes the pruning technique, including both shortening and puncturing, an indispensable component of error correcting codes. The analysis of the pruning process for structured low-density parity-check (LDPC) codes can be considerably simplified with their equivalent representations through base-matrices or protographs. In this letter, we evaluate the thresholds of the pruned base-matrices by using protograph based on extrinsic information transfer (PEXIT). We also provide an efficient method to optimize the pruning patterns, which can significantly improve the thresholds of both the full-length patterns and the sub-patterns. Numerical results show that the structured LDPC codes pruned by the improved patterns outperform those with the existing patterns.
- 22 October 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 16 (12) , 2060-2063
Joint Shortening and Puncturing Optimization for Structured LDPC Codes
The demand for flexible broadband wireless services makes the pruning technique, including both shortening and puncturing, an indispensable component of error correcting codes. The analysis of the pruning process for structured low-density parity-check (LDPC) codes can be considerably simplified with their equivalent representations through base-matrices or protographs. In this letter, we evaluate the thresholds of the pruned base-matrices by using protograph based on extrinsic information transfer (PEXIT). We also provide an efficient method to optimize the pruning patterns, which can significantly improve the thresholds of both the full-length patterns and the sub-patterns. Numerical results show that the structured LDPC codes pruned by the improved patterns outperform those with the existing patterns.
- 1 October 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Linear transceiver and receiver design methods for multiuser MIMO channels
Multiuser multiple-input multiple-output (MU-MIMO) systems has attracted considerable interests due to the promising potentials. In this paper, we are trying to make some connections between linear transmitter/beamforming and receiver design in MU-MIMO systems with code-division multiple-access (CDMA) signature and receiver design methods. Some methods discussed previously in optimization of CDMA signatures and receivers may be applied to the multiuser MIMO systems, to design the linear beamforming and receiving vectors. With a general multiuser MIMO system model, we present three different design methods based on three different criteria: (i) Minimizing the effective TSC among all users; (ii) Minimizing the total mean square error (MSE); (iii) Maximizing the sum capacity of the system. We derive in details the design methods under those different design criteria. Simulation results show that different methods demonstrate differently under those criteria.
- 1 October 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Linear transceiver and receiver design methods for multiuser MIMO channels
Multiuser multiple-input multiple-output (MU-MIMO) systems has attracted considerable interests due to the promising potentials. In this paper, we are trying to make some connections between linear transmitter/beamforming and receiver design in MU-MIMO systems with code-division multiple-access (CDMA) signature and receiver design methods. Some methods discussed previously in optimization of CDMA signatures and receivers may be applied to the multiuser MIMO systems, to design the linear beamforming and receiving vectors. With a general multiuser MIMO system model, we present three different design methods based on three different criteria: (i) Minimizing the effective TSC among all users; (ii) Minimizing the total mean square error (MSE); (iii) Maximizing the sum capacity of the system. We derive in details the design methods under those different design criteria. Simulation results show that different methods demonstrate differently under those criteria.
- 7 September 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 16 (10) , 1664-1667
Comments on "A New Parity-Check Stopping Criterion for Turbo Decoding"
A parity-check stopping (PCS) criterion for turbo decoding is proposed in , which shows its priority compared with the stopping criteria of Sign Change Ratio (SCR), Sign Difference Ratio (SDR), Cross Entropy (CE) and improved CE-based (Yu) method. But another well-known simple stopping criterion named Hard-Decision-Aided (HDA) criterion has not been compared in . In this letter, through analysis we show that using max-log-MAP algorithm, PCS is equivalent to HDA; while simulations demonstrate that using log-MAP algorithm, PCS has nearly the same performance as HDA.
- 7 September 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 16 (10) , 1664-1667
Comments on "A New Parity-Check Stopping Criterion for Turbo Decoding"
A parity-check stopping (PCS) criterion for turbo decoding is proposed in , which shows its priority compared with the stopping criteria of Sign Change Ratio (SCR), Sign Difference Ratio (SDR), Cross Entropy (CE) and improved CE-based (Yu) method. But another well-known simple stopping criterion named Hard-Decision-Aided (HDA) criterion has not been compared in . In this letter, through analysis we show that using max-log-MAP algorithm, PCS is equivalent to HDA; while simulations demonstrate that using log-MAP algorithm, PCS has nearly the same performance as HDA.
- 1 May 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15502252,p. 1-5
On the Super Codes of the First Order Reed-Muller Code Based on m-Sequence Pairs
The super codes of the first order Reed-Muller code are widely used in the practical wireless communication systems, such as WCDMA and LTE. However, the super codes are usually obtained by exhaustive computer search, which involves huge computational cost. Therefore a systematic algorithm to construct the super codes beyond exhaustive computer search has been expected for long time. In this paper, we propose a systematic algorithm for the super codes construction base on the m-sequence pairs, which only involves some item permutation within the m-sequence. In addition, the constructed super codes outperform the conventional codes in terms of decoding error rate. Meanwhile, the super codes share the same characteristics as the conventional ones, such as being of arbitrary length and rate, and being efficiently decodable with Fast Hadamard Transform (FHT).
- 1 May 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15502252,p. 1-5
On the Super Codes of the First Order Reed-Muller Code Based on m-Sequence Pairs
The super codes of the first order Reed-Muller code are widely used in the practical wireless communication systems, such as WCDMA and LTE. However, the super codes are usually obtained by exhaustive computer search, which involves huge computational cost. Therefore a systematic algorithm to construct the super codes beyond exhaustive computer search has been expected for long time. In this paper, we propose a systematic algorithm for the super codes construction base on the m-sequence pairs, which only involves some item permutation within the m-sequence. In addition, the constructed super codes outperform the conventional codes in terms of decoding error rate. Meanwhile, the super codes share the same characteristics as the conventional ones, such as being of arbitrary length and rate, and being efficiently decodable with Fast Hadamard Transform (FHT).