Memoryless block transceivers with minimum redundancy based on Hartley transforms

This paper proposes real linear transceivers employing minimum redundancy, unlike the standard block transceivers that require, at least, L elements of redundancy, where L is the channel order. In all block-based systems, there is an inherent interblock interference (IBI) that can be eliminated by inserting redundancy. For transceivers based on the discrete Fourier transform (DFT), the redundancy induces a circulant channel matrix, allowing superfast implementations. Although it has been known for some time that the minimum redundancy for IBI-free designs of block transceivers is ⌈L/2⌉, only recently practical DFT-based solutions using minimum redundancy were proposed. However, the extension of these solutions to real transforms, such as the discrete Hartley transform (DHT), is not straightforward. The only known solution imposes a symmetry on the channel model that is unlikely to be met in practice. This paper proposes transceivers with practical zero-forcing (ZF) and minimum mean-squared error (MMSE) receivers using DHT, diagonal, and antidiagonal matrices. The resulting systems are asymptotically as simple as orthogonal frequency-division multiplex (OFDM) and single-carrier with frequency-domain (SC-FD) equalization transceivers. In addition, they do not enforce constraints on the channel model. Several computer simulations indicate the higher throughput of the proposals as compared to the standard solutions.     

基于离散Hartley变换的OFDM实现模型

本文研究离散Hartley变换在OFDM系统中的应用,提出一种基于离散Hartley变换的OFDM实现模型.分析了新模型在加性高斯白噪声信道下的传输性能和算法复杂度.新模型与基于离散傅立叶变换(DFT)的OFDM系统具有相同的传输性能,但计算复杂度降低,时效性提高,且调制与解调算法一致.     

基于DHT的光OFDM系统PAPR抑制算法

针对光OFDM系统存在高峰均功率比(PAPR),提出了一种基于离散哈特利变换(DHT)的选择映射抑制算法。采用快速哈特利逆变换(IFHT)代替传统的快速傅立叶逆变换(IFFT)和Hermi t i an对称算法,并结合非对称限幅法产生满足光OFDM系统要求的正、实值信号送入光纤信道。     

用哈特莱变换估计一类连续非线性系统的参数

针对一类具有已知结构且参数可分离的连续非线性定常系统,借助于哈特莱正、反变换及其微分性质,采用频域和时域相结合的方法,给出了一种简单实用的参数辨识方法。该方法不仅实现简单,而且对噪声有很强的抑制能力。     

Syntax and semantics of universal programming languages

This paper deals with certain characterizations of the sets of positive integers which when represented as strings on a finite alphabet, form tree adjunct languages, As the context free languages constitute a subfamily of tree adjunct languages, the results carry over to the former as well.     

基于算术傅里叶变换的离散Hartley变换的快速算法

离散Hartley变换是一种有用的实值正交变换。文中对其快速算法进行研究,首先介绍利用算术傅里叶变换（AFT）计算离散傅里叶变换（DFT）可使其乘法计算量仅为O（N）,然后文章根据这一特点,分析离散Hartley变换（DHT）的结构特征,通过DFT将AFT和DHT建立了直接联系,提出了一种新的快速DHT算法。算法的计算复杂度能够达到线性O（N）,且算法结构简单,公式统一且易于实现,并与其他快速算法进行了比较,分析可知在数据长度不是2的幂次方时,文中提出的算法的计算时间明显比其他算法的计算时间要小。实验结果也验证了文中算法的有效性,从而为DHT的快速计算开辟了新的思路和途径。     

An improved computation of the pseudo Wigner‐Ville distribution and its applications

Abstract

The Wigner‐Ville distribution (WVD), generally calculated by the fast Fourier transform (FFT), is a useful tool for time‐frequency signal analysis. However, for nonstationary multicomponent signals, the inherent bilinear structure of the WVD causes undesirable interfering cross terms, and becomes troublesome to many applications. The FFT requires complex arithmetic computations, but the fast Hartley transform (FHT) only requires real arithmetic computations. Therefore, the FHT performs much faster than the FFT. An improved WVD computation using the FHT and running windowed exponential distribution is proposed in this paper. The cross‐terms of nonstationary multicomponent signals can be completely eliminated, and the result is favorable for pattern recognition and signal classification. The derived algorithm is also applied to building up a real‐time processing scheme for conducting experiments in an anechoic chamber.     

基于DHT的OFDM接收机模型及性能分析

提出一种基于离散Hartley变换的OFDM接收机模型,分析了其工作原理和性能。理论分析与仿真结果表明,该模型与基于离散傅里叶变换的OFDM接收机在加性高斯白噪声信道下具有相同的接收性能。该模型采用并行处理模式,具有算法复杂度低、时效性高、易于DSP实现的特点。     

快速Hartley变换在实时相关器中的应用

快速Ｈａｒｔｌｅｙ变换（ＦＨＴ）是离散Ｈａｒｔｌｅｙ变换（ＤＨＴ）的快速算法,它是一种实序的变换,其正反变换具有完全相同的形式。利用ＦＨＴ进行实数据相关可以避免复数运算,特别适用于采和可编程数字信号处理器（ＤＳＰ）来实现的实时相关器。和ＦＦＴ相关算法相比,在保持同样数据吞吐率的情况下,采用ＦＨＴ方法,可显著减少系统所需的高速存贮器,从而,可降低系统的成本。本文讨论了ＤＨＴ的有关性质和ＦＨＴ算法和运     

一种任意窗函数的复数调制重叠变换的快速算法

该文提出了一种任意窗函数的复数调制重叠变换(MCLT)的快速计算方法。针对输入信号长度为2M 的MCLT,该算法将其转化为长度为2M的II型离散 Hartley 变换,然后对后者运用快速算法。与现有算法相比,该方法能够达到最少的算术运算量。