全文获取类型
收费全文 | 2770篇 |
免费 | 258篇 |
国内免费 | 42篇 |
专业分类
化学 | 19篇 |
晶体学 | 3篇 |
力学 | 12篇 |
综合类 | 25篇 |
数学 | 830篇 |
物理学 | 293篇 |
无线电 | 1888篇 |
出版年
2024年 | 34篇 |
2023年 | 103篇 |
2022年 | 155篇 |
2021年 | 159篇 |
2020年 | 153篇 |
2019年 | 117篇 |
2018年 | 71篇 |
2017年 | 78篇 |
2016年 | 80篇 |
2015年 | 72篇 |
2014年 | 109篇 |
2013年 | 132篇 |
2012年 | 100篇 |
2011年 | 105篇 |
2010年 | 77篇 |
2009年 | 141篇 |
2008年 | 203篇 |
2007年 | 163篇 |
2006年 | 175篇 |
2005年 | 123篇 |
2004年 | 89篇 |
2003年 | 120篇 |
2002年 | 94篇 |
2001年 | 73篇 |
2000年 | 73篇 |
1999年 | 78篇 |
1998年 | 46篇 |
1997年 | 44篇 |
1996年 | 28篇 |
1995年 | 10篇 |
1994年 | 16篇 |
1993年 | 8篇 |
1992年 | 11篇 |
1991年 | 9篇 |
1990年 | 4篇 |
1989年 | 6篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
1959年 | 2篇 |
排序方式: 共有3070条查询结果,搜索用时 15 毫秒
1.
3.
4.
5.
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. 相似文献
6.
介绍了非规则LDPC码的发展并给出了其优势及缺点,重点论述用ACE算法来构造非规则LDPC码从而降低其差错平底特性。对降低非规则LDPC码的差错平底特性的其它方法提出了展望。 相似文献
7.
P. Le Bars 《Journal of Combinatorial Theory, Series A》2006,113(8):1771-1782
The aggregate error locator is defined and a computation method is given. The aggregate error locator is then used in a type of Forney algorithm to compute the error values in the received words of a Ca,b algebraic geometry code. 相似文献
8.
A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc. 相似文献
9.
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. 相似文献
10.