Simple Nonbinary Coding Strategy for Very Noisy Relay Channels
スポンサーリンク
概要
- 論文の詳細を見る
From an information-theoretic point of view, it is well known that the capacity of relay channels comprising of three terminals is much greater than that of two terminal direct channels especially for low SNR region. Previously invented relay coding strategies have not been designed to achieve this relaying gain occurring in the low SNR region. In this paper, we propose a new simple coding strategy for a relay channel with low SNR or, equivalently, for a very noisy relay channel. The multiplicative repetition is utilized to design this simple coding strategy. We claim that the proposed strategy is simple since the destination and the relay can decode with almost the same computational complexity by sharing the same structure of decoder. An appropriate static power allocation which yields the maximum throughput close to the optimal one in low SNRs is also suggested. Under practical constraints such as equal time-sharing etc., the asymptotic performance of this simple strategy is within 0.5dB from the achievable rate of a relay channel. Furthermore, the performance at few thousand bits enjoys a relaying gain by approximately 1dB.
著者
-
SAKANIWA Kohichi
Dept. of Communications & Integrated Systems, Tokyo Institute of Technology
-
KASAI Kenta
Dept. of Communications and Computer Engineering, Tokyo Institute of Technology
-
SUTHISOPAPAN Puripong
Dept. of Electrical Engineering, Khon Kaen University
-
MEESOMBOON Anupap
Dept. of Electrical Engineering, Khon Kaen University
-
IMTAWIL Virasit
Dept. of Electrical Engineering, Khon Kaen University
関連論文
- An Edge-Preserving Super-Precision for Simultaneous Enhancement of Spacial and Grayscale Resolutions
- An Iterative MPEG Super-Resolution with an Outer Approximation of Framewise Quantization Constraint(Image)
- Discrete Time-Frequency Projection Filtering Based on an Alias-Free Discrete Time-Frequency Analysis(Digital Signal Processing)
- A Truncated Polynomial Interpolation and Its Application to Polynomially WLS Design of IIR Filters(Digital Signal Processing)
- A higher order generalization of an alias-free discrete time-frequency analysis
- A truncated polynomial interpolation theorem and its application to the WLS design of IIR filters
- A Super Resolution Reconstruction of MPEG Compressed Video Sequences
- An Edge-Preserving Super-Precision for Simultaneous Enhancement of Spacial and Grayscale Resolutions
- A Subspace Blind Identification Algorithm with Reduced Computational Complexity : Colored Noise Case(Digital Signal Processing)
- A Practical Subspace Blind Identification Algorithm with Reduced Computational Complexity : Colored Noise Case
- A Practical Subspace Blind Identification Algorithm with Reduced Computational Complexity(Digital Signal Processing)
- On the Comparison of Lower Bounds for Generalized Hamming Weights
- Detailed Evolution of Degree Distributions in Residual Graphs with Joint Degree Distributions
- Average Bit Erasure Probability of Regular LDPC Code Ensembles under MAP Decoding over BEC(Information Theory and Its Applications)
- Performance of Standard Irregular LDPC Codes under Maximum Likelihood Decoding(Coding Theory)
- Sufficient Conditions for a Regular LDPC Code Better than an Irregular LDPC Code(Coding Theory)
- Design of Irregular Repeat Accumulate Codes with Joint Degree Distributions(Coding Theory)
- Average Coset Weight Distribution of Multi-Edge Type LDPC Code Ensembles(Coding Theory,Information Theory and Its Applications)
- Average Error Probability of Standard Irregular LDPC Code Ensemble under Maximum Likelihood Decoding
- Weight and Stopping Set Distributions of Two-Edge Type LDPC Code Ensembles(Coding Theory, Information Theory and Its Applications)
- Asymptotic Weight and Stopping Set Distributions for Detailedly Represented Irregular LDPC Code Ensembles(Coding Theory)(Information Theory and Its Applications)
- Asymptotic Stopping Set Distribution for Detailedly Represented Irregular LDPC Code Ensembles
- Modified Low Density MDS Array Codes for RAID and Memory Systems
- An Efficient Encoding Method for LDPC Codes Based on Cyclic Shift
- Weight Distributions of Multi-Edge Type LDPC Codes
- Spectrum Estimation as a Problem of Finding Symmetric Positive Definite Block Toeplitz Matrices by the Hybrid Steepest Descent Method
- Factor graphs for cyclic codes with no cycles of length four
- An Optimal Design of Signal Adapted Orthonormal Wavelet by The Hybrid Steepest Descent Method
- Fourier Domain Decoding Algorithm of Non-binary LDPC Codes for Parallel Implementation
- Weight Distributions of Non-binary LDPC Codes
- Spatially-Coupled MacKay-Neal Codes and Hsu-Anastasopoulos Codes
- Analysis of Error Floors of Non-binary LDPC Codes over MBIOS Channel
- Analysis of Error Floors of Non-binary LDPC Codes over BEC
- Analysis of Error Floors for Non-binary LDPC Codes over General Linear Group through q-Ary Memoryless Symmetric Channels
- Simple Nonbinary Coding Strategy for Very Noisy Relay Channels
- Weight Distribution for Non-binary Cluster LDPC Code Ensemble