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

Achievable rates of Gaussian two-way relay channel with orthogonal components and partial decoding at relay

ELECTRONICS LETTERS 2016年第3期52卷 200-201页

作者： Al-qudah, Z. Al Hussein Bin Talal Univ Commun Engn Maan Jordan

A novel two-phase practical transmission scheme is proposed to exchange messages between the two users composing the two-way relay channel. These two phases are the listening phase and the dynamic decode-and-forward phase. Then, the achievable rate region is derived in the case that the two users transmit and receive over orthogonal frequency bands. Some numerical results are obtained to confirm the theoretical results.

关键词： orthogonal frequency bands partial decoding dynamic decode-and-forward phase achievable rate region Gaussian two-way relay channel Radio links and equipment Codes Gaussian channels relay networks (telecommunication) decode and forward communication two-phase practical transmission scheme decoding orthogonal components listening phase

来源：评论

学校读者我要写书评

暂无评论

Symmetric relaying based on partial decoding and the capacity of a class of relay networks

引用

IET COMMUNICATIONS 2009年第1期3卷 151-159页

作者： Ghabeli, L. Aref, M. R. Sharif Univ Technol Dept Elect Engn ISSL Tehran Iran

Symmetric relaying is a method of relaying in which the relays can decode the message of other relays in the network in addition to the source message. In this paper an achievable rate is presented for a symmetric two-relay network based on partial decoding. The strategy make use of familiar techniques such as product binning, regular encoding/sliding window decoding and regular encoding/backward decoding. The proposed rate is shown to subsume the previously proposed rate for feed-forward relay network based on decode-and-forward. This rate is also used to establish the capacity of a generalisation of Aref network called 'semi-deterministic relay network with no interference at the relays' and independent relay inputs.

关键词： partial decoding semi-deterministic relay network symmetric relaying sliding window decoding backward decoding decode-and-forward independent relay inputs Aref network radio networks regular encoding product binning two-relay network decoding feed-forward relay network

来源：评论

学校读者我要写书评

暂无评论

An Optimal partial decoding Algorithm for Rateless Codes

An Optimal Partial Decoding Algorithm for Rateless Codes

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Bioglio, V. Grangetto, M. Gaeta, R. Sereno, M. Univ Turin Dipartimento Informat I-10149 Turin Italy

ISBN: (纸本)9781457705953

Rateless codes are designed to decode all the input symbols when a certain number of coded symbols have been received. However, it is possible to recover a subset of the input symbols from the actually received coded symbols: this process is called partial decoding and the number of recovered input symbols is termed the intermediate performance of rateless codes. In this paper we study the problem of the optimality of the partial decoding process: we say that a partial decoding algorithm is optimal if, given a rateless code, it is able to maximize the intermediate performance of the code, i.e. it is able to retreive the maximum number of input symbols when a certain number n of coded symbols have been received, for every n. We propose OPD, an optimal partial decoding algorithm for any rateless code, proving its optimality. The proposed algorithm is finally used to analyze the intermediate performance of LT codes.

关键词： LT codes partial decoding incremental decoding rateless codes

来源：评论

学校读者我要写书评

暂无评论

Encoder-Unconstrained User Interactive partial decoding Scheme

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2012年第8期E95A卷 1288-1296页

作者： Liu, Chen Jin, Xin Zhang, Tianruo Goto, Satoshi Waseda Univ Grad Sch Informat Prod & Syst Kitakyushu Fukuoka 8080135 Japan Tsinghua Univ Grad Sch Shenzhen 518055 Peoples R China

High-definition (HD) videos become more and more popular on portable devices these years. Due to the resolution mismatch between the HD video sources and the relative low-resolution screens of portable devices, the HD videos are usually fully decoded and then down-sampled (FDDS) for the displays, which not only increase the cost of both computational power and memory bandwidth, but also lose the details of video contents. In this paper, an encoder-unconstrained partial decoding scheme for H.264/AVC is presented to solve the problem by only decoding the object of interest (001) related region, which is defined by users. A simplified compression domain tracking method is utilized to ensure that the 001 locates in the center of the display area. The decoded partial area (DPA) adaptation, the reference block relocation (RBR) and co-located temporal Intra prediction (CTIP) methods are proposed to improve the visual quality for the DPA with low complexity. The simulation results show that the proposed partial decoding scheme provides an average of 50.16% decoding time reduction comparing to the fully decoding process. The displayed region also presents the original HD granularity of OOI. The proposed partial decoding scheme is especially useful for displaying HD video on the devices of which the battery life is a crucial factor.

关键词： partial decoding object of interest H.264/AVC

来源：评论

学校读者我要写书评

暂无评论

SELF-CONTAINED SLICES IN H.264 FOR partial VIDEO decoding TARGETING 3D LIGHT-FIELD DISPLAYS 9

SELF-CONTAINED SLICES IN H.264 FOR PARTIAL VIDEO DECODING TA...

引用

3DTV Conference The True Vision Capture Transmission and Display of 3D Video 3DTV CON

作者： Zare, Alireza Kovacs, Peter Tamas Gotchev, Atanas Tampere Univ Technol Dept Signal Proc Tampere Finland Holografika Budapest Hungary

ISBN: (纸本)9781467380904

Some video applications work with parallel bitstreams however only parts of them are required. decoding the streams entirely might be prohibitive due to high number of video streams and /or high resolution or bitrate of the streams. In such cases, a random access also referred as to partial decoding has to be supported. It can be achieved with a conforming decoder, if the video is separated into individual slices, and the unnecessary slices are dropped from the bit stream. Such a feature is essential in 3D light-field displays in which partial decoding of bitstreams helps providing less complex and thus real-time decoding and processing. This paper studies the problem of creating self-contained (i.e., independently decodable) slices in an H.264 stream. The requirements that need to be fulfilled in order to build self-contained slices are described, and an encoder-side solution is proposed. The advantages of self-contained slices are examined in the context of a light-field rendering application that relies on partial decoding.

关键词： H.264/AVC 3D light-field displays video slicing partial decoding random access

来源：评论

学校读者我要写书评

暂无评论

Pairwise Check decoding for LDPC Coded Two-Way Relay Block Fading Channels

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2012年第8期60卷 2065-2076页

作者： Liu, Jianquan Tao, Meixia Xu, Youyun Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China PLA Univ Sci & Technol Inst Commun Engn Nanjing 210007 Jiangsu Peoples R China

partial decoding has the potential to achieve a larger capacity region than full decoding in two-way relay (TWR) channels. Existing partial decoding realizations are however designed for Gaussian channels and with a static physical layer network coding (PLNC). In this paper, we propose a new solution for joint network coding and channel decoding at the relay, called pairwise check decoding (PCD), for low-density parity-check (LDPC) coded TWR system over block fading channels. The main idea is to form a check relationship table (check-relation-tab) for the superimposed LDPC coded packet pair in the multiple access (MA) phase in conjunction with an adaptive PLNC mapping in the broadcast (BC) phase. Using PCD, we then present a partial decoding method, two-stage closest-neighbor clustering with PCD (TS-CNC-PCD), with the aim of minimizing the worst pairwise error probability. Moreover, we propose the minimum correlation optimization (MCO) for selecting the better check-relation-tabs. Simulation results confirm that the proposed TS-CNC-PCD offers a sizable gain over the conventional XOR with belief propagation (BP) in fading channels.

关键词： Two-way relaying block fading channel LDPC physical layer network coding partial decoding pairwise check decoding closest-neighbor clustering

来源：评论

学校读者我要写书评

暂无评论

Cross-Rack-Aware Single Failure Recovery for Clustered File Systems

引用

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 2020年第2期17卷 248-261页

作者： Shen, Zhirong Lee, Patrick P. C. Shu, Jiwu Guo, Wenzhong Chinese Univ Hong Kong Dept Comp Sci & Engn Hong Kong Peoples R China Tsinghua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China Fuzhou Univ Fujian Prov Key Lab Network Comp & Intelligent In Coll Math & Comp Sci Fuzhou 350002 Fujian Sheng Peoples R China

How to improve the performance of single failure recovery has been an active research topic because of its prevalence in large-scale storage systems. We argue that when erasure coding is deployed in a clustered file system (CFS), existing single failure recovery designs are limited in different aspects: neglecting the bandwidth diversity property in a CFS architecture, targeting specific erasure code constructions, and no special treatment on load balancing during recovery. In this paper, we propose CAR, a cross-rack-aware recovery algorithm that is designed to improve the performance of single failure recovery of a CFS that employs Reed-Solomon codes for general fault tolerance. For each stripe, CAR finds a recovery solution that retrieves data from the minimum number of racks. It also reduces the amount of cross-rack repair traffic by performing intra-rack data aggregation prior to cross-rack transmission. Furthermore, by considering multi-stripe recovery, CAR balances the amount of cross-rack repair traffic across multiple racks. Evaluation results show that CAR can effectively reduce the amount of cross-rack repair traffic and the resulting recovery time.

关键词： Maintenance engineering Automobiles Fault tolerant systems Encoding Redundancy File systems Cross-rack bandwidth single failure recovery erasure coding load balancing partial decoding clustered file systems

来源：评论

学校读者我要写书评

暂无评论

Multi-layer Gelfand-Pinsker strategies for the generalised multiple-access channel

引用

IET COMMUNICATIONS 2014年第8期8卷 1296-1308页

作者： Emadi, Mohammad Javad Khormuji, Majid Nasiri Skoglund, Mikael Aref, Mohammad Reza Sharif Univ Technol ISSL Dept Elect Engn Tehran Iran Amirkabir Univ Technol Dept Elect Engn Tehran Iran Huawei Technol Sweden ACCESS Linnaeus Ctr Dept Elect Engn Stockholm Sweden Royal Inst Technol KTH ACCESS Linnaeus Ctr Dept Elect Engn Stockholm Sweden

The authors study a two-user state-dependent generalised multiple-access channel (GMAC) with correlated states. It is assumed that each encoder has non-causal' access to channel state information (CSI). They develop an achievable rate region by employing rate-splitting, block Markov encoding, Gelfand-Pinsker multicoding, superposition coding and joint typicality decoding. In the proposed scheme, the encoders use a partial decoding strategy to collaborate in the next block, and the receiver uses a backward decoding strategy with joint unique decoding at each stage. The author's achievable rate region includes several previously known regions proposed in the literature for different scenarios of multiple-access and relay channels. Then, they consider two Gaussian GMACs with additive interference. In the first model, they assume that the interference is known non-causally at both of the encoders and construct a multi-layer Costa precoding scheme that removes completely' the effect of the interference. In the second model, they consider a doubly dirty Gaussian GMAC in which each of interferences is known non-causally only at one encoder. They derive an inner bound and analyse the achievable rate region for the latter model and interestingly prove that if one of the encoders knows the full CSI, there exists an achievable rate region which is independent' of the power of interference.

关键词： multi-access systems Markov processes decoding wireless channels cooperative communication doubly dirty Gaussian GMAC multilayer Costa precoding scheme relay channels achievable rate region joint unique decoding backward decoding strategy partial decoding joint typicality decoding superposition coding Gelfand Pinsker multicoding block Markov encoding rate splitting channel state information correlated states two user state dependent generalised multiple access channel multilayer Gelfand Pinsker strategies

来源：评论

学校读者我要写书评

暂无评论

Achievable Rates for the AWGN Channel with Multiple Parallel Relays

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2009年第5期8卷 2524-2534页

作者： del Coso, Aitor Ibars, Christian CTTC Barcelona 08860 Spain

Relaying is a key technology to increase capacity in wireless networks. In this paper, the point-to-point AWGN channel with N parallel relays and time-invariant,frequency-flat fading is studied. For it, we derive achievable rates with four coding techniques, namely: decode-and-forward, partial decode-and-forward, compress-and-forward and linear relaying. The first two are based on signal regeneration at the relay nodes and aim at mimicking a transmit antenna array. We study their scaling law for N -> infinity and Rayleigh fading, and show that is lower than log(2) log (N) due to the source-relays broadcast limitation. In turn, compress-and-forward aims at mimicking a receive antenna array and consists of relay nodes distributedly compressing their signals and transmitting them to destination. We provide its achievable rate considering distributed Wyner-Ziv compression at the relays, and show that it also scales as log(2) log (N);in this case, due to the relays-destination MAC limitation. Finally, linear relaying is the extension of amplify-and-forward to full-duplex operation. For it we derive the optimum transmitted signal at the source and propose suboptimum linear relaying functions at the relays. All techniques are compared with the max-flow-min-cut upper bound, evaluated for AWGN channels.

关键词： Multiple relay channel achievable rate decode-and-forward partial decoding compress-and-forward linear relaying

来源：评论

学校读者我要写书评

暂无评论

Alternative Awaiting and Broadcast for Two-Way Relay Fading Channels

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2013年第6期62卷 2841-2846页

作者： Liu, Jianquan Tao, Meixia Xu, Youyun Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China Equipment Inst Second Artillery Beijing 100085 Peoples R China PLA Univ Sci & Technol Inst Commun Engn Nanjing 210007 Jiangsu Peoples R China

We investigate a two-way relay (TWR) fading channel where two source nodes wish to exchange information with the help of a relay node. Given traditional TWR protocols, transmission rates in both directions are known to be limited by the hop with lower capacity, i.e., the min operations between uplink and downlink. In this paper, we propose a new transmission protocol, called alternative awaiting and broadcast (AAB), to cancel the min operations in the TWR fading channels. The operational principles, a new upper bound on ergodic sum capacity (ESC), and a convergence behavior of the average delay of signal transmission (ST) (in the relay buffer) for the proposed AAB protocol are analyzed. Moreover, we propose a suboptimal encoding/decoding solution for the AAB protocol and derive an achievable ergodic sum rate (ESR) with a corresponding average delay of ST. Numerical results show that 1) the proposed AAB protocol significantly improves the achievable ESR compared with the traditional TWR protocols, and 2) considering the average delay of system service (SS) (in the source buffer), the average delay of ST induced by the proposed AAB protocol is very small and negligible.

关键词： Alternative awaiting and broadcast (AAB) ergodic sum rate (ESR) partial decoding physical layer network coding (PLNC) two-way relay (TWR)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：