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

IEEE Information Theory Workshop (ITW)

作者： Deshpande, Yash Pillai, Sibi Raj B. Dey, Bikash K. Indian Inst Technol Dept Elect Engn Bombay 400076 Maharashtra India

ISBN: (纸本)9781457704376

We consider the problem of finding optimal, fair and distributed power-rate strategies to achieve the sum capacity of the Gaussian multiple-access block-fading channel. The transmitters have access to only their own fading coefficients, while the receiver has access to all of the fading coefficients. We propose a distributed strategy called the 'midpoint' strategy which is optimal when the system cannot tolerate outage. In addition, we demonstrate a successive decoding scheme that can achieve this maximal sum-rate. In presence of outage, we show that the strategies based on a single threshold are suboptimal.

关键词： decoding Fading Gaussian channels Gaussian multiple-access block-fading channel Radio transmitters Receivers Throughput decoding decoding scheme distributed power-rate strategy distributed strategy fading channels individual side information midpoint stra

来源：评论

学校读者我要写书评

暂无评论

Joint Network and Channel Coding for Cooperative Networks

Joint Network and Channel Coding for Cooperative Networks

引用

Australasian Telecommunication Networks and Applications Conference

作者： Johnson, Sarah J. Kellett, Christopher M. Univ Newcastle Sch Elect Engn & Comp Sci Callaghan NSW 2308 Australia

ISBN: (纸本)9781424415571

In this paper we propose joint network and channel coding schemes for cooperative networks. The joint decoding schemes require no adjustment to either the sending or intermediary network nodes, but are achieved by describing joint network code / channel code Tanner graphs at the receiving node and applying iterative sum-product decoding. The performance of the proposed schemes are simulated on a simple "butterfly" network and very promising results are obtained.

关键词： Channel coding receiving node labeling scheme Network Code Network decoding scheme send network node

来源：评论

学校读者我要写书评

暂无评论

Achieving the Han-Kobayashi inner bound for the quantum interference channel 2012

Achieving the Han-Kobayashi inner bound for the quantum inte...

引用

IEEE International Symposium on Information Theory

作者： Sen, Pranab Tata Inst Fundamental Res Sch Technol & Comp Sci Mumbai 400005 Maharashtra India

ISBN: (纸本)9781467325790

We construct an encoding and decoding scheme achieving the Chong-Motani-Garg inner bound [1] for a two sender two receiver interference channel with classical input and quantum output. This automatically gives a similar inner bound for sending classical information through an interference channel with quantum inputs and outputs without entanglement assistance. Our result matches the best known inner bound for the interference channel in the classical setting. Achieving the Chong-Motani-Garg inner bound, which is known to be equivalent to the Han-Kobayashi inner bound [3], answers an open question raised recently by Fawzi et al. [4]. Our encoding strategy is the standard random encoding strategy. Our decoding strategy is a sequential strategy where a receiver loops through all candidate messages trying to project the received state onto a 'typical' subspace for the candidate message under consideration, stopping if the projection succeeds for a message, which is then declared as the guess of the receiver for the sent message. On the way to our main result, we show that random encoding and sequential decoding strategies suffice to achieve rates up to the mutual information for a single sender single receiver channel, and the standard inner bound for a two sender single receiver multiple access channel, for channels with classical input and quantum output. Besides conceptual simplicity, a sequential decoding strategy is space efficient, and may have additional efficiency advantages in some settings. We prove our inner bounds using two new technical tools-a non-commutative union bound to analyse the decoding error probability, and a geometric notion of approximate interesection of two conditionally typical subspaces.

关键词： sequential decoding Guess Interference channels decoding scheme Error probability quanta encoding strategy Bound Receivers

来源：评论

学校读者我要写书评

暂无评论

Memory Sharing Techniques for Multi-standard High-throughput FEC Decoder 14

Memory Sharing Techniques for Multi-standard High-throughput...

引用

International Conference on Embedded Computer Systems - Architectures, Modeling, and Simulation (SAMOS)

作者： Wu, Zhenzhi Liu, Dake Beijing Inst Technol Sch Informat & Elect Beijing 100081 Peoples R China Linkoping Univ Dept Elect Engn SE-58183 Linkoping Sweden

ISBN: (纸本)9781479937707

Nowadays multi-standard wireless baseband, Convolutional Code (CC), Turbo code and LDPC code are widely applied and need to be integrated within one FEC module. Since memory occupies half or even more area of the decoder, memory sharing techniques for area saving purpose is valuable to consider. In this work, several memory merging techniques are proposed. A non-conflict access technique for merged path metric buffer is proposed. The results show that 41% of total memory bits are saved when integrating three different decoding schemes including CC (802.11a/g/n), LDPC (802.11n and 802.16e) and Turbo (3GPP-LTE). Synthesis result with 65nm process shows that the merged memory blocks consume merely 1.06mm(2) of the chip area.

关键词： low density parity check codes memory block FEC Regimen decoders Memory Memory Access to technology decoding scheme

来源：评论

学校读者我要写书评

暂无评论

Symbol-Asynchronous Compute-and-Forward

Symbol-Asynchronous Compute-and-Forward

引用

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

作者： Najafi, Hossein Damen, Mohamed Oussama Hjorungnes, Are Univ Waterloo Dept Elect & Comp Engn Waterloo ON Canada Univ Oslo UNIK Univ Grad Ctr Oslo Norway

ISBN: (纸本)9781457713484

The impact of symbol-asynchronism on compute-and-forward strategy in relay networks is considered. The lattice-based coding and decoding scheme presented recently by Nazer and Gastpar is applied over asynchronous distributed networks. While the key idea in compute-and-forward is to decode a linear combination of the transmitted codewords, due to distributed nature of the network, the relays receive random asynchronous versions of the combinations. It is shown that by using a simple equalizer as a part of the signaling scheme, one can transform the system to a synchronous one albeit with a smaller channel gain. The effect of asynchronism on the achievable rates is also studied, which implies a loss compared to the synchronous case. However, the resulting gap vanishes as the signal-to-noise-ratio (SNR) increases.

关键词： decoding Delay Equations Mathematical model Relays SNR Transmitters Vectors asynchronous distributed network compute-and-forward strategy decoding decoding scheme encoding equalisers equalizer interference (signal) lattice-based coding relay network signal-to-noise-ratio signaling scheme symbol-asynchronism

来源：评论

学校读者我要写书评

暂无评论

Color image encryption using TSRSC associated with DWT 5

Color image encryption using TSRSC associated with DWT

引用

5th International Conference on Confluence - The Next Generation Information Technology Summit (Confluence)

作者： Singh, Abhishek Banaras Hindu Univ Fac Sci DST Ctr Interdisciplinary Math Sci Varanasi 221005 Uttar Pradesh India

ISBN: (纸本)9781479942367

With an abridged introductory note on the discrete wavelet transform (DWT) and random shift cipher (RSC), this paper attempts to study a technique for color image encoding and decoding scheme using two stage random shift cipher (TSRSC) associated with DWT. In this approach, keys and the arrangement of RSC parameters are compulsory. The formula for total number of keys in encoding process of color image is given. The capability of this proposed technique can be analyse by conclusion.

关键词： Ciphers Color decoding Discrete wavelet transforms Encoding Encryption Image coding discrete wavelet transform cryptography image coding color image decoding Passwords Keys Keys Cays decoding scheme coding Cipher

来源：评论

学校读者我要写书评

暂无评论

Combining Interference Alignment and Alamouti Codes for Quasi-Static MIMO X Channel

Combining Interference Alignment and Alamouti Codes for Quas...

引用

18th Asia-Pacific Conference on Communications (APCC) - Green and Smart Communications for IT Innovation

作者： Jin, Dong-Sup Kim, Jae-Hong No, Jong-Seon Seoul Natl Univ Dept Elect Engn & Comp Sci Seoul 151742 South Korea

ISBN: (纸本)9781467347280

In this paper, a new combining scheme of interference alignment and Alamouti codes is proposed for the quasistatic MIMO K x 2 X channel. In fact, a brilliant scheme was already proposed in [1] for 2x2 MIMO X channel. However, it is difficult to extend for more general case. Therefore, for K x 2 MIMO X channel, a simple transmission and decoding schemes is proposed in this paper. The transmission scheme is based on the interference alignment concept and Alamouti-code and the decoding scheme exploits the zero-forcing and decoupling method of two Alamouti-codes.

关键词： decoding scheme multiple input multiple output systems Decoupling method Codes Alignment interference interference

来源：评论

学校读者我要写书评

暂无评论

A Novel Circuit to Optimize Access Time and decoding schemes in Memories

A Novel Circuit to Optimize Access Time and Decoding Schemes...

引用

International Conference on VLSI Design

作者： Sanjeev Kumar Jain Krishna Srivastva Sanjiv Kainth R&D group Virage Logic

ISBN: (纸本)9781424455416

As the microprocessor speed increases from 500MHz to IGHz and beyond, SOC designers are forced to innovate new schemes in their use of cache memory for high speed access. In this paper, clock to wordline path delay is optimized using a novel circuit design technique. Using this novel circuit, clock to word line path delay is optimized by 2.5 times at worst case corner. For a typical memory instance frequently used in cache memories) whose access time is of the order of 800ps and where read and write operation occurs in the same clock cycle, overall access time is improved by 18% at worst case corner. For this case, write margin is improved by 2.26 times at worst case corner for write operation. A decoding scheme is also discussed in this paper which describes how to choose the best pre-decoding and post-decoding schemes based on minimum pre-decoded lines, minimum stack size in post decoder and maximum granularity of x-decoders.

关键词： Storage access times write operation corners decoding scheme design techniques clock cycle decoders Memory Cache memory

来源：评论

学校读者我要写书评

暂无评论

Statistical-mechanics approach to wide-band digital communication

引用

Physical Review E 2010年第6期82卷 060101(R)-060101(R)页

作者： Hadar Efraim Yitzhak Peleg Ido Kanter Ori Shental Yoshiyuki Kabashima Department of Computational Intelligence and Systems Science Tokyo Institute of Technology Yokohama 2268502 Japan

The emerging popular scheme of fourth generation wireless communication, orthogonal frequency-division multiplexing, is mapped onto a variant of a random field Ising Hamiltonian and results in an efficient physical intercarrier interference (ICI) cancellation decoding scheme. This scheme is based on Monte Carlo (MC) dynamics at zero temperature as well as at the Nishimori temperature and demonstrates improved bit error rate (BER) and robust convergence time compared to the state of the art ICI cancellation decoding scheme. An optimal BER performance is achieved with MC dynamics at the Nishimori temperature but with a substantial computational cost overhead. The suggested ICI cancellation scheme also supports the transmission of biased signals.

关键词： ICI scheme bit error rate performance zero temperature Digital communication CANCELLATIONS decoding scheme state of the art

来源：评论

学校读者我要写书评

暂无评论

Serial concatenation of space-time and recursive convolutional codes

引用

ETRI JOURNAL 2003年第2期25卷 144-147页

作者： Ko, YJ Kim, JI ETRI Basic Res Lab Taejon South Korea ETRI Mobile Telecommun Res Lab Taejon South Korea

We propose a new serial concatenation seheme for space-time and recursive convolutional codes, in which a space-time code is used as the outer code and a single recursive convolutional code as the inner code. We discuss previously proposed serial concatenation schemes employing multiple inner codes and compare them with the new one. The proposed method and the previous one with joint decoding, both performing a combined decoding of the simultaneous output signals from multiple antennas, give a large performance gain over the separate decoding method. In decoding complexity, the new concatenation scheme has a lower complexity compared with the multiple encoding/joint decoding scheme due to the use of the single inner coded Simulation results for a communication system with two transmit and one receive antennas in a quasi-static Rayleigh fading channel show that the proposed scheme outperforms the previous schemes.

关键词： space-time codes Serial Publications decoding Codes scheme decoding scheme Recursive COMMUNICATION SYSTEMS multiple antenna convolutional coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：