全文获取类型
收费全文 | 66篇 |
免费 | 4篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 4篇 |
综合类 | 5篇 |
化学工业 | 1篇 |
机械仪表 | 1篇 |
石油天然气 | 13篇 |
武器工业 | 2篇 |
无线电 | 24篇 |
一般工业技术 | 2篇 |
冶金工业 | 1篇 |
自动化技术 | 19篇 |
出版年
2022年 | 1篇 |
2019年 | 1篇 |
2018年 | 3篇 |
2017年 | 1篇 |
2016年 | 2篇 |
2015年 | 2篇 |
2014年 | 2篇 |
2013年 | 3篇 |
2012年 | 7篇 |
2011年 | 5篇 |
2010年 | 2篇 |
2009年 | 1篇 |
2008年 | 2篇 |
2007年 | 2篇 |
2006年 | 1篇 |
2005年 | 2篇 |
2004年 | 2篇 |
2003年 | 3篇 |
2002年 | 5篇 |
2001年 | 1篇 |
2000年 | 2篇 |
1998年 | 1篇 |
1996年 | 2篇 |
1995年 | 1篇 |
1994年 | 8篇 |
1993年 | 4篇 |
1992年 | 1篇 |
1991年 | 3篇 |
1990年 | 2篇 |
排序方式: 共有72条查询结果,搜索用时 15 毫秒
1.
快速Hartley变换(FHT)是离散Hartley变换(DHT)的快速算法,它是一种实序的变换,其正反变换具有完全相同的形式。利用FHT进行实数据相关可以避免复数运算,特别适用于采和可编程数字信号处理器(DSP)来实现的实时相关器。和FFT相关算法相比,在保持同样数据吞吐率的情况下,采用FHT方法,可显著减少系统所需的高速存贮器,从而,可降低系统的成本。本文讨论了DHT的有关性质和FHT算法和运 相似文献
2.
离散Hartley变换是一种有用的实值正交变换。文中对其快速算法进行研究,首先介绍利用算术傅里叶变换(AFT)计算离散傅里叶变换(DFT)可使其乘法计算量仅为O(N),然后文章根据这一特点,分析离散Hartley变换(DHT)的结构特征,通过DFT将AFT和DHT建立了直接联系,提出了一种新的快速DHT算法。算法的计算复杂度能够达到线性O(N),且算法结构简单,公式统一且易于实现,并与其他快速算法进行了比较,分析可知在数据长度不是2的幂次方时,文中提出的算法的计算时间明显比其他算法的计算时间要小。实验结果也验证了文中算法的有效性,从而为DHT的快速计算开辟了新的思路和途径。 相似文献
3.
4.
《国际计算机数学杂志》2012,89(2):87-103
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. 相似文献
5.
工业领域的磁悬浮分子泵用位移传感器除了要具有良好的静态特性外,还应具有高动态响应特性,同时其体积大小还影响着磁悬浮分子泵的抽速、真空度和压缩比。针对高真空磁悬浮分子泵,提出了一种基于Hartley原理的电涡流位移传感器设计方法,将传感器对称探头接入同一振荡电路作为工作电感。对传感器的动态特性进行了分析,并提出了对其动态响应特性在不影响灵敏度和线性度等静态性能的情况下进行补偿的方法。实验结果表明,在-0.4~0.4mm内,传感器的线性度为±1.17%,灵敏度为9.901mV/μm,分辨率为0.25%,动态响应带宽达到了10.2kHz,两径向四路位移信号测量集成电路板体积仅为π×4~2 cm~2,大大减小了传感器体积,满足了磁悬浮分子泵面向更高抽速和更高真空度的发展需求。 相似文献
6.
7.
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. 相似文献
8.
9.
该文提出了一种任意窗函数的复数调制重叠变换(MCLT)的快速计算方法。针对输入信号长度为2M 的MCLT,该算法将其转化为长度为2M的II型离散 Hartley 变换,然后对后者运用快速算法。与现有算法相比,该方法能够达到最少的算术运算量。 相似文献
10.
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. 相似文献