全文获取类型
收费全文 | 3257篇 |
免费 | 273篇 |
国内免费 | 125篇 |
学科分类
工业技术 | 3655篇 |
出版年
2024年 | 10篇 |
2023年 | 29篇 |
2022年 | 34篇 |
2021年 | 37篇 |
2020年 | 46篇 |
2019年 | 58篇 |
2018年 | 64篇 |
2017年 | 81篇 |
2016年 | 91篇 |
2015年 | 115篇 |
2014年 | 160篇 |
2013年 | 293篇 |
2012年 | 190篇 |
2011年 | 213篇 |
2010年 | 172篇 |
2009年 | 176篇 |
2008年 | 242篇 |
2007年 | 272篇 |
2006年 | 223篇 |
2005年 | 199篇 |
2004年 | 147篇 |
2003年 | 156篇 |
2002年 | 113篇 |
2001年 | 91篇 |
2000年 | 71篇 |
1999年 | 75篇 |
1998年 | 47篇 |
1997年 | 49篇 |
1996年 | 34篇 |
1995年 | 15篇 |
1994年 | 33篇 |
1993年 | 17篇 |
1992年 | 17篇 |
1991年 | 16篇 |
1990年 | 16篇 |
1989年 | 16篇 |
1988年 | 6篇 |
1987年 | 2篇 |
1985年 | 8篇 |
1984年 | 3篇 |
1983年 | 5篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1978年 | 1篇 |
1966年 | 2篇 |
1965年 | 1篇 |
1961年 | 1篇 |
排序方式: 共有3655条查询结果,搜索用时 0 毫秒
1.
Reducing the complexity of distance measurement methods for circular turbo codes that use structured interleavers 下载免费PDF全文
Youssouf Ould‐Cheikh‐Mouhamedou 《International Journal of Communication Systems》2015,28(9):1572-1579
The knowledge of turbo code's minimum Hamming distance (dmin) and its corresponding codeword multiplicity (Amin) is of a great importance because the error correction capability of a code is strongly tied to the values of dmin and Amin. Unfortunately, the computational complexity associated with the search for dmin and Amin can be very high, especially for a turbo code that has high dmin value. This paper introduces some useful properties of turbo codes that use structured interleavers together with circular encoding. These properties allow for a significant reduction of search space and thus reduce significantly the computational complexity associated with the determination of dmin and Amin values. © 2014 The Authors. International Journal of Communication Systems published by John Wiley & Sons, Ltd. 相似文献
2.
介绍了非规则LDPC码的发展并给出了其优势及缺点,重点论述用ACE算法来构造非规则LDPC码从而降低其差错平底特性。对降低非规则LDPC码的差错平底特性的其它方法提出了展望。 相似文献
3.
4.
Seog Geun Kang 《ETRI Journal》2006,28(2):235-238
In this letter, a block code that minimizes the peak‐to‐average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) signals is proposed. It is shown that peak envelope power is invariant to cyclic shift and codeword inversion. The systematic encoding rule for the proposed code is composed of searching for a seed codeword, shifting the register elements, and determining codeword inversion. This eliminates the look‐up table for one‐to‐one correspondence between the source and the coded data. Computer simulation confirms that OFDM systems with the proposed code always have the minimum PAPR. 相似文献
5.
6.
介绍了神经网络与线性分组码之间的关系,并在文献[1]的基础上证明了软判决译码与求解能量函数最大值之间的等价性,然后以(7,4,3)汉明码为例介绍了神经网络在循环码硬判决、软判决译码中的应用。 相似文献
7.
8.
本文讨论了格形码距离谱的计算问题,定义了度量空间意义下的广义准正则格形码,对具有Imai与Hirakawa[2]和Ungerboeck[3]定义的典型的时不变网格结构的广义准正则格形码,证明了其距离谱可用全零信息序列对应的码字进行计算。在理论上推广了M.Rouance与D.J.Costelo的结果,解决了非平方欧几里德度量意义下一类TCM信号序列的距离谱计算问题 相似文献
9.
Tomik Yaghoobian Ian F. Blake 《Applicable Algebra in Engineering, Communication and Computing》1994,5(1):23-43
The subject of decoding Reed-Solomon codes is considered. By reformulating the Berlekamp and Welch key equation and introducing new versions of this key equation, two new decoding algorithms for Reed-Solomon codes will be presented. The two new decoding algorithms are significant for three reasons. Firstly the new equations and algorithms represent a novel approach to the extensively researched problem of decoding Reed-Solomon codes. Secondly the algorithms have algorithmic and implementation complexity comparable to existing decoding algorithms, and as such present a viable solution for decoding Reed-Solomon codes. Thirdly the new ideas presented suggest a direction for future research. The first algorithm uses the extended Euclidean algorithm and is very efficient for a systolic VLSI implementation. The second decoding algorithm presented is similar in nature to the original decoding algorithm of Peterson except that the syndromes do not need to be computed and the remainders are used directly. It has a regular structure and will be efficient for implementation only for correcting a small number of errors. A systolic design for computing the Lagrange interpolation of a polynomial, which is needed for the first decoding algorithm, is also presented.This research was supported by a grant from the Canadian Institute for Telecommunications Research under the NCE program of the Government of Canada 相似文献
10.
Long-Wen Chang Shui-kung Chuag Shang-shung Yu 《Multidimensional Systems and Signal Processing》1994,5(3):319-330
The compression of Chinese characters is very important for Chinese office automation and desktop publishing. In this paper, various methods are used to compress 13,051 Chinese characters losslessly by coding their skeleton points. The skeleton points are composed of isolated points and curves. To trace every point in a curve once and consecutively is a NP problem. Therefore, we use contour path following and revisiting algorithms to trace skeleton curves with chain codes. The remaining isolated skeleton points are encoded by an Elias code. Our coding method has a better compression rate than that of conventional skeleton coding. 相似文献