检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

14,478 篇 会议
2,084 篇 期刊文献
4 篇 学位论文
1 篇 资讯

馆藏范围

16,567 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,849 篇 工学
- 1,978 篇 电气工程
- 1,028 篇 计算机科学与技术...
- 612 篇 信息与通信工程
- 549 篇 控制科学与工程
- 398 篇 电子科学与技术（可...
- 339 篇 机械工程
- 313 篇 仪器科学与技术
- 273 篇 软件工程
- 101 篇 核科学与技术
- 99 篇 生物医学工程（可授...
- 81 篇 交通运输工程
- 53 篇 测绘科学与技术
- 38 篇 航空宇航科学与技...
- 31 篇 网络空间安全
- 28 篇 光学工程
- 24 篇 材料科学与工程（可...
- 21 篇 力学（可授工学、理...
810 篇 理学
- 317 篇 物理学
- 256 篇 数学
- 172 篇 系统科学
- 41 篇 地球物理学
- 20 篇 化学
- 18 篇 生物学
- 15 篇 统计学（可授理学、...
279 篇 管理学
- 275 篇 管理科学与工程(可...
222 篇 医学
- 178 篇 临床医学
- 75 篇 特种医学
- 22 篇 基础医学(可授医学...
136 篇 文学
- 136 篇 新闻传播学
29 篇 艺术学
- 28 篇 设计学（可授艺术学...
14 篇 军事学
12 篇 农学
8 篇 经济学
4 篇 教育学
2 篇 法学

主题

16,567 篇 iterative algori...
2,270 篇 iterative method...
2,022 篇 algorithm design...
1,655 篇 convergence
1,443 篇 iterative decodi...
1,096 篇 image reconstruc...
1,043 篇 computer science
1,036 篇 signal processin...
1,002 篇 clustering algor...
943 篇 equations
761 篇 robustness
753 篇 testing
635 篇 partitioning alg...
560 篇 computational mo...
546 篇 costs
530 篇 maximum likeliho...
485 篇 control systems
483 篇 parity check cod...
483 篇 hardware
472 篇 frequency

机构

45 篇 institute for in...
43 篇 school of electr...
35 篇 department of el...
30 篇 department of el...
30 篇 department of el...
28 篇 department of el...
27 篇 department of el...
27 篇 school of electr...
27 篇 department of el...
26 篇 school of electr...
25 篇 department of el...
24 篇 department of el...
22 篇 department of el...
22 篇 microsoft resear...
22 篇 department of el...
21 篇 school of electr...
21 篇 ibm thomas j. wa...
20 篇 department of el...
20 篇 department of el...
19 篇 department of el...

作者

23 篇 e. rogers
22 篇 j.a. fessler
22 篇 a.k. katsaggelos
21 篇 xianlong hong
18 篇 c.-c.j. kuo
18 篇 d.h. owens
17 篇 li zhang
15 篇 j. white
14 篇 a.e. yagle
14 篇 jing wang
14 篇 yonghuai liu
13 篇 shidong zhou
13 篇 a. anastasopoulo...
13 篇 chong-yung chi
13 篇 w.c. chew
12 篇 dacheng yang
12 篇 an-yeu wu
12 篇 m. fossorier
12 篇 m.a. king
12 篇 eric rogers

语言

16,150 篇 英文
347 篇 其他
66 篇 中文
2 篇 法文
1 篇 西班牙文
1 篇 土耳其文

检索条件"主题词=Iterative algorithms"

共 16567 条记录，以下是211-220 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

iterative decoding algorithms for real time software implementation in wireless communication systems

Iterative decoding algorithms for real time software impleme...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Y. Or G. Kutz A. Chass A. Gubeskys E. Pollak Motorola Semiconductor Israel Limited Herzliya Israel

iterative decoding has emerged as one of the most promising techniques for improving receivers performance. This paper is focused on exploring the feasibility of software implementation of iterative decoding algorithms for the 2nd and 3rd generations of the cellular communications standards. Two examples for iterative decoding algorithms are described: turbo decoding for the 3G cellular standards and turbo equalization for a GSM receiver. The principles described can be used to efficiently construct and implement other iterative decoding algorithms.

关键词： iterative decoding Software algorithms iterative algorithms Real time systems Communication system software Wireless communication GSM Detectors Application software Table lookup

来源：评论

学校读者我要写书评

暂无评论

A functional minimization interpretation of fast iterative reconstruction algorithms

A functional minimization interpretation of fast iterative r...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： M.A. Richards Radar & Instrumentation Laboratory Georgia Tech Research Institute Georgia Institute of Technology Atlanta GA USA

The functional minimization framework is used to show that the quadratic algorithm gains its advantage by substituting an estimate of D/sup -1/ which is refined at each estimate for the differing, but static, estimates used by most competing methods. This observation identifies the quadratic algorithm as one of the class of quasi-Newton procedures. Empirical convergence comparisons are provided for several linear algorithms, the quadratic and cubic algorithms, and the conjugate gradient algorithm for various inputs x and operators D. The results clearly show the superior convergence of the polynomial algorithms over both the local gradient and conjugate gradient methods.< >

关键词： Convergence Minimization methods iterative algorithms Polynomials Gradient methods

来源：评论

学校读者我要写书评

暂无评论

Comprehesion of adaptive iterative decoding algorithms of turbo codes

Comprehesion of adaptive iterative decoding algorithms of tu...

引用

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Gu Jian Yang Dacheng BUPT-QUALCOMM wireless research center Beijing University of Posts and Telecommunications Beijing China

Near Shannon limit error-correcting coding and decoding - turbo codes were proposed in 1993 and lots of work was done on this aspect. Several adaptive iterative decoding algorithms for turbo codes were proposed to reduce the decoding delay. We investigate and improve these adaptive algorithms. The simulation results, comparison and analysis are presented.

关键词： iterative decoding Turbo codes iterative algorithms Convolutional codes Delay effects Entropy Adaptive algorithm Analytical models Wireless communication Channel coding

来源：评论

学校读者我要写书评

暂无评论

Uniformity and homogeneity issues with concurrent iterative reconstruction algorithms

Uniformity and homogeneity issues with concurrent iterative ...

引用

IEEE Symposium on Nuclear Science (NSS/MIC)

作者： H.R. Tang J.K. Brown X. Wu B.H. Hasegawa Department of Radiology and the Bioengineering Graduate Group University of California Los Angeles San Francisco USA

Concurrent iterative reconstruction algorithms are iterative reconstruction algorithms that inject projection data into the iterative process as the data become available during the SPECT acquisition process and continue iterations in the post-acquisition period as conventional iterative algorithms. Because projections acquired early are processed more than later projections, regional inhomogeneities may exist in the initial image estimates but decrease with further post-acquisition iteration. Regularization done either during the acquisition or post-acquisition iterations further reduces regional inhomogeneities. The authors tested statistical differences in regions throughout the reconstructed image to determine the minimal number of post-acquisition iterations and type of regularization needed to reach an image that is inter-regionally consistent. Depending on the requirements of the final clinical application, the algorithms can offer a reduction in post-acquisition reconstruction time when compared to conventional iterative algorithms and provide images free of reconstruction inhomogeneities.

关键词： Reconstruction algorithms Image reconstruction iterative algorithms Data acquisition iterative methods Concurrent computing Heart Image resolution Radiology Biomedical engineering

来源：评论

学校读者我要写书评

暂无评论

Minimizing the Communication Overhead of iterative Scheduling algorithms for Input-Queued Switches

Minimizing the Communication Overhead of Iterative Schedulin...

引用

2011 IEEE Global Telecommunications Conference - GLOBECOM 2011

作者： Bing Hu Kwan L. Yeung Zhaoyang Zhang Department of Information Science and Electronic Engineering University of Zhejiang Hangzhou China Department of Electrical and Electronic Engineering University of Hong Kong Hong Kong China

Communication overhead should be minimized when designing iterative scheduling algorithms for input-queued packet switches. In general, the overall communication overhead is a function of the number of iterations required per time slot (M) and the data bits exchanged in an input-output pair per iteration (B). In this paper, we aim at maximizing switch throughput while minimizing communication overhead. We first propose a single-iteration scheduling algorithm called Highest Rank First (HRF). In HRF, the highest priority is given to the preferred input-output pair calculated in each local port at a RR (Round Robin) order. Only when the preferred VOQ(i,j) is empty, input i sends a request with a rank number r to each output. The request from a longer VOQ carries a smaller r. Higher scheduling priority is given to the request with a smaller r. To further cut down its communication overhead to 1 bit per request, we design HRF with Request Compression (HRF/RC). The basic idea is that we transmit a single bit code in request phase. Then r can be decoded at output ports from the current and historical codes received. The overall communication overhead for HRF/RC becomes 2 bits only, i.e. 1 bit in request phase and 1 bit in grant phase. We show that HRF/RC renders a much lower hardware cost than multi-iteration algorithms and a single-iteration algorithm π-RGA [11]. Compared with other iterative algorithms with the same communication overhead (i.e. SRR [10] and 1-iteration iSLIP [6]), simulation results show that HRF/RC always produces the best delay-throughput performance.

关键词： Throughput iterative algorithms Scheduling Impedance matching Traffic control Round robin Parallel processing

来源：评论

学校读者我要写书评

暂无评论

Two-stage iterative decoding algorithms for a class of cyclic codes

Two-stage iterative decoding algorithms for a class of cycli...

引用

IEEE (first ITW conference of the year) Information Theory Workshop (ITW)

作者： Li Zhang Qin Huang Shu Lin Department of Electrical and Computer Engineering University of California Davis Davis CA USA

ISBN: (纸本)9781424463725

This paper presents a class of iteratively decodable cyclic codes. Codes in this class have large minimum distance; however, their Tanner graphs contain many short cycles of length 4. With the conventional iterative decoding based on belief propagation, these short cycles significantly degrade the error performance of the codes. To avoid the degrading effect of these short cycles in performance, two-stage iterative decoding algorithms are devised. Cyclic codes have encoding advantage over other linear block codes. Encoding of a cyclic code in systematic form can be implemented with a single feedback shift-register.

关键词： iterative decoding iterative algorithms Degradation Encoding Geometry Belief propagation Block codes Feedback Shift registers Sum product algorithm

来源：评论

学校读者我要写书评

暂无评论

The importance of preconditioners in fast Poisson-based iterative reconstruction algorithms for SPECT

The importance of preconditioners in fast Poisson-based iter...

引用

IEEE Symposium on Nuclear Science (NSS/MIC)

作者： D.S. Lalush M.W. Tsui Department of Biomedical Engineering North Carolina State University Chapel Hill USA Department of Radiology North Carolina State University Chapel Hill USA

We study the effects of different preconditioners on Poisson-based iterative reconstruction algorithms. Preconditioners are linear transformations that map the image solution space for the reconstruction problem into a space where the likelihood function can be more efficiently optimized. We apply preconditioners to conjugate gradient (CG) algorithms seeking to optimize the Poisson log likelihood function for SPECT. We show that, without a preconditioner, such algorithms may converge more slowly than the ML-EM algorithm. Previous research has applied a preconditioner that depends on the current iteration's image estimate. However, these algorithms do not generate conjugate step directions and do not obtain the full benefit of the CG algorithm's speed. We propose a preconditioner that depends only on the measured projection data and remains constant with each iteration, thus generating nearly conjugate step directions. We show that our method optimizes the log likelihood function more efficiently than the previously proposed methods. We also show that, if the measured projection data contains few zero or near-zero projection bins, the Poisson CG algorithms have convergence rates comparable with those from weighted least-squares (WLS-CG) algorithms. We conclude that the performance of Poisson CG algorithms depends heavily on the preconditioner chosen, and that they can be made competitive with WLS-CG by manipulation of the preconditioners.

关键词： Reconstruction algorithms iterative algorithms Character generation Convergence Image reconstruction Biomedical measurements Cancer Biomedical engineering Radiology Image converters

来源：评论

学校读者我要写书评

暂无评论

General methodology for mapping iterative approximation algorithms to adaptive dynamically partially reconfigurable systems

General methodology for mapping iterative approximation algo...

引用

International Conference on Field Programmable Logic and Applications

作者： Josef Angermeier Abdulazim Amouri Jurgen Teich Department of Computer Science University of Erlangen Nuremberg Erlangen Germany

This paper presents a general methodology for mapping a class of algorithms known as iterative algorithms to FPGA-based dynamically partially reconfigurable architectures in an adaptive and efficient manner. Hereby, each iteration step is mapped to a partial module on the FPGA, and modules can be added or removed to these connected modules on the FPGA dynamically using partial reconfiguration. The more modules and iteration steps, respectively, are concurrently executed on the FPGA, the higher the achieved through-put due to exploitation of pipelining in the design. Especially, numerical approximation algorithms allow a trade-off between precision of the final result and the execution time, and benefit by the proposed mapping methodology: When mapping an element of that class of algorithms to a partially dynamically reconfigurable platform, the number of modules can be increased or decreased at runtime depending on the desired quality of the results and the available area. Thus, the proposed general mapping methodology provides an acceleration of an important class of algorithms due to the execution in hardware, and allows at runtime a trade-off decision between execution time and quality of the results. Furthermore, a detailed description of an experimental implementation of a square root calculation on a reconfigurable platform is given as a prototype example to explain and show the benefits of the proposed approach.

关键词： iterative methods Approximation algorithms Heuristic algorithms iterative algorithms Field programmable gate arrays Runtime Reconfigurable architectures Pipeline processing Acceleration Hardware

来源：评论

学校读者我要写书评

暂无评论

iterative decoding algorithms updating likelihood and channel values based on interim hard decision results

Iterative decoding algorithms updating likelihood and channe...

引用

IEEE International Symposium on Information Theory

作者： M. Ariyoshi I. Sasase Department of Information and Computer Science Keio University Yokohama Japan

This paper presents novel decoding algorithms for turbo codes, in which the likelihood and channel values are updated in order for those values to become closer to the true values thorough the iterative decoding procedure. The criteria for updating the likelihood and channel values are proposed, those are based on the simple means to compare the interim hard decision results from each of component decoders.

关键词： iterative decoding iterative algorithms Bit error rate Error correction AWGN Turbo codes Convolutional codes Performance evaluation Computer science Concatenated codes

来源：评论

学校读者我要写书评

暂无评论

A new generation of iterative transform algorithms for phase contrast tomography

A new generation of iterative transform algorithms for phase...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： H.H. Bauschke P.L. Combettes D.R. Luke Department of Mathematics and Statistics University of Guelph Guelph ONT Canada Laboratoire Jacques-Louis Lions Université Pierre et Marie Curie Paris France Department of Mathematical Sciences University of Delaware Newark DE USA

Improvements in electromagnetic sources, detectors, optical components, and computational imaging have made it possible to achieve three-dimensional atomic-scale resolution using tomographic phase-contrast imaging techniques. These greater capabilities have placed a premium on improving the efficiency and stability of phase retrieval algorithms for recovering the missing phase information in diffraction observations. In some cases, so called direct methods suffice, but, for large macromolecules and nonperiodic structures, one must rely on numerical techniques for reconstructing the missing phase. This is the principal motivation of our work. We report on recent progress in algorithms for iterative phase retrieval. The theory of convex optimisation is used to develop and to gain insight into counterparts for the nonconvex problem of phase retrieval. We propose a relaxation of averaged alternating reflectors and determine the fundamental mathematical properties of the related operator in the convex case. Numerical studies support our theoretical observations and demonstrate the effectiveness of the newer generation of algorithms compared to the current state of the art.

关键词： iterative algorithms Tomography Optical imaging Optical detectors Phase detection Optical devices Optical computing Atom optics Image resolution Stability

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共500页 << < 18 19 20 21 22 23 24 25 26 27 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：