Liqiang Jin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Liqiang Jin has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Hongwen Yang
Beijing University of Posts and Telecommunications
3 shared publications - Pei Yang
School of Wireless Communication Center, Beijing University of Posts and Telecommunications, Beijing 100876, China
2 shared publications Hongwen Yang
Beijing Univ Posts & Telecommun, Wireless Commun Ctr, Beijing 100876, Peoples R China
1 shared publication- Yue Wu
School of Department of Electronic and Information Engineering, Anhui University of Finance and Economics, Anhui 233030, China
1 shared publication
Latest Publications
- Open Access
Distributed Joint Source-Channel Coding Using Quasi-Uniform Systematic Polar Codes
This paper proposes a distributed joint source-channel coding (DJSCC) scheme using polar-like codes. In the proposed scheme, each distributed source encodes source message with a quasi-uniform systematic polar code (QSPC) or a punctured QSPC, and only transmits parity bits over its independent channel. These systematic codes play the role of both source compression and error protection. For the infinite code-length, we show that the proposed scheme approaches the information-theoretical limit by the technique of joint source-channel polarization with side information. For the finite code-length, the simulation results verify that the proposed scheme outperforms the distributed separate source-channel coding (DSSCC) scheme using polar codes and the DJSCC scheme using classic systematic polar codes.
Open AccessDistributed Joint Source-Channel Coding Using Quasi-Uniform Systematic Polar Codes
This paper proposes a distributed joint source-channel coding (DJSCC) scheme using polar-like codes. In the proposed scheme, each distributed source encodes source message with a quasi-uniform systematic polar code (QSPC) or a punctured QSPC, and only transmits parity bits over its independent channel. These systematic codes play the role of both source compression and error protection. For the infinite code-length, we show that the proposed scheme approaches the information-theoretical limit by the technique of joint source-channel polarization with side information. For the finite code-length, the simulation results verify that the proposed scheme outperforms the distributed separate source-channel coding (DSSCC) scheme using polar codes and the DJSCC scheme using classic systematic polar codes.
- Open Access
- 4 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 7340-7349
Joint Source-Channel Polarization With Side Information
As an extension of source polarization and channel polarization, this paper considers joint source-channel polarization, which results in a joint source-channel coding (JSCC) scheme using a quasiuniform systematic polar code (SPC). In this JSCC scheme, the source with side information is encoded as a systematic polar codeword and only parity bits are transmitted through the channel. The indices of systematic bits are quasi-uniform, which enable the source and the channel to be jointly polarized to either a high entropy part or a low entropy part. The analysis reveals that the quasi-uniform SPC can not be constructed via original polar coding. To solve this problem, additional bit-swap coding is introduced to modify original polar coding and construct this kind of SPCs. The proposed JSCC scheme can asymptotically approach the information-theoretical limit. For the noiseless channel, the proposed scheme is degraded into classic Slepain-Wolf coding or lossless source coding based on parity approach.
- 4 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 7340-7349
Open AccessJoint Source-Channel Polarization With Side Information
As an extension of source polarization and channel polarization, this paper considers joint source-channel polarization, which results in a joint source-channel coding (JSCC) scheme using a quasiuniform systematic polar code (SPC). In this JSCC scheme, the source with side information is encoded as a systematic polar codeword and only parity bits are transmitted through the channel. The indices of systematic bits are quasi-uniform, which enable the source and the channel to be jointly polarized to either a high entropy part or a low entropy part. The analysis reveals that the quasi-uniform SPC can not be constructed via original polar coding. To solve this problem, additional bit-swap coding is introduced to modify original polar coding and construct this kind of SPCs. The proposed JSCC scheme can asymptotically approach the information-theoretical limit. For the noiseless channel, the proposed scheme is degraded into classic Slepain-Wolf coding or lossless source coding based on parity approach.
- 30 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 22 (1) , 49-52
Distributed Joint Source-Channel Decoding Using Systematic Polar Codes
This letter proposes a novel joint decoding scheme for correlated sources using systematic polar codes. In the proposed scheme, each source independently encodes its message into a systematic polar codeword and sends the codeword via a binary-input additive white Gaussian noise (BI-AWGN) channel to the common destination, where adaptive CRC-aided successive cancellation list (CA-SCL) decoders are employed. During the iterative decoding process, the log likelihood ratios (LLRs) fed to each adaptive CA-SCL decoder are iteratively combined with the extrinsic LLRs from other decoders. The correlation among the sources is exploited to improve the decoding performance. Simulation results show that, in comparison with independent decoding, the proposed scheme can achieve significantly improved decoding performance without increased complexity.
- 30 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 22 (1) , 49-52
Distributed Joint Source-Channel Decoding Using Systematic Polar Codes
This letter proposes a novel joint decoding scheme for correlated sources using systematic polar codes. In the proposed scheme, each source independently encodes its message into a systematic polar codeword and sends the codeword via a binary-input additive white Gaussian noise (BI-AWGN) channel to the common destination, where adaptive CRC-aided successive cancellation list (CA-SCL) decoders are employed. During the iterative decoding process, the log likelihood ratios (LLRs) fed to each adaptive CA-SCL decoder are iteratively combined with the extrinsic LLRs from other decoders. The correlation among the sources is exploited to improve the decoding performance. Simulation results show that, in comparison with independent decoding, the proposed scheme can achieve significantly improved decoding performance without increased complexity.
- Open Access
Sum Capacity for Single-Cell Multi-User Systems with M-Ary Inputs
This paper investigates the sum capacity of a single-cell multi-user system under the constraint that the transmitted signal is adopted from M-ary two-dimensional constellation with equal probability for both uplink, i.e., multiple access channel (MAC), and downlink, i.e., broadcast channel (BC) scenarios. Based on the successive interference cancellation (SIC) and the entropy power Gaussian approximation, it is shown that both the multi-user MAC and BC can be approximated to a bank of parallel channels with the channel gains being modified by an extra attenuate factor that equals to the negative exponential of the capacity of interfering users. With this result, the capacity of MAC and BC with arbitrary number of users and arbitrary constellations can be easily calculated which in sharp contrast with using traditional Monte Carlo simulation that the calculating amount increases exponentially with the increase of the number of users. Further, the sum capacity of multi-user under different power allocation strategies including equal power allocation, equal capacity power allocation and maximum capacity power allocation is also investigated. For the equal capacity power allocation, a recursive relation for the solution of power allocation is derived. For the maximum capacity power allocation, the necessary condition for optimal power allocation is obtained and an optimal algorithm for the power allocation optimization problem is proposed based on the necessary condition.
Open AccessSum Capacity for Single-Cell Multi-User Systems with M-Ary Inputs
This paper investigates the sum capacity of a single-cell multi-user system under the constraint that the transmitted signal is adopted from M-ary two-dimensional constellation with equal probability for both uplink, i.e., multiple access channel (MAC), and downlink, i.e., broadcast channel (BC) scenarios. Based on the successive interference cancellation (SIC) and the entropy power Gaussian approximation, it is shown that both the multi-user MAC and BC can be approximated to a bank of parallel channels with the channel gains being modified by an extra attenuate factor that equals to the negative exponential of the capacity of interfering users. With this result, the capacity of MAC and BC with arbitrary number of users and arbitrary constellations can be easily calculated which in sharp contrast with using traditional Monte Carlo simulation that the calculating amount increases exponentially with the increase of the number of users. Further, the sum capacity of multi-user under different power allocation strategies including equal power allocation, equal capacity power allocation and maximum capacity power allocation is also investigated. For the equal capacity power allocation, a recursive relation for the solution of power allocation is derived. For the maximum capacity power allocation, the necessary condition for optimal power allocation is obtained and an optimal algorithm for the power allocation optimization problem is proposed based on the necessary condition.