Iteratively Decodable Code

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 3 Experts worldwide ranked by ideXlab platform

Jun Cheng - One of the best experts on this subject based on the ideXlab platform.

  • Super-Sparse On-Off Division Multiple Access: Replacing Repetition With Idling
    IEEE Transactions on Communications, 2020
    Co-Authors: Guanghui Song, Kui Cai, Yuhao Chi, Jie Guo, Jun Cheng
    Abstract:

    A very low-complexity on-off division multiple access (ODMA) scheme is proposed for $K$ -user non-orthogonal multiple access (NOMA) systems. At the transmission side, each user employs the same length- $m$ channel Code whose Coded bits, after modulation, are sent in a random time-hopping manner. Specifically, $m$ Coded bits are randomly scheduled and sent using $n$ time slots with $n\gg m$ , i.e., only $m$ slots are used for signal transmission and the other $n-m$ slots are idle. The slot selection, referred to as an on-off pattern, is unique to each user, and it is the only means of user separation. Consequently, at each time slot only a very few users (i.e., 2 or 3) may simultaneously access the channel, leading to a super-sparse access system. Due to the sparse access property, a very low-complexity iterative multi-user decoding method can be implemented on an almost tree-like factor graph. Compared with existing Iteratively Decodable Code division multiple access (CDMA) schemes, such as sparse-CDMA and interleave division multiple access (IDMA), ODMA does not rely on repetition (spreading) or user interleaving. In fact, we show that in using extrinsic information transfer (EXIT) analysis and simulation, idling is more effective than repetition in terms of enhancing the multi-user iterative decoding performance. By replacing repetition with idling, a remarkable multi-user decoding performance gain is achieved and, at the same time, the decoding complexity is significantly reduced.

Guanghui Song - One of the best experts on this subject based on the ideXlab platform.

  • Super-Sparse On-Off Division Multiple Access: Replacing Repetition With Idling
    IEEE Transactions on Communications, 2020
    Co-Authors: Guanghui Song, Kui Cai, Yuhao Chi, Jie Guo, Jun Cheng
    Abstract:

    A very low-complexity on-off division multiple access (ODMA) scheme is proposed for $K$ -user non-orthogonal multiple access (NOMA) systems. At the transmission side, each user employs the same length- $m$ channel Code whose Coded bits, after modulation, are sent in a random time-hopping manner. Specifically, $m$ Coded bits are randomly scheduled and sent using $n$ time slots with $n\gg m$ , i.e., only $m$ slots are used for signal transmission and the other $n-m$ slots are idle. The slot selection, referred to as an on-off pattern, is unique to each user, and it is the only means of user separation. Consequently, at each time slot only a very few users (i.e., 2 or 3) may simultaneously access the channel, leading to a super-sparse access system. Due to the sparse access property, a very low-complexity iterative multi-user decoding method can be implemented on an almost tree-like factor graph. Compared with existing Iteratively Decodable Code division multiple access (CDMA) schemes, such as sparse-CDMA and interleave division multiple access (IDMA), ODMA does not rely on repetition (spreading) or user interleaving. In fact, we show that in using extrinsic information transfer (EXIT) analysis and simulation, idling is more effective than repetition in terms of enhancing the multi-user iterative decoding performance. By replacing repetition with idling, a remarkable multi-user decoding performance gain is achieved and, at the same time, the decoding complexity is significantly reduced.

Kui Cai - One of the best experts on this subject based on the ideXlab platform.

  • Super-Sparse On-Off Division Multiple Access: Replacing Repetition With Idling
    IEEE Transactions on Communications, 2020
    Co-Authors: Guanghui Song, Kui Cai, Yuhao Chi, Jie Guo, Jun Cheng
    Abstract:

    A very low-complexity on-off division multiple access (ODMA) scheme is proposed for $K$ -user non-orthogonal multiple access (NOMA) systems. At the transmission side, each user employs the same length- $m$ channel Code whose Coded bits, after modulation, are sent in a random time-hopping manner. Specifically, $m$ Coded bits are randomly scheduled and sent using $n$ time slots with $n\gg m$ , i.e., only $m$ slots are used for signal transmission and the other $n-m$ slots are idle. The slot selection, referred to as an on-off pattern, is unique to each user, and it is the only means of user separation. Consequently, at each time slot only a very few users (i.e., 2 or 3) may simultaneously access the channel, leading to a super-sparse access system. Due to the sparse access property, a very low-complexity iterative multi-user decoding method can be implemented on an almost tree-like factor graph. Compared with existing Iteratively Decodable Code division multiple access (CDMA) schemes, such as sparse-CDMA and interleave division multiple access (IDMA), ODMA does not rely on repetition (spreading) or user interleaving. In fact, we show that in using extrinsic information transfer (EXIT) analysis and simulation, idling is more effective than repetition in terms of enhancing the multi-user iterative decoding performance. By replacing repetition with idling, a remarkable multi-user decoding performance gain is achieved and, at the same time, the decoding complexity is significantly reduced.

Yuhao Chi - One of the best experts on this subject based on the ideXlab platform.

  • Super-Sparse On-Off Division Multiple Access: Replacing Repetition With Idling
    IEEE Transactions on Communications, 2020
    Co-Authors: Guanghui Song, Kui Cai, Yuhao Chi, Jie Guo, Jun Cheng
    Abstract:

    A very low-complexity on-off division multiple access (ODMA) scheme is proposed for $K$ -user non-orthogonal multiple access (NOMA) systems. At the transmission side, each user employs the same length- $m$ channel Code whose Coded bits, after modulation, are sent in a random time-hopping manner. Specifically, $m$ Coded bits are randomly scheduled and sent using $n$ time slots with $n\gg m$ , i.e., only $m$ slots are used for signal transmission and the other $n-m$ slots are idle. The slot selection, referred to as an on-off pattern, is unique to each user, and it is the only means of user separation. Consequently, at each time slot only a very few users (i.e., 2 or 3) may simultaneously access the channel, leading to a super-sparse access system. Due to the sparse access property, a very low-complexity iterative multi-user decoding method can be implemented on an almost tree-like factor graph. Compared with existing Iteratively Decodable Code division multiple access (CDMA) schemes, such as sparse-CDMA and interleave division multiple access (IDMA), ODMA does not rely on repetition (spreading) or user interleaving. In fact, we show that in using extrinsic information transfer (EXIT) analysis and simulation, idling is more effective than repetition in terms of enhancing the multi-user iterative decoding performance. By replacing repetition with idling, a remarkable multi-user decoding performance gain is achieved and, at the same time, the decoding complexity is significantly reduced.

Jie Guo - One of the best experts on this subject based on the ideXlab platform.

  • Super-Sparse On-Off Division Multiple Access: Replacing Repetition With Idling
    IEEE Transactions on Communications, 2020
    Co-Authors: Guanghui Song, Kui Cai, Yuhao Chi, Jie Guo, Jun Cheng
    Abstract:

    A very low-complexity on-off division multiple access (ODMA) scheme is proposed for $K$ -user non-orthogonal multiple access (NOMA) systems. At the transmission side, each user employs the same length- $m$ channel Code whose Coded bits, after modulation, are sent in a random time-hopping manner. Specifically, $m$ Coded bits are randomly scheduled and sent using $n$ time slots with $n\gg m$ , i.e., only $m$ slots are used for signal transmission and the other $n-m$ slots are idle. The slot selection, referred to as an on-off pattern, is unique to each user, and it is the only means of user separation. Consequently, at each time slot only a very few users (i.e., 2 or 3) may simultaneously access the channel, leading to a super-sparse access system. Due to the sparse access property, a very low-complexity iterative multi-user decoding method can be implemented on an almost tree-like factor graph. Compared with existing Iteratively Decodable Code division multiple access (CDMA) schemes, such as sparse-CDMA and interleave division multiple access (IDMA), ODMA does not rely on repetition (spreading) or user interleaving. In fact, we show that in using extrinsic information transfer (EXIT) analysis and simulation, idling is more effective than repetition in terms of enhancing the multi-user iterative decoding performance. By replacing repetition with idling, a remarkable multi-user decoding performance gain is achieved and, at the same time, the decoding complexity is significantly reduced.