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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

107 篇 期刊文献
69 篇 会议
2 篇 学位论文

馆藏范围

178 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

171 篇 工学
- 142 篇 电气工程
- 84 篇 信息与通信工程
- 64 篇 计算机科学与技术...
- 22 篇 电子科学与技术（可...
- 8 篇 交通运输工程
- 6 篇 机械工程
- 4 篇 仪器科学与技术
- 3 篇 软件工程
- 2 篇 控制科学与工程
- 1 篇 生物医学工程（可授...
27 篇 理学
- 23 篇 数学
- 4 篇 物理学
- 1 篇 生物学
4 篇 医学
- 4 篇 临床医学
- 1 篇 特种医学
2 篇 文学
- 1 篇 外国语言文学
- 1 篇 新闻传播学
2 篇 管理学
- 2 篇 管理科学与工程(可...
1 篇 法学
- 1 篇 社会学
1 篇 教育学
- 1 篇 教育学

主题

178 篇 decoding complex...
32 篇 decoding
13 篇 complexity theor...
12 篇 iterative decodi...
10 篇 error correction...
10 篇 diversity
10 篇 convolutional co...
9 篇 computational co...
8 篇 encoding complex...
8 篇 polar codes
8 篇 parity check cod...
8 篇 error exponent
7 篇 codes
7 篇 channel coding
6 篇 concatenated cod...
6 篇 turbo codes
6 篇 block codes
6 篇 ldpc codes
6 篇 maximum likeliho...
6 篇 mimo

机构

8 篇 indian inst sci ...
4 篇 nanyang technol ...
3 篇 nanjing univ sch...
2 篇 singapore univ t...
2 篇 univ southern ca...
2 篇 univ new s wales...
2 篇 guangdong univ t...
2 篇 singapore univ t...
2 篇 beijing inst tec...
2 篇 univ witwatersra...
2 篇 sun yat sen univ...
2 篇 russian acad sci...
2 篇 univ turku dept ...
2 篇 univ ulm dept te...
2 篇 technion israel ...
2 篇 osaka gakuin uni...
2 篇 ozyegin univ dep...
2 篇 department of el...
2 篇 koc univ dept el...
2 篇 lucent technol b...

作者

5 篇 guan yong liang
5 篇 pimentel cecilio
5 篇 rajan b. sundar
5 篇 souza richard de...
4 篇 jiang hua
4 篇 uchoa-filho bart...
3 篇 kuo c. -c. jay
3 篇 lee szu-wei
3 篇 mceliece rj
3 篇 aslam chaudhry a...
3 篇 hisojo miguel an...
3 篇 chen li
3 篇 benchimol isaac
3 篇 du sidan
3 篇 hari k. v. s.
3 篇 cai kui
3 篇 zyablov v
3 篇 deneire luc
3 篇 cheun kyungwhoon
3 篇 rajashekar raksh...

语言

171 篇 英文
4 篇 其他
2 篇 中文
1 篇 土耳其文

检索条件"主题词=decoding complexity"

共 178 条记录，以下是121-130 订阅

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

详细简洁

排序：

Improved decoding Algorithms for Quasi-Orthogonal Space-Time Block Codes

Improved Decoding Algorithms for Quasi-Orthogonal Space-Time...

引用

64th IEEE Vehicular Technology Conference

作者： Kim, Jeongchang Cheun, Kyungwhoon Pohang Univ Sci & Technol POSTECH Div Elect & Comp Engn Pohang South Korea

ISBN: (纸本)9781424400621

Recently, a variety of full-rate, full-diversity quasi-orthogonal space-time block codes (QO-STBCs) have been designed. Though the quasi-orthogonality does reduce the decoding complexity, from order of MQ(N) to MQ(N/2) for Q-ary QAM modulation with N transmit and M receive antennas, there is still need for improvement. Several simple suboptimum decoding algorithms were proposed but suffer quite severe performance losses over maximum likelihood (ML) decoding. Here, we propose a class of decoding algorithms for QO-STBCs based on interference cancellation with complexity on the order of MQ(N/2) (-) (1) and performance virtually identical to that of ML, decoding. A modification to the base algorithm is also developed with complexity approximately 1/root Q times that of the base algorithm.

关键词： Quasi-orthogonal space-time block codes (QO-STBCs) decoding complexity interference cancellation multiple transmit antennas diversity

来源：评论

学校读者我要写书评

暂无评论

Low-complexity Wire-Tap Codes with Security and Error-Correction Guarantees

Low-Complexity Wire-Tap Codes with Security and Error-Correc...

引用

IEEE Information Theory Workshop (ITW)

作者： Cassuto, Yuval Bandic, Zvonimir Ecole Polytech Fed Lausanne ALGO Sch Comp & Commun Sci CH-1015 Lausanne Switzerland San Jose Res Ctr San Jose CA 95192 USA

ISBN: (纸本)9781424482641

New code constructions are proposed for the wiretap channel with security and error-correction guarantees. For the case of error-free main channels, two families of codes are constructed with optimal encoding and decoding complexities for their wire-tap security. For the case of main channels with errors, two concatenation types are studied for the wire-tap and error-correcting codes. For each of these concatenated schemes, code families are constructed that give optimal cooperation between the wire-tap and error-correction properties. The motivation to study low-complexity wire-tap codes with security and error-correction guarantees comes from data storage applications. Due to imperfect physical erasure processes, important secret information needs to be protected from adversarial access to residual, post erasure, information, and at the same time be protected from errors when read by the legitimate device user.

关键词： channel coding code constructions code family concatenated codes concatenation types data storage applications decoding complexity error correction codes error-correcting codes error-correction guarantees error-free main channels low-complexity wire-tap codes optimal encoding physical erasure processes secret information telecommunication security wire-tap security wiretap channel

来源：评论

学校读者我要写书评

暂无评论

Not Just for Errors: Codes for Fast and Secure Flash Storage

Not Just for Errors: Codes for Fast and Secure Flash Storage

引用

Globecom Workshops

作者： Cassuto, Yuval Ecole Polytech Fed Lausanne Sch Comp & Commun Sci ALGO Lab CH-1015 Lausanne Switzerland

ISBN: (纸本)9781424488650

Error-correcting codes are normally employed in storage devices to guarantee the integrity of data in the presence of errors. This paper presents two schemes where error-correcting codes are used for entirely different purposes. In the first part of the paper, a new coding paradigm is proposed to improve the write performance of multi-level flash devices. By slightly relaxing the accuracy of cell programming, significant speed-up can be achieved. The resulting write inaccuracies are then corrected by codes that are tailored for the appropriately restricted error model. In the second part, new low-complexity codes are proposed to protect the security of sensitive data in the presence of imperfect physical erasure processes. Codes that have optimal encoding and decoding complexities are constructed to allow fast storing and retrieval of secret data, and guarantee unconditional security of data against an adversary with access to parts of the secret that failed to erase.

关键词： cell programming decoding decoding complexity encoding complexity error correction codes error-correcting codes flash memories low-complexity codes multilevel flash storage devices security of data sensitive data security

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Iterative Decoder for Faster-than-Nyquist Signaling Multicarrier systems

Design and Implementation of Iterative Decoder for Faster-th...

引用

IEEE-Computer-Society Annual Symposium on VLSI (ISVLSI)

作者： Dasalukunte, Deepak Rusek, Fredrik Anderson, John. B. Owall, Viktor Lund Univ Ctr High Speed Wireless Commun Dept EIT S-22100 Lund Sweden

ISBN: (纸本)9780769544472

Faster-than-Nyquist (FTN) signaling is a method of improving bandwidth efficiency by transmitting information beyond Nyquist's orthogonality limit for interference free transmission. Previously have theoretically established that FTN can provide improved bandwidth efficiency. However, this comes at the cost of higher decoding complexity at the receiver. Our work has evaluated multicarrier FTN signaling for its implementation feasibility and complexity overhead compared to the gains in bandwidth efficiency. The work carried out in this research project includes a systems perspective evaluating performance, algorithm hardware tradeoffs and a hardware architecture leading to a silicon implementation of the decoder for FTN signaling. From the systems perspective, co-existence of FTN and OFDM based multicarrier system has been evaluated. OFDM being a part of many existing and upcoming broadband access technologies such as WLAN, LTE, DVB, this analogy is motivated. On the hardware aspect, the proposed architecture can accommodate both OFDM and FTN systems. The processing blocks in transmitter and receiver were designed for reuse and carry out different functions in the transceiver. Furthemore, the hardware could be configured to operate at varying bandwidth efficiencies (by FTN signaling) to exploit the channel conditions. The decoder implementation also considered block sizes and data rates to comply with the 3GPP standard. The decoding is carried out in as few as 8 iterations making it more practical for implementation in power constrained mobile devices. The decoder is implemented in 65nm CMOS process and occupies a total chip area of 0.8mm2.

关键词： 3G mobile communication 3GPP standard Bandwidth CMOS integrated circuits CMOS process decoding Hardware Iterative decoding Nyquist orthogonality limit OFDM OFDM based multicarrier system OFDM modulation Receivers Transmitters bandwidth efficiency broadband access technologies decoding complexity faster-than-Nyquist faster-than-Nyquist signaling multicarrier systems hardware implementation interference-free transmission iterative decoder iterative decoding iterative decoding multicarrier FTN signaling power-constrained mobile devices processing blocks silicon implementation size 65 nm system design transceiver

来源：评论

学校读者我要写书评

暂无评论

Rateless Codes for Slant Path Free Space Optical Channels

Rateless Codes for Slant Path Free Space Optical Channels

引用

Globecom Workshops

作者： Liu, Ling Dang, Anhong Guo, Hong Peking Univ Sch Elect & Comp Sci Beijing 100871 Peoples R China

ISBN: (纸本)9781424488650

The application of packet-level rateless codes for slant path free space optical (FSO) links is studied. From the compromise between the code rate and decoding complexity, the raptor codes with moderate block length is considered and the corresponding coding scheme is presented. Two decoding strategies are discussed: maximum-likelihood (ML) decoding and erasure decoding. The decoding performance for these two decoding strategies is compared by calculating their error exponents, and erasure decoding is illustrated to work better in view of reliability. Numerical results indicate that our considered rateless codes with such erasure decoding can always automatically achieve the code rate very close to channel capacity for the slant path FSO links.

关键词： block codes block length channel capacity channel capacity code rate coding scheme decoding complexity decoding performance erasure decoding maximum likelihood decoding maximum-likelihood decoding optical links packet-level rateless code raptor code relia

来源：评论

学校读者我要写书评

暂无评论

Segment Linear Network Coding in Wireless Sensor Networks

Segment Linear Network Coding in Wireless Sensor Networks

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Guo, Yijun Hao, Jianjun Yue, Guangxin Beijing Univ Posts & Telecommun Beijing Key Lab Network Syst Architecture & Conve Beijing 100088 Peoples R China

ISBN: (纸本)9781467359399;9781467359382

Wireless sensor network (WSN) has attracted a lot of interest for its wide range of practical applications. The energy-resource limitation of WSN demands transmissions between sensor nodes to be high efficiency. Random linear network coding (RLNC) exploits the broadcast and distributed nature of WSN to improve the throughput of network. The throughput gain brought by RLNC grows up as the generation size increased, while the decoding complexity has a cubic growth, being unacceptable for the energy-resource limited WSN. In this paper, we propose a segment linear network coding (SLNC) scheme which reduces the decoding complexity dramatically through adding constraints to the encoding coefficients and dividing a complex matrix inverse operation into several simple ones at receiver. Proved by theoretical analysis and simulation results, we show that SLNC achieves a fairly low decoding complexity with seldom increase on the overhead of network.

关键词： Segment linear network coding wireless sensor network decoding complexity extra transmission cost

来源：评论

学校读者我要写书评

暂无评论

Low complexity Multi-level NB-QC-LDPC Coded Modulation Scheme for Optical Communication Systems 17

Low Complexity Multi-level NB-QC-LDPC Coded Modulation Schem...

引用

17th International Conference on Optical Communications and Networks (ICOCN)

作者： Wang, Dongdong Sun, Chenhua Wang, Liqian Chen, Xue Guo, Yantao Jia, Guannan Li, Yong Wang, Yang Sci & Technol Commun Networks Lab Shijiazhuang 050081 Hebei Peoples R China China Elect Technol Grp Corp Res Inst 54 Shijiazhuang 050081 Hebei Peoples R China Beijing Univ Posts & Telecommun State Key Lab Network & Switching Technol Beijing 100876 Peoples R China

ISBN: (数字)9781510627710

ISBN: (纸本)9781510627710

In this paper, we propose a multi-level non-binary quasi-cyclic low density parity check (NB-QC-LDPC) coded modulation (CM) scheme to reduce the decoding complexity while maintaining and/or exceeding the super BER performance of the traditional NB-QC-LDPC CM scheme. Firstly, local optimal searching combined with the classical superposition construction is proposed to construct the required NB-QC-LDPC codes with possibly enlarged girth and less number of the shortest cycles. Secondly, by analyzing the changing trend of the BER performance and decoding complexity of the NB-QC-LDPC code defined over GF(Q) incident to Q. We find that the decoding complexity increases proportionally with the increase of Q, but the best BER performance usually corresponds to a smaller Q. Finally, by replacing the high-order NB-QC-LDPC code based CM scheme to the multi-level low-order NB-QC-LDPC code based CM scheme, the decoding complexity can be effectively reduced. Simulation results show that the designed two-level GF. (4)/GF (8) QC-LDPC code based 16QAM/64QAM CM system can perform almost the same or even better BER performance with/than the corresponding traditional GF(16) / GF (64) QC-LDPC code based 16QAM/64QAM CM system.

关键词： Optical communication coded modulation NB-QC-LDPC code decoding complexity

来源：评论

学校读者我要写书评

暂无评论

Energy-Quality-aware Variable Framerate Pareto-Front for Adaptive Video Streaming

Energy-Quality-aware Variable Framerate Pareto-Front for Ada...

引用

2024 Conference on Visual Communications and Image Processing

作者： Rajendran, Prajit T. Afzal, Samira Menon, Vignesh V. Timmerer, Christian Univ Paris Saclay List CEA F-91120 Palaiseau France Alpen Adria Univ Christian Doppler Lab ATHENA Inst Informat Technol ITEC Klagenfurt Austria Fraunhofer HHI Video Commun & Applicat Dept Berlin Germany

ISBN: (纸本)9798331529543;9798331529550

Optimizing framerate for a given bitrate-spatial resolution pair in adaptive video streaming is essential to maintain perceptual quality while considering decoding complexity. Low framerates at low bitrates reduce compression artifacts and decrease decoding energy. We propose a novel method, decoding-complexity aware Framerate Prediction (DECODRA), which employs a Variable Framerate Pareto-front approach to predict an optimized framerate that minimizes decoding energy under quality degradation constraints. DECODRA dynamically adjusts the framerate based on current bitrate and spatial resolution, balancing trade-offs between framerate, perceptual quality, and decoding complexity. Extensive experimentation with the Inter-4K dataset demonstrates DECODRA's effectiveness, yielding an average decoding energy reduction of up to 13.45%, with minimal VMAF reduction of 0.33 points at a low-quality degradation threshold, compared to the default 60 fps encoding. Even at an aggressive threshold, DECODRA achieves significant energy savings of 13.45% while only reducing VMAF by 2.11 points. In this way, DECODRA extends mobile device battery life and reduces the energy footprint of streaming services by providing a more energy-efficient video streaming pipeline.

关键词： Adaptive video streaming decoding complexity Framerate optimization Perceptual quality decoding energy consumption

来源：评论

学校读者我要写书评

暂无评论

Interleaved LDPC Codes, Reduced-complexity Inner Decoder and an Iterative Decoder for the Davey-MacKay Construction

Interleaved LDPC Codes, Reduced-Complexity Inner Decoder and...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Jiao, Xiaopeng Armand, Marc A. Natl Univ Singapore Dept Elect & Comp Engn Commun & Informat Engn Grp Singapore 117576 Singapore

ISBN: (纸本)9781457705953

The inner decoder of the Davey-MacKay (DM) construction for combating insertions, deletions and substitution errors, has high complexity and produces bursts of output likelihoods of greatest uncertainty in the vicinity of insertions and deletions. We therefore propose (i) a lookup-table-based implementation of the inner decoder to reduce its complexity, (ii) the use of interleaved LDPC codes as outer codes in the DM construction to spread the uncertain likelihoods produced by the inner decoder over several constituent LDPC codewords. Simulation results show that the proposed lookup table approach reduces the complexity of the inner decoder considerably while a significant improvement in frame error rate (FER) performance can be obtained with small interleaving depths. Our lookup table approach culminates in an iterative decoding scheme which yields improved FER performance over its non-iterative counterparts, yet with only a modest increase in decoding complexity, when the insertion/deletion probability is small.

关键词： complexity theory Davey-MacKay construction decoding Delta modulation Iterative decoding LDPC codewords Synchronization decoding complexity frame error rate insertion/deletion probability interleaved LDPC codes interleaved codes iterative decoder iterative decoding lookup-table parity check codes probability reduced-complexity inner decoder table lookup uncertain likelihoods

来源：评论

学校读者我要写书评

暂无评论

Partitioned bus coding for energy reduction 05

Partitioned bus coding for energy reduction

引用

10th Asia and South Pacific Design Automation Conference

作者： Xie, Lin Qiu, Peiliang Qiu, Qinru Zhejiang Univ Dept Informat Sci & Elect Engn Hangzhou 310027 Peoples R China

ISBN: (纸本)0780387368

For VLSI design in deep submicron technology, the bus energy reduction has become more and more important. This paper studies the bus partition scheme for the Transition Pattern Coding (TPC). The genetic algorithm based approach is used. A closed-form expression is derived to calculate the energy dissipation for the partitioned bus with TPC coding. A general bus model with coupling capacitance is considered during the energy estimation and optimization. The resulted partitioned bus coding reduces the encoding and decoding complexity of the original TPC. The experimental results show that the TPC with careful bus partitioned saves up to 16.9% the energy of the TPC with random bus partition.

关键词： VLSI system buses encoding genetic algorithms low-power electronics partitioned bus coding VLSI design deep sub micron technology bus energy reduction transition pattern coding genetic algorithm energy dissipation bus model coupling capacitance energy estimation energy optimization encoding complexity decoding complexity

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共18页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：