Topic
Puncturing
About: Puncturing is a research topic. Over the lifetime, 2588 publications have been published within this topic receiving 29411 citations.
Papers published on a yearly basis
1 / 2
Papers
TL;DR: In this article, the concept of punctured convolutional codes is extended by punctuating a low-rate 1/N code periodically with period P to obtain a family of codes with rate P/(P+l), where l can be varied between 1 and (N-1)P. This allows transmission of incremental redundancy in ARQ/FEC (automatic repeat request/forward error correction) schemes and continuous rate variation to change from low to high error protection within a data frame.
Abstract: The concept of punctured convolutional codes is extended by punctuating a low-rate 1/N code periodically with period P to obtain a family of codes with rate P/(P+l), where l can be varied between 1 and (N-1)P. A rate-compatibility restriction on the puncturing tables ensures that all code bits of high rate codes are used by the lower-rate codes. This allows transmission of incremental redundancy in ARQ/FEC (automatic repeat request/forward error correction) schemes and continuous rate variation to change from low to high error protection within a data frame. Families of RCPC codes with rates between 8/9 and 1/4 are given for memories M from 3 to 6 (8 to 64 trellis states) together with the relevant distance spectra. These codes are almost as good as the best known general convolutional codes of the respective rates. It is shown that the same Viterbi decoder can be used for all RCPC codes of the same M. the application of RCPC codes to hybrid ARQ/FEC schemes is discussed for Gaussian and Rayleigh fading channels using channel-state information to optimise throughput. >
2,000 citations
Patent•
28 Oct 1992TL;DR: In this paper, a non-sterile device for blood vessel puncturing with an ultrasound probe capable of nonsterile use is described. But the ultrasound probe can be used repeatedly and is introduced into the device shortly before puncturing.
Abstract: A sterile puncturing device for blood vessels is disclosed which has an ultrasound probe (1) capable of non-sterile use. The probe (1) can be introduced into a capsule (12, 13) in the puncturing device. The apparatus has a fluid-tight bag (16) with sterile contents (10), the bag containing a holder (11) with the capsule for the ultrasound probe, and an entrance lock in the bag wall communicates with the opened capsule. The apparatus is disposable. The ultrasound probe, which can be used repeatedly, is introduced into the device shortly before puncturing.
592 citations
TL;DR: It is shown that good puncturing patterns exist and that the puncturing can be performed in a rate-compatible fashion, which allows one to implement a single "mother" encoder and decoder that is good across a wide range of rates.
Abstract: In this correspondence, we consider puncturing of low-density parity-check (LDPC) codes for additive white Gaussian noise (AWGN) channels. We show that good puncturing patterns exist and that the puncturing can be performed in a rate-compatible fashion. Furthermore, rate-compatible puncturing results in a small loss of performance with respect to threshold, namely, the punctured code is good (in terms of threshold) across a range of rates when compared with the optimal codes for each rate. This allows one to implement a single "mother" encoder and decoder that is good across a wide range of rates.
406 citations
Patent•
23 Jan 2002TL;DR: In this paper, a base code is used in combination with common or variable puncturing to achieve different coding rates required by the transmission channels, and unpunctured coded bits are grouped into non-binary symbols and mapped to modulation symbols (e.g., using Gray mapping).
Abstract: Coding techniques for a (e.g., OFDM) communication system capable of transmitting data on a number of “transmission channels” at different information bit rates based on the channels' achieved SNR. A base code is used in combination with common or variable puncturing to achieve different coding rates required by the transmission channels. The data (i.e., information bits) for a data transmission is encoded with the base code, and the coded bits for each channel (or group of channels with the similar transmission capabilities) are punctured to achieve the required coding rate. The coded bits may be interleaved (e.g., to combat fading and remove correlation between coded bits in each modulation symbol) prior to puncturing. The unpunctured coded bits are grouped into non-binary symbols and mapped to modulation symbols (e.g., using Gray mapping). The modulation symbol may be “pre-conditioned” and prior to transmission.
323 citations
9 Jun 2013
TL;DR: A simple quasi-uniform puncturing algorithm to generate the puncturing table is proposed and it is proved that this method has better row-weight property than that of the random puncturing.
Abstract: CRC (cyclic redundancy check) concatenated polar codes are superior to the turbo codes under the successive cancellation list (SCL) or successive cancellation stack (SCS) decoding algorithms. But the code length of polar codes is limited to the power of two. In this paper, a family of rate-compatible punctured polar (RCPP) codes is proposed to satisfy the construction with arbitrary code length. We propose a simple quasi-uniform puncturing algorithm to generate the puncturing table. And we prove that this method has better row-weight property than that of the random puncturing. Simulation results under the binary input additive white Gaussian noise channels (BI-AWGNs) show that these RCPP codes outperform the performance of turbo codes in WCDMA (Wideband Code Division Multiple Access) or LTE (Long Term Evolution) wireless communication systems in the large range of code lengths. Especially, the RCPP code with CRC-aided SCL/SCS algorithm can provide over 0.7dB performance gain at the block error rate (BLER) of 10-4 with short code length M = 512 and code rate R = 0.5.
249 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2026 | 1 |
| 2025 | 11 |
| 2024 | 30 |
| 2023 | 30 |
| 2022 | 56 |
| 2021 | 45 |