The search functionality is under construction.

Keyword Search Result

[Keyword] punctured convolutional code(8hit)

1-8hit
  • Hybrid ARQ Error-Controlling Scheme for Robust and Efficient Transmission of UWB Body Area Networks

    Haruka SUZUKI  Marco HERNANDEZ  Ryuji KOHNO  

     
    PAPER

      Vol:
    E93-B No:4
      Page(s):
    826-832

    This paper presents hybrid type-II automatic repeat request (H-ARQ) for wireless wearable body area networks (BANs) based on ultra wideband (UWB) technology. The proposed model is based on three schemes, namely, high rate optimized rate compatible punctured convolutional codes (HRO-RCPC), Reed Solomon (RS) invertible codes and their concatenation. Forward error correction (FEC) coding is combined with simple cyclic redundancy check (CRC) error detection. The performance is investigated for two channels: CM3 (on-body to on-body) and CM4 (on-body to a gateway) scenarios of the IEEE802.15.6 BAN channel models for BANs. It is shown that the improvement in performance in terms of throughput and error protection robustness is very significant. Thus, the proposed H-ARQ schemes can be employed and optimized to suit medical and non-medical applications. In particular we propose the use of FEC coding for non-medical applications as those require less stringent quality of service (QoS), while the incremental redundancy and ARQ configuration is utilized only for medical applications. Thus, higher QoS is guaranteed for medical application of BANs while allowing coexistence with non-medical applications.

  • Rate-Compatible Punctured Bit-Interleaved Coded Modulation for Mobile Satellite Communications

    Tadashi MINOWA  

     
    PAPER

      Vol:
    E87-B No:8
      Page(s):
    2082-2089

    Fading in mobile satellite communications severely degrades the performance of data transmission. It is commonly modeled with non-frequency selective Rayleigh fading. For this type of channel, a new structure for a bit-interleaved coded modulation (BICM) scheme is presented and evaluated to determine its effectiveness compared to previously proposed schemes. This scheme is referred to as rate-compatible punctured BICM (RCP-BICM), in that its BICM encoder is able to yield a wide range of data rates by using a punctured convolutional code obtained by periodically perforating parity bits from the output of a low-rate-1/2 systematic convolutional code. A trellis-coded modulation (TCM) scheme and a turbo TCM (TTCM) scheme are discussed and evaluated for comparison with the RCP-BICM scheme. Simulation results demonstrate that the RCP-BICM scheme with hard-decision iterative decoding is superior to the TCM scheme by 3 dB at a bit error rate (BER) of 10-5 over an Rayleigh fading channel, and comes at a BER of 10-5 within 1 dB of the TCM scheme over an additive white Gaussian noise (AWGN) channel.

  • Fault-Tolerance Design for Multicast Using Convolutional-Code-Based FEC and Its Analytical Evaluation

    Anna YAMAGUCHI  Masayuki ARAI  Hitoshi KUROSU  Satoshi FUKUMOTO  Kazuhiko IWASAKI  

     
    PAPER-Fault Tolerance

      Vol:
    E85-D No:5
      Page(s):
    864-873

    In this paper, we propose and analytically evaluate the use of punctured convolutional codes for recovering packets lost in multicast transmission. An independent erasure channel is assumed for packets transmission over a star topology. The analysis provides a method for determining the recoverability and the post-reconstruction receiving rate for a given convolutional code. We theoretically evaluate the effectiveness of the proposed approach taking into account two different parameters: the number of transmissions per packet and the number of packets needed to be sent to guarantee the reception of data. Finally, we compare the proposed approach with the scheme when parity packets are generated based on Reed-Solomon codes.

  • Structure Properties of Punctured Convolutional Codes and Their Applications

    Zhenqiang SUN  Shigetomo KIMURA  Yoshihiko EBIHARA  

     
    PAPER-Communication Theory

      Vol:
    E82-B No:9
      Page(s):
    1432-1438

    This paper presents the generator polynomial matrices and the upper bound on the constraint length of punctured convolutional codes (PCCs), respectively. By virtue of these properties, we provide the puncturing realizations of the good known nonsystematic and systematic high rate CCs.

  • Performance Analysis of ADSL with Punctured Convolutional Code

    Weizu YANG  Tomoaki OHTSUKI  Masami UEDA  Kazuya MATSUMOTO  Iwao SASASE  

     
    PAPER-Communication Theory

      Vol:
    E82-B No:7
      Page(s):
    1030-1037

    We propose using punctured convolutional code for a Discrete Multitone (DMT) Asymmetric Digital Subscriber Line (ADSL) system to improve the data rate performance of ADSL. The theoretical performance of the systems with single coding rate for all subchannels, and with adaptive coding rate for each subchannel are presented respectively. It is found that the data rate performance of the proposed system is higher than the uncoded system.

  • SNR Evaluation of Punctured Convolutional Coded PR4ML System in Digital Magnetic Recording with Partial Erasure Effect

    Yoshihiro OKAMOTO  Minoru SOUMA  Shin TOMIMOTO  Hidetoshi SAITO  Hisashi OSAWA  

     
    PAPER

      Vol:
    E80-C No:9
      Page(s):
    1154-1160

    A punctured convolutional coded PR4ML system for digital magnetic recording, which applies a punctured coding method to the convolutional code and records the punctured code sequences on two tracks, is proposed. In this study, the bit error rate performance of the proposed system is obtained by computer simulation taking account of partial erasure, which is one of the nonlinear distortions at high densities, and it is compared with those of a conventional 8/9 coded PR4ML system and an I-NRZI coded PR4ML system. The results show that the proposed system is hardly affected by partial erasure and exhibits good performance in high-density recording. A bit error rate of 10-4 can be achieved with SNR's of approximately 13.2 dB and 9.1 dB less than those of the conventional 8/9 coded and I-NRZI coded PR4ML systems, respectively, at a normalized linear density of 3.

  • Adaptive Modulation System with Punctured Convolutional Code for High Quality Personal Communication Systems

    Hidehiro MATSUOKA  Seiichi SAMPEI  Norihiko MORINAGA  Yukiyoshi KAMIO  

     
    PAPER-Modulation, Demodulation

      Vol:
    E79-B No:3
      Page(s):
    328-334

    This paper proposes an adaptive modulation system with a punctured convolutional code for land mobile communications to achieve high quality, high bit rate, and high spectral efficient data transmission in multipath fading environments. The proposed system adaptively controls the coding rate of the punctured convolutional code, symbol rate, and modulation level according to the instantaneous fading channel conditions. During good channel conditions, the modulation parameters are selected to increase the transmission rate as much as possible with satisfying a certain transmission quality. As channel conditions become worse, lower rate modulation parameters are applied or transmission is stopped. The performances in fading environments are evaluated theoretically and by computer simulations. The results show that the proposed system can realize higher quality transmission without the degradation in average bit rate compared to conventional adaptive modulation systems.

  • Coding for Multi-Pulse PPM with Imperfect Slot Synchronization in Optical Direct-Detection Channels

    Kazumi SATO  Tomoaki OHTSUKI  Iwao SASASE  

     
    PAPER-Optical Communication

      Vol:
    E78-B No:6
      Page(s):
    916-922

    The performance of coded multi-pulse pulse position modulation (MPPM) consisting of m slots and 2 pulses, denoted as (m, 2) MPPM, with imperfect slot synchronization is analyzed. Convolutional codes and Reed-Solomon (RS) codes are employed for (m, 2) MPPM, and the bit error probability of coded (m, 2) MPPM in the presence of the timing offset is derived. In each coded (m, 2) MPPM, we compare the performance of some different code rate systems. Moreover, we compare the performance of both systems at the same information bit rate. It is shown that in both coded systems, the performance of code rate-1/2 coded (m, 2) MPPM is the best when the timing offset is small. Wheji the timing offset is somewhat large, however, uncoded (m, 2) MPPM is shown to perform better than coded (m, 2) MPPM. Further, convolutional coded (m, 2) MPPM with the constraint length k7 is shown to perform better than RS coded (m, 2) MPPM for the same code rate.