首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2852篇
  免费   254篇
  国内免费   123篇
电工技术   65篇
综合类   396篇
化学工业   18篇
金属工艺   15篇
机械仪表   41篇
建筑科学   180篇
矿业工程   8篇
能源动力   32篇
轻工业   9篇
水利工程   5篇
石油天然气   6篇
武器工业   11篇
无线电   1380篇
一般工业技术   155篇
冶金工业   65篇
原子能技术   148篇
自动化技术   695篇
  2024年   6篇
  2023年   20篇
  2022年   22篇
  2021年   29篇
  2020年   38篇
  2019年   47篇
  2018年   46篇
  2017年   67篇
  2016年   76篇
  2015年   95篇
  2014年   129篇
  2013年   274篇
  2012年   169篇
  2011年   193篇
  2010年   156篇
  2009年   172篇
  2008年   231篇
  2007年   236篇
  2006年   206篇
  2005年   188篇
  2004年   134篇
  2003年   136篇
  2002年   85篇
  2001年   72篇
  2000年   60篇
  1999年   61篇
  1998年   34篇
  1997年   43篇
  1996年   34篇
  1995年   14篇
  1994年   34篇
  1993年   17篇
  1992年   18篇
  1991年   17篇
  1990年   17篇
  1989年   16篇
  1988年   5篇
  1987年   2篇
  1985年   8篇
  1984年   3篇
  1983年   5篇
  1982年   5篇
  1981年   2篇
  1980年   1篇
  1978年   1篇
  1976年   1篇
  1966年   2篇
  1965年   1篇
  1961年   1篇
排序方式: 共有3229条查询结果,搜索用时 46 毫秒
1.
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.
空时分组码技术结合信道编码、调制和天线分集技术,当发送天线一定时,他的解码复杂度正比于发送速率,在3G标准中,该技术有着重要的地位。对空时分组码及相关知识进行了介绍,并对可变速率的空时分组码设计进行了探讨,最后展望了空时分组码技术的应用前景。  相似文献   
3.
Belief-Propagation-Approximated Decoding of Low-Density Parity-Check Codes   总被引:4,自引:1,他引:3  
In this paper, we propose a new reduced-complexity decoding algorithm of Low-Density Parity-Check (LDPC) codes, called Belief-Propagation-Approximated (BPA) algorithm, which utilizes the idea of normalization and translates approximately the intricate nonlinear operation in the check nodes of the original BP algorithm to only one operation of looking up the table. The normalization factors can be obtained by simulation, or theoretically. Simulation results demonstrate that BPA algorithm exhibits fairly satisfactory bit error performance on the Additive White Gaussian Noise (AWGN) channel.  相似文献   
4.
廖明  陈发堂 《信息技术》2004,28(9):25-27,48
介绍了非规则LDPC码的发展并给出了其优势及缺点,重点论述用ACE算法来构造非规则LDPC码从而降低其差错平底特性。对降低非规则LDPC码的差错平底特性的其它方法提出了展望。  相似文献   
5.
本文证明了当m>4时(2m,2,m)非线性等重码不是最佳检错码。  相似文献   
6.
7.
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.  相似文献   
8.
本文提出一种利用对译码器软信息限幅来改善多径衰落信道中Turbo乘积编码OFDM(TPC-OFDM)系统性能的新方法。通过对不同多径衰落信道中QPSK映射和16QAM映射的TPC-OFDM系统性能的数值仿真,结果表明在10^-5误比特率下,这种新方法比传统的迭代译码大约有6~10dB的改进,对严重多径环境下TPC-OFDM系统的错误平底也有明显的改进。  相似文献   
9.
We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the obtained codes share most properties of cyclic codes. Since there are much more skew-cyclic codes, this new class of codes allows to systematically search for codes with good properties. We give many examples of codes which improve the previously best known linear codes.  相似文献   
10.
In the framework of joint effort between the Nuclear Energy Agency (NEA) of OECD, the United States Department of Energy (US DOE), and the Commissariat a l'Energie Atomique (CEA), France a coupled three-dimensional (3D) thermal-hydraulics/neutron kinetics benchmark for VVER-1000 was defined. The benchmark consists of calculation of a pump start-up experiment labelled V1000CT-1 (Phase 1), as well as a vessel mixing experiment and main steam line break (MSLB) transient labelled V1000CT-2 (Phase 2), respectively. The reference nuclear plant is Kozloduy-6 in Bulgaria. The overall objective is to assess computer codes used in the analysis of VVER-1000 reactivity transients. A specific objective is to assess the vessel mixing models used in system codes. Plant data are available for code validation consisting of one experiment of pump start-up (V1000CT-1) and one experiment of steam generator isolation (V1000CT-2). The validated codes can be used to calculate asymmetric MSLB transients involving similar mixing patterns. This paper summarizes a comparison of CATHARE and TRAC-PF1 system code results for V1000CT-1, Exercise 1, which is a full plant point kinetics simulation of a reactor coolant system (RCS) pump start-up experiment. The reference plant data include integral and sector average parameters. The comparison is made from the point of view of vessel mixing and full system simulation. CATHARE used a six-sector multiple 1D vessel thermal-hydraulic model with cross flows and TRAC used a six-sector, 18-channel coarse-mesh 3D vessel model. Good agreement in terms of integral parameters and inter-loop mixing is observed.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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