全文获取类型
收费全文 | 4769篇 |
免费 | 453篇 |
国内免费 | 71篇 |
专业分类
化学 | 165篇 |
力学 | 70篇 |
综合类 | 46篇 |
数学 | 768篇 |
物理学 | 594篇 |
无线电 | 3650篇 |
出版年
2024年 | 8篇 |
2023年 | 47篇 |
2022年 | 84篇 |
2021年 | 91篇 |
2020年 | 123篇 |
2019年 | 87篇 |
2018年 | 108篇 |
2017年 | 128篇 |
2016年 | 146篇 |
2015年 | 159篇 |
2014年 | 273篇 |
2013年 | 313篇 |
2012年 | 296篇 |
2011年 | 320篇 |
2010年 | 227篇 |
2009年 | 275篇 |
2008年 | 317篇 |
2007年 | 342篇 |
2006年 | 339篇 |
2005年 | 251篇 |
2004年 | 240篇 |
2003年 | 232篇 |
2002年 | 163篇 |
2001年 | 171篇 |
2000年 | 101篇 |
1999年 | 117篇 |
1998年 | 78篇 |
1997年 | 58篇 |
1996年 | 49篇 |
1995年 | 46篇 |
1994年 | 31篇 |
1993年 | 23篇 |
1992年 | 8篇 |
1991年 | 12篇 |
1990年 | 8篇 |
1989年 | 5篇 |
1988年 | 7篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1983年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1971年 | 2篇 |
1969年 | 1篇 |
排序方式: 共有5293条查询结果,搜索用时 0 毫秒
11.
12.
一种PN码自适应捕获门限的改进算法 总被引:1,自引:0,他引:1
文献[1]提出了一种用于直扩系统的PN码自适应门限算法。但该文献也指出,此算法对门限总数十分敏感。当门限总数设置不当时,系统的平均捕获时间将显著增加。这限制了该算法在实际中的应用。本文就此提出了改进,给出了算法及电路框图。仿真结果表明,与原方案相比,改进算法改善了对门限总数的敏感性,降低了PN码平均捕获时间。 相似文献
13.
Java语言及其虚拟机技术探讨 总被引:1,自引:0,他引:1
随着Internet的迅猛发展,Internet编程语言Java愈来愈成为计算机行业的焦点。本文在简述了Java的主要特点后,重点对Java最关键的技术──虚拟机进行了深入的探讨。 相似文献
14.
A technique for designing efficient checkers for conventional Berger code is proposed in this paper. The check bits are derived by partitioning the information bits into two blocks, and then using an addition array to sum the number of 1's in each block. The check bit generator circuit uses a specially designed 4-input 1's counter. Two other types of 1's counters having 2 and 3 inputs are also used to realize checkers for variable length information bits. Several variations of 2-bit adder circuits are used to add the number of 1's. The check bit generator circuit uses gates with fan-in of less than or equal to 4 to simplify implementation in CMOS. The technique achieves significant improvement in gate count as well as speed over existing approaches. 相似文献
15.
A system-on-chip (SOC) usually consists of many memory cores with different sizes and functionality, and they typically represent a significant portion of the SOC and therefore dominate its yield. Diagnostics for yield enhancement of the memory cores thus is a very important issue. In this paper we present two data compression techniques that can be used to speed up the transmission of diagnostic data from the embedded RAM built-in self-test (BIST) circuit that has diagnostic support to the external tester. The proposed syndrome-accumulation approach compresses the faulty-cell address and March syndrome to about 28% of the original size on average under the March-17N diagnostic test algorithm. The key component of the compressor is a novel syndrome-accumulation circuit, which can be realized by a content-addressable memory. Experimental results show that the area overhead is about 0.9% for a 1Mb SRAM with 164 faults. A tree-based compression technique for word-oriented memories is also presented. By using a simplified Huffman coding scheme and partitioning each 256-bit Hamming syndrome into fixed-size symbols, the average compression ratio (size of original data to that of compressed data) is about 10, assuming 16-bit symbols. Also, the additional hardware to implement the tree-based compressor is very small. The proposed compression techniques effectively reduce the memory diagnosis time as well as the tester storage requirement. 相似文献
16.
在线误码监测方法及其性能 总被引:1,自引:0,他引:1
本文论述了在数字通信中进行在线误码监测的必要性,介绍了几种在线误码监测方法,并对其监测性能进行了理论分析。 相似文献
17.
Shufeng Li Mingyu Cai Robert Edwards Yao Sun Libiao Jin 《Digital Communications & Networks》2022,8(3):359-372
Binary Polar Codes (BPCs) have advantages of high-efficiency and capacity-achieving but suffer from large latency due to the Successive-Cancellation List (SCL) decoding. Non-Binary Polar Codes (NBPCs) have been investigated to obtain the performance gains and reduce latency under the implementation of parallel architectures for multi-bit decoding. However, most of the existing works only focus on the Reed-Solomon matrix-based NBPCs and the probability domain-based non-binary polar decoding, which lack flexible structure and have a large computation amount in the decoding process, while little attention has been paid to general non-binary kernel-based NBPCs and Log-Likelihood Ratio (LLR) based decoding methods. In this paper, we consider a scheme of NBPCs with a general structure over GF(2m). Specifically, we pursue a detailed Monte-Carlo simulation implementation to determine the construction for proposed NBPCs. For non-binary polar decoding, an SCL decoding based on LLRs is proposed for NBPCs, which can be implemented with non-binary kernels of arbitrary size. Moreover, we propose a Perfect Polarization-Based SCL (PPB-SCL) algorithm based on LLRs to reduce decoding complexity by deriving a new update function of path metric for NBPCs and eliminating the path splitting process at perfect polarized (i.e., highly reliable) positions. Simulation results show that the bit error rate of the proposed NBPCs significantly outperforms that of BPCs. In addition, the proposed PPB-SCL decoding obtains about a 40% complexity reduction of SCL decoding for NBPCs. 相似文献
18.
GPS接收机中的码分多址信号处理研究 总被引:1,自引:0,他引:1
介绍了基于码分多址信号处理的GPS(全球定位系统)接收机的算法和电路设计。GPS接收机电路的信号处理任务主要是对数字化后的基带扩频信号进行载波跟踪、解调、解扩、码跟踪,从而得到符号数据。着重讨论了GPS接收机中信号处理部分的COSTAS、码跟踪、帧同步生成电路三大模块的功能任务、原理、算法及其相应的电路设计。通过这些研究工作,可以进一步设计出当前应用日益普遍的GPS接收机电路,该电路具有功能全面、通用性好、可靠性高等特点。 相似文献
19.
20.