首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4895篇
  免费   493篇
  国内免费   136篇
化学   321篇
晶体学   1篇
力学   366篇
综合类   48篇
数学   830篇
物理学   635篇
无线电   3323篇
  2024年   10篇
  2023年   51篇
  2022年   89篇
  2021年   95篇
  2020年   130篇
  2019年   90篇
  2018年   119篇
  2017年   139篇
  2016年   153篇
  2015年   163篇
  2014年   275篇
  2013年   317篇
  2012年   299篇
  2011年   334篇
  2010年   236篇
  2009年   289篇
  2008年   335篇
  2007年   344篇
  2006年   336篇
  2005年   266篇
  2004年   253篇
  2003年   228篇
  2002年   172篇
  2001年   169篇
  2000年   110篇
  1999年   122篇
  1998年   89篇
  1997年   59篇
  1996年   58篇
  1995年   52篇
  1994年   35篇
  1993年   25篇
  1992年   16篇
  1991年   21篇
  1990年   8篇
  1989年   7篇
  1988年   9篇
  1987年   3篇
  1986年   3篇
  1985年   1篇
  1983年   2篇
  1982年   4篇
  1980年   2篇
  1979年   2篇
  1973年   1篇
  1971年   2篇
  1969年   1篇
排序方式: 共有5524条查询结果,搜索用时 15 毫秒
61.
在线误码监测方法及其性能   总被引:1,自引:0,他引:1  
李转年 《电信科学》1996,12(2):33-36
本文论述了在数字通信中进行在线误码监测的必要性,介绍了几种在线误码监测方法,并对其监测性能进行了理论分析。  相似文献   
62.
In this paper we investigate two-point algebraic-geometry codes (AG codes) coming from the Beelen-Montanucci (BM) maximal curve. We study properties of certain two-point Weierstrass semigroups of the curve and use them for determining a lower bound on the minimum distance of such codes. AG codes with better parameters with respect to comparable two-point codes from the Garcia-Güneri-Stichtenoth (GGS) curve are discovered.  相似文献   
63.
We prove two new upper bounds on the size of binary codes with a minimum distance of three, namelyA(10, 3)76 andA(11, 3)152.  相似文献   
64.
It is shown how to represent algebraically all functions that have a zero sum on all -dimensional subspaces ofPG(n,q) or ofAG(n,q). In this way one can calculate the dimensions of related codes, or one can represent interesting sets of points by functions.  相似文献   
65.
针对现有极化码软输出译码器存在的高资源消耗与低资源效率,设计了一种快速低复杂度软取消(Fast Reduced Complexity Soft-Cancelation,Fast-RCSC)译码算法及其译码器硬件架构。Fast-RCSC算法对内部特殊结点进行完整计算,在减少译码周期的同时仍有较好译码性能。基于不同特殊结点公式之间存在相似性,进而通过对引入的特殊结点模块进行计算结果复用以及计算模块分时复用,减少特殊结点模块资源消耗。通过共用存储单元以及对不足存储单元数据宽度的数据进行合并,降低存储资源消耗。在华润上华(Central Semiconductor Manufacturing Corporation,CSMC)180nm工艺下综合结果表明,设计的译码器在码长为1024的情况下,面积为2.92mm2,资源效率为245.2Mbps/mm2,相比现有软输出译码器有不同程度的提升。  相似文献   
66.
集中式多输入多输出(Multiple Input Multiple Output,MIMO)雷达通常利用正交波形增加发射波形自由度,采用数字阵列拓展空间收发自由度,使得雷达接收机的天线孔径获得明显扩展,最终带来空间分辨率、测角精确度、杂波抑制能力等大幅度提升。但是,这些性能提升的前提是发射波形具有正交特性。事实上,在实际应用中,在不牺牲时域/频域资源情况下,受限于时宽带宽积,无法获得完全正交的波形集合,从而限制了MIMO雷达系统性能。本文对集中式MIMO雷达正交波形复用的技术原理进行了系统回顾,分别归纳了三种快时间发射波形设计方法:时分复用(Time Division Multiplexing, TDM)、码分复用(Code Division Multiplexing,CDM)和频分复用 (Frequency Division Multiplexing, FDM),以及两种慢时间发射波形设计方法:多普勒分复用(Doppler Division Multiplexing,DDM)和随机相位编码波形,并对其优缺点进行对比。同时,对快时间MIMO和慢时间MIMO的信号处理流程进行归纳综合,给出基于匹配滤波的集中式MIMO雷达统一信号处理框架。为了展示不同波形对成像性能的影响,本文给出了基于三维匹配滤波的MIMO雷达成像结果。最后,结合实际应用问题,指出当前MIMO雷达面临的技术难点和发展趋势。  相似文献   
67.
The error-rate floor of low-density parity-check (LDPC) codes is attributed to the trapping sets of their Tanner graphs. Among them, fully absorbing sets dominantly affect the error-rate performance, especially for short blocklengths. Efficient methods to identify the dominant trapping sets of LDPC codes were thoroughly researched as exhaustively searching them is NP-hard. However, the existing methods are ineffective for Raptor-like LDPC codes, which have many types of trapping sets. An effective method to identify dominant fully absorbing sets of Raptor-like LDPC codes is proposed. The search space of the proposed algorithm is optimized into the Tanner subgraphs of the codes to afford time-efficiency and search-effectiveness. For 5G New Radio (NR) base graph (BG) 2 LDPC codes for short blocklengths, the proposed algorithm finds more dominant fully absorbing sets within one seventh of the computation time of the existing search algorithm, and its search-effectiveness is verified using importance sampling. The proposed method is also applied to 5G NR BG1 LDPC code and Advanced Television Systems Committee 3.0 type A LDPC code for large blocklengths.  相似文献   
68.
Robust reversible watermarking can provide robustness against various attacks besides the ability to recover the cover image. However, robustness and reversibility are somewhat separate in many schemes. The original cover image cannot be recovered even if the watermarked image suffers from a tiny distortion. This paper presents a new robust reversible watermarking scheme by exploring the reversibility of spread-spectrum codes. Watermark bits are embedded by a suggested adaptive spread-spectrum code. The embedding amplitude used in the algorithms is determined by quantizing the source interference of the cover. The proposed scheme is robust to various attacks. Furthermore, since the embedding amplitude is available at the receiver, the original image can be recovered losslessly when there is no attack. Even in the presence of attacks, the original cover images can still be partially recovered. Experimental results demonstrate that the proposed scheme performs well on robustness and watermarked image quality, and provide extra reversibility that resists image distortions.  相似文献   
69.
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.  相似文献   
70.
A method for the determination of the new insect repellent Bayrepel in bathing lakes and public pools is presented. Sample preconcentration is performed either by solid-phase extraction (SPE) or stir bar sorptive extraction (SBSE). Analysis of the enriched analyte using gas chromatography-mass spectrometry (GC-MS) led to almost identical limits of detection (LOD) of 25ngL–1 for Bayrepel with both extraction methods. Because of the slightly reduced handling effort involved, the method based on preconcentration by SBSE was finally chosen for the analysis of real samples.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号