This paper proposes a genetic optimization method for the construction of non-binary quasi-cyclic low-density parity-check(NB-QC-LDPC)codes with short block lengths.In our scheme,the initial template base matrices and...This paper proposes a genetic optimization method for the construction of non-binary quasi-cyclic low-density parity-check(NB-QC-LDPC)codes with short block lengths.In our scheme,the initial template base matrices and the corresponding non-binary replacement matrices are constructed by the progressive edge growth algorithm and randomly generated,respectively.The genetic algorithm is then utilized to optimize the base matrices and the replacement ones.The simulation results show that the NB-QC-LDPC codes constructed by the proposed method achieve better decoding performance and lower implementation complexity compared to the existing NB-LDPC codes such as consultative committee for space data system and Bei Dou satellite navigation system.展开更多
A new method for constructing Quasi-Cyclic (QC) Low-Density Parity-Check (LDPC) codes based on Euclidean Geometry (EG) is presented. The proposed method results in a class of QC-LDPC codes with girth of at least 6 and...A new method for constructing Quasi-Cyclic (QC) Low-Density Parity-Check (LDPC) codes based on Euclidean Geometry (EG) is presented. The proposed method results in a class of QC-LDPC codes with girth of at least 6 and the designed codes perform very close to the Shannon limit with iterative decoding. Simulations show that the designed QC-LDPC codes have almost the same performance with the existing EG-LDPC codes.展开更多
This paper presents a novel regular Quasi-Cyclic (QC)Low Density Parity Check (LDPC)codes with columnweight three and girth at least eight.These are designed on the basis of combinatorial design in which subsets appli...This paper presents a novel regular Quasi-Cyclic (QC)Low Density Parity Check (LDPC)codes with columnweight three and girth at least eight.These are designed on the basis of combinatorial design in which subsets applied for the construction of circulant matrices are determined by a particular subset.Considering the nonexistence of cycles four and six in the structure of the parity check matrix,a bound for their minimum weight is proposed.The simtdations conducted confirm that without applying a masking technique,the newly implemented codes have a performance similar to or better than other well-known codes.This is evident in the waterfall region, while their error floor at very low Bit Error Rate (BER)is expected.展开更多
The girth plays an important role in the design of LDPC codes. In order to determine the girth of Tanner(5,7) quasi-cyclic( QC) LDPC codes with length 7p for p being a prime with the form 35 m + 1,the cycles of length...The girth plays an important role in the design of LDPC codes. In order to determine the girth of Tanner(5,7) quasi-cyclic( QC) LDPC codes with length 7p for p being a prime with the form 35 m + 1,the cycles of lengths 4,6,8,and 10 are analyzed. Then these cycles are classified into sixteen categories,each of which can be expressed as an ordered block sequence,or a certain type. It is also shown that the existence of these cycles is equal to polynomial equations over Fpwho has a 35th unit root. We check if these polynomial equations have a 35th unit root and obtain the girth values of Tanner(5,7) QC LDPC codes.展开更多
An improved Euclidean geometry approach to design quasi-cyclic （QC） Low-density parity-check （LDPC） codes with high-rate and low error floor is presented. The constructed QC-LDPC codes with high-rate have lower er...An improved Euclidean geometry approach to design quasi-cyclic （QC） Low-density parity-check （LDPC） codes with high-rate and low error floor is presented. The constructed QC-LDPC codes with high-rate have lower error floor than the original codes. The distribution of the minimum weight codeword is analyzed, and a sufficient existence condition of the minimum weight codeword is found. Simulations show that a lot of QC-LDPC codes with lower error floor can be designed by reducing the number of the minimum weight codewords satisfying this sufficient condition.展开更多
The design of a high-speed decoder using traditional partly parallel architecture for Non-Quasi-Cyclic(NQC)Low-Density Parity-Check(LDPC)codes is a challenging problem due to its high memory-block cost and low hardwar...The design of a high-speed decoder using traditional partly parallel architecture for Non-Quasi-Cyclic(NQC)Low-Density Parity-Check(LDPC)codes is a challenging problem due to its high memory-block cost and low hardware utilization efficiency.In this paper,we present efficient hardware implementation schemes for NQCLDPC codes.First,we propose an implementation-oriented construction scheme for NQC-LDPC codes to avoid memory-access conflict in the partly parallel decoder.Then,we propose a Modified Overlapped Message-Passing(MOMP)algorithm for the hardware implementation of NQC-LDPC codes.This algorithm doubles the hardware utilization efficiency and supports a higher degree of parallelism than that used in the Overlapped Message Passing(OMP)technique proposed in previous works.We also present single-core and multi-core decoder architectures in the proposed MOMP algorithm to reduce memory cost and improve circuit efficiency.Moreover,we introduce a technique called the cycle bus to further reduce the number of block RAMs in multi-core decoders.Using numerical examples,we show that,for a rate-2/3,length-15360 NQC-LDPC code with 8.43-d B coding gain for Binary PhaseShift Keying(BPSK)in an Additive White Gaussian Noise(AWGN)channel,the decoder with the proposed scheme achieves a 23.8%–52.6%reduction in logic utilization per Mbps and a 29.0%–90.0%reduction in message-memory bits per Mbps.展开更多
In multipath environments, the error rate performance of orthogonal frequency division multiplexing （OFDM） is severely degraded by the deep fading subcarriers. Powerful error-correcting codes must be used with OFDM....In multipath environments, the error rate performance of orthogonal frequency division multiplexing （OFDM） is severely degraded by the deep fading subcarriers. Powerful error-correcting codes must be used with OFDM. This paper presents a quasi-cyclic low-density parity-check （LDPC） coded OFDM system, in which the redundant bits of each codeword are mapped to a higher-order modulation constellation. The op- timal degree distribution was calculated using density evolution. The corresponding quasi-cyclic LDPC code was then constructed using circulant permutation matrices. Group shuffled message passing scheduling was used in the iterative decoding. Simulation results show that the system achieves better error rate performance and faster decoding convergence than conventional approaches on both additive white Gaussian noise （AWGN） and Rayleigh fading channels.展开更多
In this paper, we propose the approach of employing circulant permutation matrices to construct quantum quasicyclic （QC） low-density parity-check （LDPC） codes. Using the proposed approach one may construct some ne...In this paper, we propose the approach of employing circulant permutation matrices to construct quantum quasicyclic （QC） low-density parity-check （LDPC） codes. Using the proposed approach one may construct some new quantum codes with various lengths and rates of no cycles-length 4 in their Tanner graphs. In addition, these constructed codes have the advantages of simple implementation and low-complexity encoding. Finally, the decoding approach for the proposed quantum QC LDPC is investigated.展开更多
Quasi-cyclic codes of length mn over Z4 are shown to be equivalent to A-submodules of A^n, where A = Z4[x]/（x^m - 1）. In the case of m being odd, all quasi-cyclic codes are shown to be decomposable into the direct s...Quasi-cyclic codes of length mn over Z4 are shown to be equivalent to A-submodules of A^n, where A = Z4[x]/（x^m - 1）. In the case of m being odd, all quasi-cyclic codes are shown to be decomposable into the direct sum of a fixed number of cyclic irreducible A-submodules. Finally the distinct quasi-cyclic codes as well as some specific subclasses are enumerated.展开更多
Space laser communication(SLC)is an emerging technology to support high-throughput data transmissions in space networks.In this paper,to guarantee the reliability of high-speed SLC links,we aim at practical implementa...Space laser communication(SLC)is an emerging technology to support high-throughput data transmissions in space networks.In this paper,to guarantee the reliability of high-speed SLC links,we aim at practical implementation of low-density paritycheck(LDPC)decoding under resource-restricted space platforms.Particularly,due to the supply restriction and cost issues of high-speed on-board devices such as analog-to-digital converters(ADCs),the input of LDPC decoding will be usually constrained by hard-decision channel output.To tackle this challenge,density-evolution-based theoretical analysis is firstly performed to identify the cause of performance degradation in the conventional binaryinitialized iterative decoding(BIID)algorithm.Then,a computation-efficient decoding algorithm named multiary-initialized iterative decoding with early termination(MIID-ET)is proposed,which improves the error-correcting performance and computation efficiency by using a reliability-based initialization method and a threshold-based decoding termination rule.Finally,numerical simulations are conducted on example codes of rates 7/8 and 1/2 to evaluate the performance of different LDPC decoding algorithms,where the proposed MIID-ET outperforms the BIID with a coding gain of 0.38 dB and variable node calculation saving of 37%.With this advantage,the proposed MIID-ET can notably reduce LDPC decoder’s hardware implementation complexity under the same bit error rate performance,which successfully doubles the total throughput to 10 Gbps on a single-chip FPGA.展开更多
The progressive edge-growth(PEG)al-gorithm is a general method to construct short low-density parity-check(LDPC)codes and it is a greedy method to place each edge with large girths.In order to improve the performance ...The progressive edge-growth(PEG)al-gorithm is a general method to construct short low-density parity-check(LDPC)codes and it is a greedy method to place each edge with large girths.In order to improve the performance of LDPC codes,many im-proved PEG(IPEG)algorithms employ multi metrics to select surviving edges in turn.In this paper,the pro-posed edges metric(EM)based on message-passing algorithm(MPA)is introduced to PEG algorithm and the proposed EM constrained PEG(EM-PEG)algo-rithm mainly considers the independence of message passing from different nodes in Tanner graph.The numerical results show that our EM-PEG algorithm brings better bit error rate(BER)performance gains to LDPC codes than the traditional PEG algorithm and the powerful multi-edge multi-metric constrained PEG algorithm(MM-PEGA)proposed recently.In ad-dition,the multi-edge EM constrained PEG(M-EM-PEG)algorithm which adopts multi-edge EM may fur-ther improve the BER performance.展开更多
Random Projection Code (RPC) is a mechanism that combines channel coding and modulation together and realizes rate adaptation in the receiving end. Random projection code’s mapping matrix has significant influences o...Random Projection Code (RPC) is a mechanism that combines channel coding and modulation together and realizes rate adaptation in the receiving end. Random projection code’s mapping matrix has significant influences on decoding performance as well as hardware implementation complexity. To reduce hardware implementation complexity, we design a quasi-cyclic mapping matrix for RPC codes. Compared with other construction approaches, our design gets rid of data filter component, thus reducing chip area 7284.95 um2, and power consumption 331.46 uW in 0.13 um fabrication. Our simulation results show that our method does not cause any performance loss and even gets 0.2 dB to 0.5 dB gain at BER 10-4.展开更多
Quasi-cyclic low-density parity-check （QC-LDPC） codes can be constructed conveniently by cyclic lifting of protographs. For the purpose of eliminating short cycles in the Tanner graph to guarantee performance, first...Quasi-cyclic low-density parity-check （QC-LDPC） codes can be constructed conveniently by cyclic lifting of protographs. For the purpose of eliminating short cycles in the Tanner graph to guarantee performance, first an algorithm to enumerate the harmful short cycles in the protograph is designed, and then a greedy algorithm is proposed to assign proper permutation shifts to the circulant permutation submatrices in the parity check matrix after lifting. Compared with the existing deterministic edge swapping （DES） algorithms, the proposed greedy algorithm adds more constraints in the assignment of permutation shifts to improve performance. Simulation results verify that it outperforms DES in reducing short cycles. In addition, it is proved that the parity check matrices of the cyclic lifted QC-LDPC codes can be transformed into block lower triangular ones when the lifting factor is a power of 2. Utilizing this property, the QC- LDPC codes can be encoded by preprocessing the base matrices, which reduces the encoding complexity to a large extent.展开更多
A modified Benes network is proposed to be used as an optimal shuffle network in worldwide interoperability for microwave access （WiMAX） low density parity check （LDPC） decoders, When the size of the input is not ...A modified Benes network is proposed to be used as an optimal shuffle network in worldwide interoperability for microwave access （WiMAX） low density parity check （LDPC） decoders, When the size of the input is not a power of two, the modified Benes network can achieve the most optimal performance. This modified Benes network is non-blocking and can perform any sorts of permutations, so it can support 19 modes specified in the WiMAX system. Furthermore, an efficient algorithm to generate the control signals for all the 2 × 2 switches in this network is derived, which can reduce the hardware complexity and overall latency of the modified Benes network. Synthesis results show that the proposed control signal generator can save 25.4% chip area and the overall network latency can be reduced by 36. 2%.展开更多
In this paper, we focus on the design of irregular QC-LDPC code based multi-level coded modulation(MLCM) scheme by jointly optimizing the component code rate and the degree distribution of the irregular QC-LDPC compon...In this paper, we focus on the design of irregular QC-LDPC code based multi-level coded modulation(MLCM) scheme by jointly optimizing the component code rate and the degree distribution of the irregular QC-LDPC component code. Firstly, the sub-channel capacities of MLCM systems is analyzed and discussed, based on which the optimal component code rate can be obtained. Secondly, an extrinsic information transfer chart based two-stage searching algorithm is proposed to find the good irregular QC-LDPC code ensembles with optimal component code rates for their corresponding sub-channels. Finally, by constructing the irregular QC-LDPC component codes from the designed ensembles with the aim of possibly enlarging the girth and reducing the number of the shortest cycles, the designed irregular QC-LDPC code based 16QAM and 64QAM MLCM systems can achieve 0.4 dB and 1.2 dB net coding gain, respectively, compared with the recently proposed regular QC-LDPC code based 16QAM and 64QAM MLCM systems.展开更多
A construction method based on the p-plane to design high-girth quasi-cyclic low-density parity-check （QC-LDPC） codes is proposed. Firstly the good points in every line of the p-plane can be ascertained through filt...A construction method based on the p-plane to design high-girth quasi-cyclic low-density parity-check （QC-LDPC） codes is proposed. Firstly the good points in every line of the p-plane can be ascertained through filtering the bad points, because the designed parity-check matrixes using these points have the short cycles in Tanner graph of codes. Then one of the best points from the residual good points of every line in the p-plane will be found, respectively. The optimal point is also singled out according to the bit error rate （BER） performance of the QC-LDPC codes at last. Explicit necessary and sufficient conditions for the QC-LDPC codes to have no short cycles are presented which are in favor of removing the bad points in the p-plane. Since preventing the short cycles also prevents the small stopping sets, the proposed construction method also leads to QC-LDPC codes with a higher stopping distance.展开更多
According to large coverage of satellites, there are various channel states in a satellite broadcasting network. In order to introduce an efficient rateless transmission method to satellite multimedia broadcasting/mul...According to large coverage of satellites, there are various channel states in a satellite broadcasting network. In order to introduce an efficient rateless transmission method to satellite multimedia broadcasting/multicast services with finite-length packets, a cross-layer packet transmission method is proposed with Luby transform （LT） codes for efficiency in the network layer and low density parity check （LDPC） codes for reliability in the physical layer jointly. The codewords generated from an LT encoder are divided into finite-length packets, which are encoded by an LDPC encoder subsequently. Based on noise and fading effects of satellite channels, the LT packets received from an LDPC decoder either have no error or are marked as erased, which can be mod- eled as a binary erasure channels （BECs）. By theoretical analysis on LT parameters and LDPC parameters, the relationships between LDPC code rates in the physical layer and LT codes word lengths in the network layer are investigated. With tradeoffs between the LT codes word lengths and the LDPC code rates, optimized cross-layer solutions are achieved with a binary search algorithm. Verified by simulations, the proposed solution for cross-layer parameters design can provide the best transmission mode according to satellite states, so as to improve throughput performance for satellite multimedia transmission.展开更多
A novel low-complexity weighted symbol-flipping algorithm with flipping patterns to decode nonbinary low-density parity-check codes is proposed. The proposed decoding procedure updates the hard-decision received symbo...A novel low-complexity weighted symbol-flipping algorithm with flipping patterns to decode nonbinary low-density parity-check codes is proposed. The proposed decoding procedure updates the hard-decision received symbol vector iteratively in search of a valid codeword in the symbol vector space. Only one symbol is flipped in each iteration, and symbol flipping function, which is employed as the symbol flipping metric, combines the number of failed checks and the reliabilities of the received bits and calculated symbols. A scheme to avoid infinite loops and select one symbol to flip in high order Galois field search is also proposed. The design of flipping pattern＇s order and depth, which is dependent of the computational requirement and error performance, is also proposed and exemplified. Simulation results show that the algorithm achieves an appealing tradeoff between performance and computational requirement over relatively low Galois field for short to medium code length.展开更多
基金supported by the National Natural Science Foundation of China under Grants 62331002。
文摘This paper proposes a genetic optimization method for the construction of non-binary quasi-cyclic low-density parity-check(NB-QC-LDPC)codes with short block lengths.In our scheme,the initial template base matrices and the corresponding non-binary replacement matrices are constructed by the progressive edge growth algorithm and randomly generated,respectively.The genetic algorithm is then utilized to optimize the base matrices and the replacement ones.The simulation results show that the NB-QC-LDPC codes constructed by the proposed method achieve better decoding performance and lower implementation complexity compared to the existing NB-LDPC codes such as consultative committee for space data system and Bei Dou satellite navigation system.
基金Supported by the National Key Basic Research Program (973) Project (No. 2010CB328300)the 111 Project (No. B08038)
文摘A new method for constructing Quasi-Cyclic (QC) Low-Density Parity-Check (LDPC) codes based on Euclidean Geometry (EG) is presented. The proposed method results in a class of QC-LDPC codes with girth of at least 6 and the designed codes perform very close to the Shannon limit with iterative decoding. Simulations show that the designed QC-LDPC codes have almost the same performance with the existing EG-LDPC codes.
文摘This paper presents a novel regular Quasi-Cyclic (QC)Low Density Parity Check (LDPC)codes with columnweight three and girth at least eight.These are designed on the basis of combinatorial design in which subsets applied for the construction of circulant matrices are determined by a particular subset.Considering the nonexistence of cycles four and six in the structure of the parity check matrix,a bound for their minimum weight is proposed.The simtdations conducted confirm that without applying a masking technique,the newly implemented codes have a performance similar to or better than other well-known codes.This is evident in the waterfall region, while their error floor at very low Bit Error Rate (BER)is expected.
基金Sponsored by the National Natural Science Foundation of China(Grant Nos.61372074 and 91438101)the National High Technology Research and Development Program of China(Grant No.2015AA01A709)
文摘The girth plays an important role in the design of LDPC codes. In order to determine the girth of Tanner(5,7) quasi-cyclic( QC) LDPC codes with length 7p for p being a prime with the form 35 m + 1,the cycles of lengths 4,6,8,and 10 are analyzed. Then these cycles are classified into sixteen categories,each of which can be expressed as an ordered block sequence,or a certain type. It is also shown that the existence of these cycles is equal to polynomial equations over Fpwho has a 35th unit root. We check if these polynomial equations have a 35th unit root and obtain the girth values of Tanner(5,7) QC LDPC codes.
基金supported by the Scientific Research Program Funded by Shaanxi Provincial Education Department (11JK1007)the Program for Young Teachers in Xi’an University of Posts and Telecommunications (0001286)the National Basic Research Program of China (2012CB328300)
文摘An improved Euclidean geometry approach to design quasi-cyclic （QC） Low-density parity-check （LDPC） codes with high-rate and low error floor is presented. The constructed QC-LDPC codes with high-rate have lower error floor than the original codes. The distribution of the minimum weight codeword is analyzed, and a sufficient existence condition of the minimum weight codeword is found. Simulations show that a lot of QC-LDPC codes with lower error floor can be designed by reducing the number of the minimum weight codewords satisfying this sufficient condition.
基金supported in part by the National Natural Science Foundation of China(Nos.61101072 and 61132002)the new strategic industries development projects of Shenzhen city(No.ZDSY20120616141333842)Tsinghua University Initiative Scientific Research Program(No.2012Z10132)
文摘The design of a high-speed decoder using traditional partly parallel architecture for Non-Quasi-Cyclic(NQC)Low-Density Parity-Check(LDPC)codes is a challenging problem due to its high memory-block cost and low hardware utilization efficiency.In this paper,we present efficient hardware implementation schemes for NQCLDPC codes.First,we propose an implementation-oriented construction scheme for NQC-LDPC codes to avoid memory-access conflict in the partly parallel decoder.Then,we propose a Modified Overlapped Message-Passing(MOMP)algorithm for the hardware implementation of NQC-LDPC codes.This algorithm doubles the hardware utilization efficiency and supports a higher degree of parallelism than that used in the Overlapped Message Passing(OMP)technique proposed in previous works.We also present single-core and multi-core decoder architectures in the proposed MOMP algorithm to reduce memory cost and improve circuit efficiency.Moreover,we introduce a technique called the cycle bus to further reduce the number of block RAMs in multi-core decoders.Using numerical examples,we show that,for a rate-2/3,length-15360 NQC-LDPC code with 8.43-d B coding gain for Binary PhaseShift Keying(BPSK)in an Additive White Gaussian Noise(AWGN)channel,the decoder with the proposed scheme achieves a 23.8%–52.6%reduction in logic utilization per Mbps and a 29.0%–90.0%reduction in message-memory bits per Mbps.
文摘In multipath environments, the error rate performance of orthogonal frequency division multiplexing （OFDM） is severely degraded by the deep fading subcarriers. Powerful error-correcting codes must be used with OFDM. This paper presents a quasi-cyclic low-density parity-check （LDPC） coded OFDM system, in which the redundant bits of each codeword are mapped to a higher-order modulation constellation. The op- timal degree distribution was calculated using density evolution. The corresponding quasi-cyclic LDPC code was then constructed using circulant permutation matrices. Group shuffled message passing scheduling was used in the iterative decoding. Simulation results show that the system achieves better error rate performance and faster decoding convergence than conventional approaches on both additive white Gaussian noise （AWGN） and Rayleigh fading channels.
基金Project supported by the National Natural Science Foundation of China (Grant Nos 60773085 and 60801051)the NSFC-KOSEF International Collaborative Research Funds (Grant Nos 60811140346 and F01-2008-000-10021-0)
文摘In this paper, we propose the approach of employing circulant permutation matrices to construct quantum quasicyclic （QC） low-density parity-check （LDPC） codes. Using the proposed approach one may construct some new quantum codes with various lengths and rates of no cycles-length 4 in their Tanner graphs. In addition, these constructed codes have the advantages of simple implementation and low-complexity encoding. Finally, the decoding approach for the proposed quantum QC LDPC is investigated.
基金the National Natural Science Foundation of China (60603016)
文摘Quasi-cyclic codes of length mn over Z4 are shown to be equivalent to A-submodules of A^n, where A = Z4[x]/（x^m - 1）. In the case of m being odd, all quasi-cyclic codes are shown to be decomposable into the direct sum of a fixed number of cyclic irreducible A-submodules. Finally the distinct quasi-cyclic codes as well as some specific subclasses are enumerated.
基金supported by the National Key R&D Program of China(Grant No.2022YFA1005000)the National Natural Science Foundation of China(Grant No.62101308 and 62025110).
文摘Space laser communication(SLC)is an emerging technology to support high-throughput data transmissions in space networks.In this paper,to guarantee the reliability of high-speed SLC links,we aim at practical implementation of low-density paritycheck(LDPC)decoding under resource-restricted space platforms.Particularly,due to the supply restriction and cost issues of high-speed on-board devices such as analog-to-digital converters(ADCs),the input of LDPC decoding will be usually constrained by hard-decision channel output.To tackle this challenge,density-evolution-based theoretical analysis is firstly performed to identify the cause of performance degradation in the conventional binaryinitialized iterative decoding(BIID)algorithm.Then,a computation-efficient decoding algorithm named multiary-initialized iterative decoding with early termination(MIID-ET)is proposed,which improves the error-correcting performance and computation efficiency by using a reliability-based initialization method and a threshold-based decoding termination rule.Finally,numerical simulations are conducted on example codes of rates 7/8 and 1/2 to evaluate the performance of different LDPC decoding algorithms,where the proposed MIID-ET outperforms the BIID with a coding gain of 0.38 dB and variable node calculation saving of 37%.With this advantage,the proposed MIID-ET can notably reduce LDPC decoder’s hardware implementation complexity under the same bit error rate performance,which successfully doubles the total throughput to 10 Gbps on a single-chip FPGA.
文摘The progressive edge-growth(PEG)al-gorithm is a general method to construct short low-density parity-check(LDPC)codes and it is a greedy method to place each edge with large girths.In order to improve the performance of LDPC codes,many im-proved PEG(IPEG)algorithms employ multi metrics to select surviving edges in turn.In this paper,the pro-posed edges metric(EM)based on message-passing algorithm(MPA)is introduced to PEG algorithm and the proposed EM constrained PEG(EM-PEG)algo-rithm mainly considers the independence of message passing from different nodes in Tanner graph.The numerical results show that our EM-PEG algorithm brings better bit error rate(BER)performance gains to LDPC codes than the traditional PEG algorithm and the powerful multi-edge multi-metric constrained PEG algorithm(MM-PEGA)proposed recently.In ad-dition,the multi-edge EM constrained PEG(M-EM-PEG)algorithm which adopts multi-edge EM may fur-ther improve the BER performance.
文摘Random Projection Code (RPC) is a mechanism that combines channel coding and modulation together and realizes rate adaptation in the receiving end. Random projection code’s mapping matrix has significant influences on decoding performance as well as hardware implementation complexity. To reduce hardware implementation complexity, we design a quasi-cyclic mapping matrix for RPC codes. Compared with other construction approaches, our design gets rid of data filter component, thus reducing chip area 7284.95 um2, and power consumption 331.46 uW in 0.13 um fabrication. Our simulation results show that our method does not cause any performance loss and even gets 0.2 dB to 0.5 dB gain at BER 10-4.
基金The National Key Technology R&D Program of China during the 12th Five-Year Plan Period(No.2012BAH15B00)
文摘Quasi-cyclic low-density parity-check （QC-LDPC） codes can be constructed conveniently by cyclic lifting of protographs. For the purpose of eliminating short cycles in the Tanner graph to guarantee performance, first an algorithm to enumerate the harmful short cycles in the protograph is designed, and then a greedy algorithm is proposed to assign proper permutation shifts to the circulant permutation submatrices in the parity check matrix after lifting. Compared with the existing deterministic edge swapping （DES） algorithms, the proposed greedy algorithm adds more constraints in the assignment of permutation shifts to improve performance. Simulation results verify that it outperforms DES in reducing short cycles. In addition, it is proved that the parity check matrices of the cyclic lifted QC-LDPC codes can be transformed into block lower triangular ones when the lifting factor is a power of 2. Utilizing this property, the QC- LDPC codes can be encoded by preprocessing the base matrices, which reduces the encoding complexity to a large extent.
基金The National Natural Science Foundation of China(No.60871079)
文摘A modified Benes network is proposed to be used as an optimal shuffle network in worldwide interoperability for microwave access （WiMAX） low density parity check （LDPC） decoders, When the size of the input is not a power of two, the modified Benes network can achieve the most optimal performance. This modified Benes network is non-blocking and can perform any sorts of permutations, so it can support 19 modes specified in the WiMAX system. Furthermore, an efficient algorithm to generate the control signals for all the 2 × 2 switches in this network is derived, which can reduce the hardware complexity and overall latency of the modified Benes network. Synthesis results show that the proposed control signal generator can save 25.4% chip area and the overall network latency can be reduced by 36. 2%.
基金supported by National Natural Science Foundation of China(No.61571061)
文摘In this paper, we focus on the design of irregular QC-LDPC code based multi-level coded modulation(MLCM) scheme by jointly optimizing the component code rate and the degree distribution of the irregular QC-LDPC component code. Firstly, the sub-channel capacities of MLCM systems is analyzed and discussed, based on which the optimal component code rate can be obtained. Secondly, an extrinsic information transfer chart based two-stage searching algorithm is proposed to find the good irregular QC-LDPC code ensembles with optimal component code rates for their corresponding sub-channels. Finally, by constructing the irregular QC-LDPC component codes from the designed ensembles with the aim of possibly enlarging the girth and reducing the number of the shortest cycles, the designed irregular QC-LDPC code based 16QAM and 64QAM MLCM systems can achieve 0.4 dB and 1.2 dB net coding gain, respectively, compared with the recently proposed regular QC-LDPC code based 16QAM and 64QAM MLCM systems.
基金supported by the National Natural Science Foundation of China (60572093)Specialized Research Fund for the Doctoral Program of Higher Education (20050004016)
文摘A construction method based on the p-plane to design high-girth quasi-cyclic low-density parity-check （QC-LDPC） codes is proposed. Firstly the good points in every line of the p-plane can be ascertained through filtering the bad points, because the designed parity-check matrixes using these points have the short cycles in Tanner graph of codes. Then one of the best points from the residual good points of every line in the p-plane will be found, respectively. The optimal point is also singled out according to the bit error rate （BER） performance of the QC-LDPC codes at last. Explicit necessary and sufficient conditions for the QC-LDPC codes to have no short cycles are presented which are in favor of removing the bad points in the p-plane. Since preventing the short cycles also prevents the small stopping sets, the proposed construction method also leads to QC-LDPC codes with a higher stopping distance.
基金supported by the National Natural Science Foundation of China (No.61101125)
文摘According to large coverage of satellites, there are various channel states in a satellite broadcasting network. In order to introduce an efficient rateless transmission method to satellite multimedia broadcasting/multicast services with finite-length packets, a cross-layer packet transmission method is proposed with Luby transform （LT） codes for efficiency in the network layer and low density parity check （LDPC） codes for reliability in the physical layer jointly. The codewords generated from an LT encoder are divided into finite-length packets, which are encoded by an LDPC encoder subsequently. Based on noise and fading effects of satellite channels, the LT packets received from an LDPC decoder either have no error or are marked as erased, which can be mod- eled as a binary erasure channels （BECs）. By theoretical analysis on LT parameters and LDPC parameters, the relationships between LDPC code rates in the physical layer and LT codes word lengths in the network layer are investigated. With tradeoffs between the LT codes word lengths and the LDPC code rates, optimized cross-layer solutions are achieved with a binary search algorithm. Verified by simulations, the proposed solution for cross-layer parameters design can provide the best transmission mode according to satellite states, so as to improve throughput performance for satellite multimedia transmission.
文摘A novel low-complexity weighted symbol-flipping algorithm with flipping patterns to decode nonbinary low-density parity-check codes is proposed. The proposed decoding procedure updates the hard-decision received symbol vector iteratively in search of a valid codeword in the symbol vector space. Only one symbol is flipped in each iteration, and symbol flipping function, which is employed as the symbol flipping metric, combines the number of failed checks and the reliabilities of the received bits and calculated symbols. A scheme to avoid infinite loops and select one symbol to flip in high order Galois field search is also proposed. The design of flipping pattern＇s order and depth, which is dependent of the computational requirement and error performance, is also proposed and exemplified. Simulation results show that the algorithm achieves an appealing tradeoff between performance and computational requirement over relatively low Galois field for short to medium code length.
