全文获取类型
收费全文 | 178篇 |
免费 | 17篇 |
国内免费 | 6篇 |
专业分类
电工技术 | 7篇 |
综合类 | 24篇 |
化学工业 | 2篇 |
机械仪表 | 1篇 |
能源动力 | 1篇 |
轻工业 | 1篇 |
无线电 | 113篇 |
一般工业技术 | 9篇 |
自动化技术 | 43篇 |
出版年
2023年 | 1篇 |
2022年 | 1篇 |
2021年 | 3篇 |
2020年 | 3篇 |
2019年 | 3篇 |
2018年 | 1篇 |
2017年 | 6篇 |
2016年 | 5篇 |
2015年 | 13篇 |
2014年 | 8篇 |
2013年 | 8篇 |
2012年 | 16篇 |
2011年 | 12篇 |
2010年 | 15篇 |
2009年 | 9篇 |
2008年 | 9篇 |
2007年 | 12篇 |
2006年 | 6篇 |
2005年 | 6篇 |
2004年 | 8篇 |
2003年 | 5篇 |
2002年 | 6篇 |
2001年 | 10篇 |
2000年 | 3篇 |
1999年 | 3篇 |
1998年 | 4篇 |
1997年 | 8篇 |
1996年 | 8篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1983年 | 1篇 |
排序方式: 共有201条查询结果,搜索用时 15 毫秒
31.
Jagadeesh Kakarla Banshidhar Majhi Ramesh Battula 《International Journal of Communication Systems》2016,29(18):2604-2621
In this paper, a delay and energy aware coordination mechanism (DEACM) has been devised for wireless sensor–actor networks. In DEACM, a two‐level hierarchical K‐hop clustering mechanism is used to organize the sensors and actors for communication. In the first level, sensors form a K‐hop cluster using actors as cluster heads, and sink is made as the cluster head in the second level to form a cluster among actors. Sensor nodes, which are 1‐hop away from the actors, also called as relay nodes are elected as backup cluster head (BCH) based on the residual energy and node degree. BCH collects the data from sensors when an actor is away to perform actions in the affected area. The scheme is evaluated through exhaustive simulation in NS2 along with other existing schemes. Different parameters like average event waiting time, event reliability, and average energy dissipation are compared, varying the number of sensors, actors, and data transfer rate. In general, it is observed that the proposed DEACM outperforms other existing schemes. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
32.
33.
提出一种基于非对称水印的图像认证改进算法,算法中将经过BCH编码和混沌序列调制的认证信息作为水印,利用所有者私钥嵌入图像DCT域,嵌入过程根据DCT块的可视噪声阈值(JND)控制,用户可以利用公钥从水印图像中提取认证信息,但无法从公钥中获取任何私钥信息,从而无法破坏或删除水印.实验结果表明:改进算法中水印图像的PSNR值相比原算法增大4.4dB,并且对常见的基于图像处理的攻击,鲁棒性大大提高. 相似文献
34.
常规的水印算法在提取水印信息时可能出现误码,文中在采用混沌映射理论提高图像水印加密的安全性基础上,提出了一种基于BCH纠错编码的数字水印算法,通过小波系数的量化法,在小波变换域内实现图像水印的嵌入、提取和水印的恢复。并利用计算仿真进行实验,结果表明,该方法能降低水印提取的误码率,有效抵抗各种常见攻击,具有良好的鲁棒性和不可见性,可靠性和实用性也很强. 相似文献
35.
针对石油测井中可靠性的要求,本文提出了一种纠错编码的设计方案。该设计采用基于乘积码的编码方案,外码和内码采用的都是BCH码。并详细介绍了用FPGA实现该编码方案的方法,包括BCH码的编译码和交织编码。 相似文献
36.
蓝牙2.0+EDR规范新增DH分组没有有效的纠错机制,其抗干扰能力差。通过在新规范中加入BCH编码和交织编码,以改善蓝牙的数据传输吞吐量及抗干扰能力。对于新增的数据分组,根据蓝牙标准协议,推导了相应的分组特性;建立了GE信道下数据传输速率与信道突发错误水平的关系模型;获得了在不同信道突发错误水平下的数据传输吞吐量。结果表明,在蓝牙2.0+EDR新规范中加入BCH编码和交织编码,在较高突发错误水平的信道中,其数据传输吞吐量提高了一倍以上,明显改善了数据传输的抗干扰能力。 相似文献
37.
本文基于Maximum Distance Separable(MDS)码的Hamming重量分布提出一类新的二元Alternant子类码.分析表明这类新的子类码包含整个BCH码类,并且可以渐进达到Gilbert-Varshamov(GV)界. 相似文献
38.
Y. Kaipainen K. Suominen 《Applicable Algebra in Engineering, Communication and Computing》1997,8(5):403-410
We study S. D. Cohen’s method of estimating the covering radius of long primitive non-binary BCH codes with prime field alphabet.
As an application we show that the covering radius is at most 7 for long 5-ary BCH codes with minimum distance seven.
Received: November 13, 1996; revised version: March 11, 1997 相似文献
39.
H. Prashantha Kumar U. Sripati K. Rajesh Shetty 《International Journal of Electronics》2013,100(5):683-693
40.
Nikola Roi 《International Journal of Communication Systems》1999,12(1):23-47
Transmission of image/video messages over communication networks is becoming a standard way of communication due to very efficient compression algorithms that reduce required channel capacity to an acceptable level. However, all compression standard techniques are strongly sensitivitive to channel disturbances and their application is suitable only for practically noiseless channels. In standard noisy channels, the effect of errors on a compressed data bit stream can be divided into two categories: systematic errors defined by the structure of data blocks, and random errors caused by amplitude changes of transmitted components. A systematic error can be detected at the receiver through control of the data stream structure and corrected by error concealment methods or by automatic repeat request (ARQ) procedures. Random errors, noise and burst‐like errors, as well as impulse noise, should be controlled through channel coding. It is reasonable that an integrated source and channel coding methods should be preferred and should give better coding performance. In this paper, a new framework for an image/video coding approach has been presented in which the source and channel coding is integrated in a unique procedure. Image compression is performed in a standard way of the JPEG algorithm based on discrete cosine transform (DCT) and error control coding is based on the real/complex‐number (N,M) BCH code using discrete Fourier transform (DFT) specified with zeros in the time domain, i.e. with roots in the frequency domain. Efficiency of the proposed method is tested on two examples, an one‐dimensional real‐valued time sequence coded by real‐number (20,16) BCH code using DFT, and an example of an image coded by complex (10,8) BCH code using DFT with the correction ability of up to 8 impulses per transmitted 8×8 block. In addition, two decoding methods based on Berlekamp–Massey algorithm (BMA) and the minimum‐norm algorithm (MNA) have also compared. Copyright © 1999 John Wiley & Sons, Ltd. 相似文献