Punctured code
In coding theory, puncturing is the process of removing some of the parity bits after encoding with an error-correction code. This has the same effect as encoding with an error-correction code with a higher rate, or less redundancy. However, with puncturing the same decoder can be used regardless of how many bits have been punctured, thus puncturing considerably increases the flexibility of the system without significantly increasing its complexity.
In some cases, a pre-defined pattern of puncturing is used in an encoder. Then, the inverse operation, known as depuncturing, is implemented by the decoder.
Puncturing is used in UMTS during the rate matching process. It is also used in Wi-Fi, Wi-SUN, GPRS, EDGE, DVB-T and DAB, as well as in the DRM Standards.
Puncturing is often used with the Viterbi algorithm in coding systems.
During Radio Resource Control (RRC) Connection set procedure, during sending NBAP radio link setup message the uplink puncturing limit will send to NODE B, along with U/L spreading factor & U/L scrambling code.[1]
Puncturing was introduced by Gustave Solomon and J. J. Stiffler in 1964.[2][3]
See also
[edit]- Singleton bound, an upper bound in coding theory
References
[edit]- ^ Chris Johnson. "Radio Access Networks for UMTS: Principles and Practice". 2011.
- ^ Solomom, G.; Stiffler, J. J. (1964). "Punctured Systematic Cyclic Codes". IEEE Convention Record. Vol. 12.
- ^ Solomon, G.; Stiffler, J.J. (April 1965). "Algebraically punctured cyclic codes". Information and Control. 8 (2): 170–79. doi:10.1016/S0019-9958(65)90080-X.
- Pless, Vera (2011). Introduction to the Theory of Error-Correcting Codes. Wiley Series in Discrete Mathematics and Optimization. Vol. 48 (Third ed.). John Wiley & Sons. ISBN 978-1118030998.
 | This article related to telecommunications is a stub. You can help Wikipedia by expanding it. |