Memoryless block transceivers with minimum redundancy based on Hartley transforms

DOI10.1016/j.sigpro.2010.06.026zbMath1203.94042OpenAlexW1984376002MaRDI QIDQ612584

Wallace A. Martins, Paulo S. R. Diniz

Publication date: 29 December 2010

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sigpro.2010.06.026

zbMATH Keywords

displacementblock-based transceiversequalizationHartley transformsminimum redundancysuperfast algorithms

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (1)

Generalized orthogonal discrete W transform and its fast algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• DFT representations of Toeplitz-plus-Hankel Bézoutians with application to fast matrix-vector multiplication
• Structured matrices and Newton's iteration: unified approach
• Hartley Transform Representations of Symmetric Toeplitz Matrix Inverses with Application to Fast Matrix-Vector Multiplication
• Displacement ranks of a matrix
• More on Electrostatic Models for Zeros of Orthagonal Polynomials
• Block-Based Transceivers With Minimum Redundancy
• Time-Varying FIR Transmultiplexers With Minimum Redundancy
• Displacement Structure: Theory and Applications
• Jointly Minimum BER Transmitter and Receiver FIR MIMO Filters for Binary Signal Vectors

This page was built for publication: Memoryless block transceivers with minimum redundancy based on Hartley transforms