The search functionality is under construction.

Keyword Search Result

[Keyword] BICM-ID(5hit)

1-5hit
  • Bit Labeling and Code Searches for BICM-ID Using 16-DAPSK

    Chun-Lin LIN  Tzu-Hsiang LIN  Ruey-Yi WEI  

     
    PAPER-Fundamental Theories for Communications

      Pubricized:
    2018/05/31
      Vol:
    E101-B No:12
      Page(s):
    2380-2387

    Bit-interleaved coded modulation with iterative decoding (BICM-ID) is suitable for correlated Rayleigh fading channels. Additionally, BICM-ID using differential encoding can avoid the pilot overhead. In this paper, we consider BICM-ID using 16-DAPSK (differential amplitude and phase-shift keying). We first derive the probability of receiving signals conditioned on the transmission of input bits for general differential encoding; then we propose two new 16-DAPSK bit labeling methods. In addition, convolutional codes for the new bit labeling are developed. Both the minimum distance and the simulation results show that the proposed labeling has better error performance than that of the original differential encoding, and the searched new codes can further improve the error performance.

  • BICM-ID-Based IDMA: Convergence and Rate Region Analyses

    Kun WU  Khoirul ANWAR  Tad MATSUMOTO  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E97-B No:7
      Page(s):
    1483-1492

    This paper considers uplink interleave division multiple access (IDMA), of which crucial requirement is the proper operability at a very low signal-to-interference-plus-noise power ratio (SINR) range. The primary objectives of this paper are threefold: (1) to demonstrate the achievability of near-capacity performance of bit interleaved coded modulation with iterative detection (BICM-ID) using very low rate single parity check and irregular repetition (SPC-IrR) codes at a very low SINR range, and hence the technique is effective in achieving excellent performance when it is applied for IDMA, (2) to propose a very simple multiuser detection (MUD) technique for the SPC-IrR BICM-ID IDMA which does not incur heavy per-iteration computational burden, and (3) to analyze the impacts of power allocation on the convergence property of MUD as well as on the rate region, by using the extrinsic information transfer (EXIT) chart. The SPC-IrR code parameters are optimized by using the EXIT-constrained binary switching algorithm (EBSA) at a very low SINR range. Simulation results show that the proposed technique can achieve excellent near-capacity performance with the bit error rate (BER) curves exhibiting very sharp threshold, which significantly influences the convergence property of MUD. Furthermore, this paper presents results of the rate region analysis of multiple access channel (MAC) in the cases of equal and unequal power allocation, as well as of a counterpart technique. The results of the MAC rate region analysis show that our proposed technique outperforms the counterpart technique.

  • Simple Relay Systems with BICM-ID Allowing Intra-Link Errors

    Meng CHENG  Xiaobo ZHOU  Khoirul ANWAR  Tad MATSUMOTO  

     
    PAPER

      Vol:
    E95-B No:12
      Page(s):
    3671-3678

    In this work, a simple doped accumulator (DACC)-assisted relay system is proposed by using bit-interleaved coded modulation with iterative decoding (BICM-ID). An extrinsic information transfer (EXIT) chart analysis shows that DACC keeps the convergence tunnel of the EXIT curves open until almost the (1, 1) point of the mutual information, which avoids the error floor. In the relay system, errors may happen in the source-relay link (intra-link), however, they are allowed in our proposed technique where the correlation knowledge between the source and the relay is exploited at the destination node. Strong codes are not needed and even the systematic source bits can be simply extracted at the relay even though the systematic part may contain some errors. Hence, the complexity of the relay can be significantly reduced, and thereby the proposed system is energy-efficient. Furthermore, the error probability of the intra-link can be estimated at the receiver by utilizing the a posteriori log-likelihood ratios (LLRs) of the two decoders, and it can be further utilized in the iterative processing. Additionally, we provide the analysis of different relay location scenarios and compare the system performances by changing the relay's location. The transmission channels in this paper are assumed to suffer from additive white Gaussian noise (AWGN) and block Rayleigh fading. The theoretical background of this technique is the Slepian-Wolf/Shannon theorem for correlated source coding. The simulation results show that the bit-error-rate (BER) performances of the proposed system are very close to theoretical limits supported by the Slepian-Wolf/Shannon theorem.

  • A Novel BICM-ID System Approaching Shannon-Limit at High Spectrum Efficiency

    Zhixing YANG  Qiuliang XIE  Kewu PENG  Zhaocheng WANG  

     
    LETTER-Fundamental Theories for Communications

      Vol:
    E94-B No:3
      Page(s):
    793-795

    A method to construct bit-interleaved coded modulation with iterative demapping and decoding (BICM-ID) is developed that approaches the Shannon limit very closely at high spectrum efficiency, where amplitude-phase shift keying (APSK) constellations are designed and chosen. For 1/2-rate 64APSK, the Es/N0 threshold derived through extrinsic information transfer (EXIT) charts is less than 0.55 dB away from the Shannon limit of the continuous-input additive white Gaussian noise (AWGN) channel, and exceeds the theoretical limit constrained by standard 64QAM-input.

  • BICM-ID with 3-Dimensional BPSK and Signal Space Diversity over Rayleigh Channel

    Qiuliang XIE  Kewu PENG  Fang YANG  Zhaocheng WANG  Zhixing YANG  

     
    LETTER-Fundamental Theories for Communications

      Vol:
    E94-B No:1
      Page(s):
    282-284

    A BICM-ID system with 3-dimensional rotated BPSK constellation and signal space diversity (SSD) is proposed to combat the effect of Rayleigh fading. A new criterion based on mutual information is proposed to find the optimal rotation matrix, and the labeling that fits well with the outer code is presented. Simulation results show that at BER of 10-5 over a Rayleigh fading channel, with the code length of 192,000 bits and the iteration number of 100, the performance of the proposed system is only about 0.8 dB from the Gaussian-input Shannon limit and exceeds the limit constrained by the traditional QPSK input without rotation or SSD, at the spectrum efficiency of 1 bit/s/Hz.