Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Convolution Properties I01:20

Convolution Properties I

276
Convolution computations can be simplified by utilizing their inherent properties.
The commutative property reveals that the input and the impulse response of an LTI (Linear Time-Invariant) system can be interchanged without affecting the output:
276
Convolution: Math, Graphics, and Discrete Signals01:24

Convolution: Math, Graphics, and Discrete Signals

487
In any LTI (Linear Time-Invariant) system, the convolution of two signals is denoted using a convolution operator, assuming all initial conditions are zero. The convolution integral can be divided into two parts: the zero-input or natural response and the zero-state or forced response, with t0 indicating the initial time.
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
487
Convolution Properties II01:17

Convolution Properties II

317
The important convolution properties include width, area, differentiation, and integration properties.
The width property indicates that if the durations of input signals are T1 and T2, then the width of the output response equals the sum of both durations, irrespective of the shapes of the two functions. For instance, convolving two rectangular pulses with durations of 2 seconds and 1 second results in a function with a width of 3 seconds.
The area property asserts that the area under the...
317
Deconvolution01:20

Deconvolution

295
Deconvolution, also known as inverse filtering, is the process of extracting the impulse response from known input and output signals. This technique is vital in scenarios where the system's characteristics are unknown, and they must be inferred from the observable signals.
Deconvolution involves several mathematical techniques to derive the impulse response. One common approach is polynomial division. In this method, the input and output sequences are treated as coefficients of...
295
Properties of DTFT II01:24

Properties of DTFT II

293
In the study of discrete-time signal processing, understanding the properties of the Discrete-Time Fourier Transform (DTFT) is crucial for analyzing and manipulating signals in the frequency domain. Several properties, including frequency differentiation, convolution, accumulation, and Parseval's relation, offer powerful tools for signal analysis.
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω.
293
Construction of Root Locus01:15

Construction of Root Locus

197
The construction of a root locus involves several key steps to analyze and visualize the behavior of a system's poles with varying gain. The number of branches in the root locus equals the number of closed-loop poles and is symmetrical about the real axis.
For positive gain values, the root locus exists on the real axis to the left of an odd number of finite open-loop poles or zeros. The root locus starts at the open-loop poles and traces the paths of the closed-loop poles as the gain...
197

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Cryptanalysis of some nonabelian group-based key exchange protocols.

Journal of mathematical cryptology·2026
Same authorSame journal

Information-set decoding for convolutional codes.

Designs, codes, and cryptography·2025
Same author

Bounds for Coding Theory over Rings.

Entropy (Basel, Switzerland)·2023
Same author

Moderate-density parity-check codes from projective bundles.

Designs, codes, and cryptography·2022
Same author

Erasure decoding of convolutional codes using first-order representations.

Mathematics of control, signals, and systems : MCSS·2021
Same journal

LRCS: Duality, LP bounds, and field size.

Designs, codes, and cryptography·2026
Same journal

Knot theory and error-correcting codes.

Designs, codes, and cryptography·2025
Same journal

New results on non-disjoint and classical strong external difference families.

Designs, codes, and cryptography·2025
Same journal

Guessing less and better: improved attacks on GIFT-64.

Designs, codes, and cryptography·2025
Same journal

Conjunctive hierarchical secret sharing by finite geometry.

Designs, codes, and cryptography·2025
See all related articles

Related Experiment Video

Updated: Oct 13, 2025

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

5.3K

Construction of LDPC convolutional codes via difference triangle sets.

Gianira N Alfarano1, Julia Lieb1, Joachim Rosenthal1

  • 1Institute of Mathematics, University of Zurich, Winterthurerstrasse 190, 8057 Zurich, Switzerland.

Designs, Codes, and Cryptography
|November 15, 2021
PubMed
Summary
This summary is machine-generated.

This study introduces a new construction for LDPC convolutional codes over finite fields using difference triangle sets. This method helps avoid cycles in Tanner graphs, improving code performance and preventing low-weight codewords.

Keywords:
Convolutional codesDifference triangle setsLDPC codes

More Related Videos

Generation and Coherent Control of Pulsed Quantum Frequency Combs
06:42

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Published on: June 8, 2018

9.2K
A Photonic System for Generating Unconditional Polarization-Entangled Photons Based on Multiple Quantum Interference
07:56

A Photonic System for Generating Unconditional Polarization-Entangled Photons Based on Multiple Quantum Interference

Published on: September 5, 2019

8.7K

Related Experiment Videos

Last Updated: Oct 13, 2025

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

5.3K
Generation and Coherent Control of Pulsed Quantum Frequency Combs
06:42

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Published on: June 8, 2018

9.2K
A Photonic System for Generating Unconditional Polarization-Entangled Photons Based on Multiple Quantum Interference
07:56

A Photonic System for Generating Unconditional Polarization-Entangled Photons Based on Multiple Quantum Interference

Published on: September 5, 2019

8.7K

Area of Science:

  • Coding Theory
  • Algebraic Coding
  • Finite Field Applications

Background:

  • Low-Density Parity-Check (LDPC) convolutional codes offer efficient error correction.
  • Existing constructions have limitations in arbitrary finite fields.
  • Difference triangle sets provide a structured approach to code design.

Purpose of the Study:

  • To generalize existing constructions of LDPC convolutional codes.
  • To utilize (k, w)-weak difference triangle sets for code construction.
  • To analyze code parameters and Tanner graph properties.

Main Methods:

  • Constructing LDPC convolutional codes using difference triangle sets as column supports.
  • Relating code parameters (free distance, degree) to difference triangle set parameters (w, scope).
  • Analyzing Tanner graphs for cycle-free properties over finite fields.

Main Results:

  • Established relationships between code free distance and 'w', and code degree and difference triangle set scope.
  • Identified conditions on difference triangle sets to avoid specific cycles in Tanner graphs.
  • Determined lower bounds on field size to prevent cycles, enhancing code performance.

Conclusions:

  • The proposed construction generalizes existing work on LDPC convolutional codes.
  • The use of difference triangle sets provides a systematic way to design codes with desirable properties.
  • Avoiding cycles in Tanner graphs is crucial for mitigating low-weight codewords and absorbing sets, leading to better error correction performance.