This paper describes a coded cooperative multiple-input multiple-output(MIMO) scheme,where structured low-density parity-check(LDPC) codes belonging to a family of repeat-accumulate(RA) codes are employed.The outage p...This paper describes a coded cooperative multiple-input multiple-output(MIMO) scheme,where structured low-density parity-check(LDPC) codes belonging to a family of repeat-accumulate(RA) codes are employed.The outage probability of the scheme over Rayleigh fading channels is deduced.In an unknown channel state information(CSI) scenario,adaptive transversal filters based on a spatio-temporal recursive least squares(ST-RLS) algorithm are adopted in the destination to realize receive diversity gain.Also,a joint 'Min-Sum' iterative decoding is effectively carried out in the destination.Such a decoding algorithm agrees with the bilayer Tanner graph that can be used to fully characterize two distinct structured LDPC codes employed by the source and relay.Simulation results verify the effectiveness of the adopted filter in the coded cooperative MIMO scheme.Theoretical analysis and numerical simulations show that the LDPC coded cooperative MIMO scheme can well combine cooperation diversity,multi-receive diversity,and channel coding gains,and clearly outperforms coded noncooperation schemes under the same conditions.展开更多
In order to solve high encoding complexities of irregular low-density parity-check （LDPC） codes, a deterministic construction of irregular LDPC codes with low encoding complexities is proposed. The encoding algorith...In order to solve high encoding complexities of irregular low-density parity-check （LDPC） codes, a deterministic construction of irregular LDPC codes with low encoding complexities is proposed. The encoding algorithms are designed, whose complexities are linear equations of code length. The construction and encoding algorithms are derived from the effectively encoding characteristics of repeat-accumulate （RA） codes and masking technique. First, the new construction modifies parity-check matrices of RA codes to eliminate error floors of RA codes. Second, the new constructed parity-check matrices are based on Vandermonde matrices; this deterministic algebraic structure is easy for hardware implementation. Theoretic analysis and experimental results show that, at a bit-error rate of 10 × 10^-4, the new codes with lower encoding complexities outperform Mackay＇s random LDPC codes by 0.4-0.6 dB over an additive white Gauss noise （AWGN） channel.展开更多
基金Project (No. 20105552) supported by the Science and Technology on Avionics Integration LaboratoryNational Aeronautical Science Foundation of China
文摘This paper describes a coded cooperative multiple-input multiple-output(MIMO) scheme,where structured low-density parity-check(LDPC) codes belonging to a family of repeat-accumulate(RA) codes are employed.The outage probability of the scheme over Rayleigh fading channels is deduced.In an unknown channel state information(CSI) scenario,adaptive transversal filters based on a spatio-temporal recursive least squares(ST-RLS) algorithm are adopted in the destination to realize receive diversity gain.Also,a joint 'Min-Sum' iterative decoding is effectively carried out in the destination.Such a decoding algorithm agrees with the bilayer Tanner graph that can be used to fully characterize two distinct structured LDPC codes employed by the source and relay.Simulation results verify the effectiveness of the adopted filter in the coded cooperative MIMO scheme.Theoretical analysis and numerical simulations show that the LDPC coded cooperative MIMO scheme can well combine cooperation diversity,multi-receive diversity,and channel coding gains,and clearly outperforms coded noncooperation schemes under the same conditions.
基金Supported by the National Natural Science Foundation of China(60496315, 60572050)
文摘In order to solve high encoding complexities of irregular low-density parity-check （LDPC） codes, a deterministic construction of irregular LDPC codes with low encoding complexities is proposed. The encoding algorithms are designed, whose complexities are linear equations of code length. The construction and encoding algorithms are derived from the effectively encoding characteristics of repeat-accumulate （RA） codes and masking technique. First, the new construction modifies parity-check matrices of RA codes to eliminate error floors of RA codes. Second, the new constructed parity-check matrices are based on Vandermonde matrices; this deterministic algebraic structure is easy for hardware implementation. Theoretic analysis and experimental results show that, at a bit-error rate of 10 × 10^-4, the new codes with lower encoding complexities outperform Mackay＇s random LDPC codes by 0.4-0.6 dB over an additive white Gauss noise （AWGN） channel.
