Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 3,165 papers for “Puncturing”

Puncturing And

S. X. Ng, T. H. Liew, L-l. Yang et al. · 2016

Turbo codes using short binary BCH codes as com-ponent codes are investigated. The bit error rate (BER) performance of the turbo codes is evaluated using binary phase shift keying (BPSK) over addi-tive white Gaussian noise (AWGN) channels. The effects of various concatenated component codes, interleaver size, minimum free-distances, weight-dis-tributions as well as puncturing schemes are inves-tigated using both union-bounding and simulations. Output Bi& 1.

Cited by 0

Puncturing the Myth

Geoffrey Burnstock · UCL Discovery (University College London) · 2011

Cited by 0

Fearlessly Puncturing the Progressive Worldview

Stephen Kershnar · Academic Questions · 2025

Philosopher Stephen Kershnar reviews Progressive Myths, by Michael Huemer, “a fun and powerful read” in which Huemer inspects a plenitude of factual claims made by progressives that “are demonstrably false or highly misleading.”

Cited by 0

Puncturing maximum rank distance codes

Bence Csajbók, Alessandro Siciliano · CINECA IRIS Institutional Research Information System (University of Basilicata) · 2019

We investigate punctured maximum rank distance codes in cyclic models for bilinear forms of finite vector spaces. In each of these models, we consider an infinite family of linear maximum rank distance codes obtained by puncturing generalized twisted Gabidulin codes. We calculate the automorphism group of such codes, and we prove that this family contains many codes which are not equivalent to any generalized Gabidulin code. This solves a problem posed recently by Sheekey (Adv Math Commun 10:475–488, 2016).

Cited by 13Open access

Minimality for puncturing convolutional codes

Fragouli, C., Komninakis, C., Wesel, R.D. · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · 2001

This paper investigates encoders optimization for the Hamming weight after periodic puncturing, and discusses minimality issues that may affect the performance of the punctured encoders. Periodically puncturing a minimal encoder produces a higher rate encoder that may or may not be minimal. If it is not minimal, it may have a zero-output loop and it may be catastrophic. A code search can use a fast algorithm to determine whether an encoder's state diagram has a zero-output loop under periodic symbol puncturing, and a proposed method to assess the performance of codes with a zero-output loop that are not catastrophic. As an example, the paper optimizes rate-1/4 unpunctured codes for Hamming weight under both bit-wise and symbol-wise periodic puncturing. Code tables and simulation results are included.

Cited by 0

MULTIPLE CONFIGURATIONS FOR PUNCTURING ROBOT POSITIONING

Abdelaziz, Omar, Minzhou Luo, Guanwu Jiang et al. · Zenodo (CERN European Organization for Nuclear Research) · 2019

The paper presents the Inverse Kinematics (IK) close form derivation steps using combination of analytical and geometric techniques for the UR robot. The innovative application of this work is used in the precise positioning of puncture robotics system. The end effector is a puncture needle guide tube, which needs precise positioning over the puncture insertion point. The IK closed form solutions bring out maximum 8 solutions represents 8 different robot joints configurations. These multiple solutions are helpful in the puncture robotics system, it allow doctors to choose the most suitable configuration during the operation. Therefore the workspace becomes more adequate for the coexistence of human and robot. Moreover IK closed form solutions are more precise in positioning for medical puncture surgery compared to other numerical methods. We include a performance evaluation for both of the IK obtained by the closed form solution and by a numerical method.

Cited by 0Open access