The following pages link to (Q4041050):
Displaying 15 items.
- Computational complexity of bilinear forms. Algebraic coding theory and applications to digital communication systems (Q579215) (← links)
- Multiplicative complexity of bilinear algorithms for cyclic convolution over finite fields (Q751615) (← links)
- The AICE-CRT and digital signal processing algorithms: The complex case (Q1345182) (← links)
- Analysis of the Chinese remainder theorem and cyclotomic polynomials-based algorithms for cyclic convolution. I: Rational number system (Q1382940) (← links)
- Analysis of the Chinese remainder theorem and cyclotomic polynomials-based algorithms for cyclic convolution. II: Complex rational number system (Q1382941) (← links)
- Communication, signal processing and information technology. Extended papers (Q1704155) (← links)
- On a signal processing algorithms based class of linear codes (Q1803557) (← links)
- On algorithms for digital signal processing of sequences (Q1922614) (← links)
- On computational aspects of certain optimal digital signal processing algorithms (Q2738612) (← links)
- (Q3184632) (← links)
- (Q3692857) (← links)
- (Q3827926) (← links)
- (Q3988861) (← links)
- Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for DCTs and DSTs (Q4568614) (← links)
- Coding and Signal Processing for Magnetic Recording Systems (Q5462930) (← links)