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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

22 篇 期刊文献
16 篇 会议

馆藏范围

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

日期分布

学科分类号

37 篇 工学
- 27 篇 电气工程
- 16 篇 信息与通信工程
- 10 篇 计算机科学与技术...
- 8 篇 电子科学与技术（可...
- 4 篇 机械工程
- 4 篇 软件工程
- 3 篇 交通运输工程
- 1 篇 仪器科学与技术
- 1 篇 控制科学与工程
- 1 篇 测绘科学与技术
- 1 篇 航空宇航科学与技...
3 篇 理学
- 3 篇 数学
1 篇 医学
- 1 篇 临床医学

主题

38 篇 coding rate
6 篇 encoding
5 篇 error statistics
4 篇 radio links and ...
4 篇 codes
3 篇 ofdm modulation
3 篇 channel capacity
3 篇 bit error rate
3 篇 decoding
2 篇 capacity
2 篇 reed solomon cod...
2 篇 computational co...
2 篇 error correction...
2 篇 minimum free dis...
2 篇 multiple access ...
2 篇 redundancy
2 篇 turbo codes
2 篇 interference
2 篇 coding efficienc...
2 篇 ofdm

机构

2 篇 faculty of engin...
1 篇 university of ot...
1 篇 south cent univ ...
1 篇 information engi...
1 篇 princeton univ d...
1 篇 kogakuin univ gr...
1 篇 laboratory of wi...
1 篇 korea adv inst s...
1 篇 univ erlangen nu...
1 篇 michigan state u...
1 篇 univ minnesota m...
1 篇 natl cent univ d...
1 篇 fuyang normal un...
1 篇 georgia inst tec...
1 篇 moscow tech univ...
1 篇 univ tsukuba gra...
1 篇 klagenfurt univ ...
1 篇 department of in...
1 篇 freescale semico...
1 篇 dept. of c.s. & ...

作者

2 篇 tanaka h
1 篇 ke liu zhichun m...
1 篇 adzhemov a. s.
1 篇 marchand c.
1 篇 yagi hideki
1 篇 li dawei
1 篇 hong jinwoo
1 篇 cui yongqiang
1 篇 van zyl robert
1 篇 hanzo l
1 篇 artigue cedric
1 篇 misra kiran
1 篇 poor h. vincent
1 篇 chen jong-shin
1 篇 balyan vipin
1 篇 mehrabi mehrad
1 篇 zhou xiangwei
1 篇 iwata ken-ichi
1 篇 ku meng-lin
1 篇 gupta gunjan

语言

36 篇 英文
2 篇 其他

检索条件"主题词=coding rate"

共 38 条记录，以下是21-30 订阅

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

详细简洁

排序：

MultiBand-OFDM system with concatenated coding scheme

MultiBand-OFDM system with concatenated coding scheme

引用

65th IEEE Vehicular Technology Conference

作者： Sato, Hiroyuki Ohtsuki, Tomoaki Kashima, Tsuyoshi Jarot, Sigit Tokyo Univ Sci Grad Sch Sci & Technol Tokyo 162 Japan Keio Univ Dept Informat & Comp Sci Tokyo 108 Japan Nokia Japan Co LTD Tokyo Japan

ISBN: (纸本)9781424402656

Among new technologies, Ultra Wideband (UWB) is gathering interests as a short-reach transmission system. At present, as one of the prevailing UWB systems, the MultiBand - orthogonal frequency division multiplexing (MB-OFDM) system has attracted much attention where convolutional code (CC) is used. The main contribution of this paper is to evaluate the bit error rate (BER) and decoding complexity performances of MB-OFDM with concatenated coding scheme and Dual Carrier Modulation (DCM) on IEEE 802.15.3a UWB multipath channel model. We employ the CC for the inner code and the Reed Solomon (RS) code for the outer code in the concatenated coding scheme. From the results of our computer simulation, we show good combination of coding rates in the concatenated coding scheme at the data rates of about 320, 400 480 Mbps. We also show that MB-OFDM with concatenated coding scheme can achieve the better BER than MB-OFDM with only CC. In addition, we show that the BER improvement of MB-OFDM with concatenated coding scheme over that with only CC becomes larger as the data rate becomes higher.

关键词： MB-OFDM convolutional code Reed Solomon code coding rate

来源：评论

学校读者我要写书评

暂无评论

Practical Self-repairing Codes for Distributed Storage

Practical Self-repairing Codes for Distributed Storage

引用

IEEE Asia Pacific Cloud Computing Congress

作者： Hou, Hanxu Li, Hui Peking Univ Shenzhen Grad Sch Shenzhen Key Lab Cloud Comp Technol & Applicat Shenzhen Peoples R China

ISBN: (纸本)9781467329040

In distributed storage systems, projective geometric self-repairing codes (PSRC) are able to provide a repair mechanism, which can repair a failed node with only two nodes. However, the redundancy of PSRC is extremely large, which makes PSRC unpractical for distributed storage systems. In this paper, we propose a new family of self-repairing codes called practical projective geometric self-repairing codes (PPSRC), which is a generalization of PSRC. PPSRC allow tradeoff between the coding rate and self-repairing capacity, while possess the basic property of PSRC. In addition, we provide an evolutionary repairing process for PPSRC, of which the repairing bandwidth is less than both the repairing process in [5] and that of the minimal storage repair codes (MSR) [3]. Furthermore, we present the general reconstruction process of PPSRC and the reconstruction process is optimal in terms of downloading bandwidth. Finally, we demonstrate PPSRC surpass the existing erasure coding strategies in terms of complexity, repairing nodes, repairing bandwidth and self-repairing capacity, which makes the PPSRC very attractive for distributed storage systems.

关键词： self-repairing codes distributed storage coding rate self-repairing capacity complexity

来源：评论

学校读者我要写书评

暂无评论

Mellin transforms for TCP throughput with applications to cross layer optimization

Mellin transforms for TCP throughput with applications to cr...

引用

40th Annual Conference on Information Sciences and Systems (CISS)

作者： Baccelli, Francois McDonald, David R. INRIA-ENS University of Ottawa

In this survey paper, we review recent results on a class of partial differential equations associated with the dynamics of TCP. We show how to use the closed form solutions obtained for them via Mellin transforms in ... 详细信息

ISBN: (纸本)1424403499

关键词： TCP congestion control flow control additive increase-multiplicative decrease algorithm IP traffic HTTP throughput coding rate processing gain synchronization

来源：评论

学校读者我要写书评

暂无评论

Analysis of Cooperative HARQ with Opportunistic Routing

Analysis of Cooperative HARQ with Opportunistic Routing

引用

IEEE 14th Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

作者： Rajanna, Amogh Kaveh, Mostafa Univ Minnesota Minneapolis MN 55455 USA

ISBN: (纸本)9781467355773

In this paper, we do performance analysis of the cooperative HARQ protocol in a wireless adhoc multihop network employing spatial ALOHA. We model the nodes in such a network by a homogeneous 2-D Poisson point process. We study the tradeoff between the transport capacity submetrics inherent in the network when using cooperative HARQ protocol and opportunistic routing by optimizing the transport capacity w.r.t the network design parameters, coding rate and medium access probability. Using approximations, we obtain an analytic expression for the expected progress of opportunistic routing. By way of numerical results, we show that the network design parameters obtained by optimizing the analytic expression of transport capacity closely follows that of Monte Carlo based exact transport capacity optimization.

关键词： Cooperative HARQ Transport Capacity MAP PPP coding rate

来源：评论

学校读者我要写书评

暂无评论

coding STrateGIES FOR CDMA PACKET DATA NETWORKS WITH REDUCED RANK MULTIUSER DETECTION, ARQ AND PACKET COMBINING.

CODING STRATEGIES FOR CDMA PACKET DATA NETWORKS WITH REDUCED...

引用

9th IEEE Workshop on Signal Processing Advances in Wireless Communications

作者： Mouhouche, Belkacem Artigue, Cedric Freescale Semicond F-31023 Toulouse 1 France

ISBN: (纸本)9781424420452

Reduced-rank Code Division Multiple Access (CDMA) multiuser detection has received a lot of attention recently. The output SINR provided by a reduced-rank receiver depends on the filter rank and is confined between the SINRs of the Single User Matched Filter (SUMF) and the Minimum Mean Squared Error (MMSE) receiver. In Packet CDMA data networks like HSDPA, the measure of performance is the throughput. Thus, previous results on reduced-rank MMSE receivers SINR cannot be used directly. In this paper, we study the throughput of CDMA Data networks using reduced-rank MMSE receivers, Automatic retransmission request (ARQ) and Packet Combining. We derive the expression of the system throughput as the function of the filter rank, the coding rate and the number of retransmissions. We present simulation results to highlight the behavior of the maximum throughput as a function of the filter rank and the coding rate. We then conclude on coding strategies to adopt depending on the signal to noise ratio and the receiver rank in order to maximize the system throughput.

关键词： Reduced Rank MMSE Filtering CDMA Packet Data Network coding rate

来源：评论

学校读者我要写书评

暂无评论

A New Characterization of the Capacity Region of Identification Systems Under Noisy Enrollment 54

A New Characterization of the Capacity Region of Identificat...

引用

54th Annual Conference on Information Sciences and Systems (CISS)

作者： Yachongka, Vamoua Yagi, Hideki Univ Electrocommun Dept Comp & Network Engn Tokyo Japan

ISBN: (纸本)9781728140841

The fundamental limits of two common models: generated and chosen secret models in biometric identification systems with exponentially many users are considered. Recently, Yachongka and Yagi (2019) characterized the capacity region among identification, secrecy, template, and privacy-leakage rates for the generated secret model via two auxiliary random variables. In this study, we provide an alternative characterization of the capacity regions of these rates for the generated secret model by a single auxiliary random variable. Compared to the proof approach in the previous study, the basic idea is that we have changed the achievability scheme, which fits the technique employing only one auxiliary random variable, and introduce a partial decoder, estimating only the secret key of users, to deal with evaluating the privacy-leakage rate in the achievability proof. We further apply the proof method of the generated secret model to characterize the capacity region for the chosen secret model. As special cases, the characterizations naturally reduce to the result given by Ignatenko and Willems (2015) when the enrollment channel is noiseless and there is no constraint on the template rate, and also correspond to the result given by Gunlu and Kramer (2018) when there is only one user.

关键词： Biometric identification system capacity region secrecy-leakage privacy-leakage coding rate

来源：评论

学校读者我要写书评

暂无评论

Signal De-multiplexing in Branch Metric Calculation for Spatially Multiplexed MIMO System

Signal De-multiplexing in Branch Metric Calculation for Spat...

引用

IEEE 75th Vehicular Technology Conference (VTC Spring)

作者： Sanada, Yukitoshi Keio Univ Dept Elect & Elect Engn Yokohama Kanagawa 2238522 Japan

ISBN: (纸本)9781467309905;9781467309882

This paper presents a signal de-multiplexing scheme in branch metric calculation of soft decision decoding for a spatially multiplexed MIMO system. In a conventional MIMO system, de-multiplexing is carried out over the symbols received by multiple antenna elements and is separated from decoding. Therefore, the de-multiplexing requires multiple uncorrelated antenna elements in order to realize a full rank channel matrix. This leads to the limitation of the system capacity by the number of the receive antenna elements. Instead of splitting de-multiplexing and decoding, in this paper, a de-multiplexing scheme at branch metric calculation in soft decision decoding is proposed. Based on ideal interleaving, independence among the coded symbols is assumed. Thus, the full rank channel matrix with the size of minimum free distance can be realized for signal de-multiplexing. As examples of the proposed system, the performance of repetition codes, block codes, and convolutional codes with MMSE de-multiplexing and soft decision Viterbi decoding on a Rayleigh fading channel is investigated. It is shown through numerical analysis that a lower BER can be achieved with a larger minimum free distance for the same normalized transmission rate that is given as the product of the coding rate and the number of multiplexed signal streams.

关键词： MIMO Channel Capacity coding rate Minimum Free Distance

来源：评论

学校读者我要写书评

暂无评论

Low-Complexity Spectrum Shaping for OFDM-based Cognitive Radios

Low-Complexity Spectrum Shaping for OFDM-based Cognitive Rad...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Zhou, Xiangwei Li, Geoffrey Ye Sun, Guolin Georgia Inst Technol Sch ECE Atlanta GA 30332 USA Huawei Technol Sweden Kista Sweden

ISBN: (纸本)9781612842547

Cognitive radio (CR) technology provides great flexibility in spectrum utilization with orthogonal frequency-division multiplexing (OFDM) as its candidate transmission technique. In this paper, we propose a simple spectrum shaping scheme for OFDM-based CRs to enhance spectral compactness and ensure bandwidth efficiency. By mapping antipodal symbol pairs onto adjacent subcarriers at the edges of the utilized spectrum band, our scheme enables fast power spectral sidelobe decaying without bringing much extra complexity to the transmitter or receiver. Sidelobe suppression and system throughput can be well balanced by adjusting the coding rate while power control on different sets of subcarriers will further deepen the sidelobes. The proposed scheme is also validated by our simulation.

关键词： Bit error rate Decoding Encoding Interference OFDM OFDM modulation OFDM-based cognitive radio Power control Receivers adjacent subcarrier antipodal symbol pair bandwidth efficiency candidate transmission technique coding rate cognitive radio low complexity spectrum shaping scheme orthogonal frequency division multiplexing power control power spectral sidelobe suppression radio receiver radio receivers radio spectrum management radio transmitter radio transmitters spectral compactness spectrum band spectrum utilization subcarrier multiplexing

来源：评论

学校读者我要写书评

暂无评论

Scaling Law Based D2D Wireless Ad-Hoc Networks in the Finite Blocklength Regime

Scaling Law Based D2D Wireless Ad-Hoc Networks in the Finite...

引用

IEEE Global Communications Conference (GLOBECOM)

作者： Zhang, Xi Zhu, Qixuan Poor, H. Vincent Texas A&M Univ Dept Elect & Comp Engn Networking & Informat Syst Lab College Stn TX 77843 USA Princeton Univ Dept Elect Engn Princeton NJ 08544 USA

ISBN: (纸本)9781728109626

A device-to-device (D2D) wireless ad hoc network architecture enables dynamic self-organizing communications among mobile users who can directly exchange information with their peers without a pre-determined network infrastructure. Moreover, finite blocklength coding (FBC) is the promising candidate technique to support time sensitive multimedia wireless networks services, where mobile users transmit short packets to upper-bound the transmission delay of video/audio traffic. The scaling law technique models the maximum D2D channel capacity as a function of the density of mobile users. Recent studies have integrated D2D wireless ad hoc networks with FBC theory to further improve the performance of 5G wireless ad hoc networks. However, how to model and analyze the capacity of D2D wireless ad hoc networks under the finite blocklength regime is not well understood and has not been thoroughly studied. To overcome these challenges, applying the scaling law technique, we derive upper-bounds on the coding rate of each D2D channel and the number of time slots needed to complete all D2D transmissions. Combining the D2D channel's coding rate with the number of time slots needed for all D2D transmissions, we derive the maximum aggregate throughput for wireless ad hoc networks with all mobile users using D2D communications while mitigating interference. We also develop a model where each D2D channel follows the Nakagami-m distribution, under which we derive the average aggregate throughput and its upper-bound. Finally, we evaluate our derived results in the D2D wireless ad hoc networks over finite blocklength regime through numerical analyses.

关键词： D2D communications scaling law ad-hoc wireless networks finite blocklength coding theory coding rate information density mutual information rate aggregate throughput

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of OFDM-based 256-and 1024-QAM in Multipath Fading Propagation Conditions 9

Performance Evaluation of OFDM-based 256-and 1024-QAM in Mul...

引用

9th International Conference on Ubiquitous and Future Networks (ICUFN)

作者： Ota, Tomoki Nakamura, Mitsutoshi Otsuka, Hiroyuki Kogakuin Univ Grad Sch Engn 1-24-2 Shinjuku Ku Tokyo 1638677 Japan

ISBN: (纸本)9781509047499

The use of higher-order modulation is an important approach for increasing data rates within a limited bandwidth. In this paper, we demonstrate the performance of the orthogonal frequency division multiplexing (OFDM)-based 256- and 1024-QAM in multipath fading propagation conditions by link-level simulation, as well as under static propagation condition. The BER performance is investigated for two types of propagation models, i.e., "extended pedestrian A" and "extended vehicular A" models, specified by 3GPP as parameters of the coding rates. Using these results, we validate the application of OFDM-based 256- and 1024-QAM to mobile communication systems.

关键词： Mobile communication OFDM 256/1024-QAM EPA EVA coding rate Multipath fading

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共4页 << < 1 2 3 4 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：