A random functional central limit theorem is obtained for processes of partial sums andproduct sums of linear processes generated by non-stationary martingale differences. It devel-ops and improves some corresponding ...A random functional central limit theorem is obtained for processes of partial sums andproduct sums of linear processes generated by non-stationary martingale differences. It devel-ops and improves some corresponding results on processes of partial sums of linear processesgenerated by strictly stationary martingale differences, which can be found in [5].展开更多
Consider a sequence of i.i.d.positive random variables.An universal result in almost sure limit theorem for products of sums of partial sums is established.We will show that the almost sure limit theorem holds under a...Consider a sequence of i.i.d.positive random variables.An universal result in almost sure limit theorem for products of sums of partial sums is established.We will show that the almost sure limit theorem holds under a fairly general condition on the weight dk= k-1 exp（lnβk）,0≤β〈1.And in a sense,our results have reached the optimal form.展开更多
In this paper, extracting parallelizatio n from the sum of disjoint products approach is discussed. A general framework of parallelizing disjoint products approach is presented. And a parallel version of the newest...In this paper, extracting parallelizatio n from the sum of disjoint products approach is discussed. A general framework of parallelizing disjoint products approach is presented. And a parallel version of the newest disjoint products algorithm is implemented. The results of testing s how the effect is so good to get linear speedups.展开更多
In this paper, two-dimensional (2-D) correction scheme is proposed to improve the performance of conventional Min-Sum (MS) decoding of regular low density parity check codes. The adopted algorithm to obtain the correc...In this paper, two-dimensional (2-D) correction scheme is proposed to improve the performance of conventional Min-Sum (MS) decoding of regular low density parity check codes. The adopted algorithm to obtain the correction factors is simply based on estimating the mean square difference (MSD) between the transmitted codeword and the posteriori information of both bit and check node that produced at the MS decoder. Semi-practical tests using software-defined radio (SDR) and specific code simulations show that the proposed quasi-optimal algorithm provides a comparable error performance as Sum-Product (SP) decoding while requiring less complexity.展开更多
The objective in this presentation is to introduce some of the unique properties and applications of nullors in active circuit analysis and designs. The emphasis is to discuss the role nullors can play in symbolic rep...The objective in this presentation is to introduce some of the unique properties and applications of nullors in active circuit analysis and designs. The emphasis is to discuss the role nullors can play in symbolic representation of transfer functions. To show this we adopt the topological platform for the circuit analysis and use a recently developed Admittance Method (AM) to achieve the Sum of Tree Products (STP), replacing the determinant and cofactors of the Nodal Admittance Matrix (NAM) of the circuit. To construct a transfer function, we start with a given active circuit and convert all its controlled sources and I/O-ports to nullors. Now, with a solid nullor circuit (passive elements and nullors) we first eliminate the passive elements through AM operations. This produces the STPs. Second, the all-nullor circuit is then used to find the signs or the STPs. Finally, the transfer function (in symbolic, if chosen) is obtained from the ratio between the STPs.展开更多
In this paper, both the high-complexity near-ML list decoding and the low-complexity belief propagation decoding are tested for some well-known regular and irregular LDPC codes. The complexity and performance trade-of...In this paper, both the high-complexity near-ML list decoding and the low-complexity belief propagation decoding are tested for some well-known regular and irregular LDPC codes. The complexity and performance trade-off is shown clearly and demonstrated with the paradigm of hybrid decoding. For regular LDPC code, the SNR-threshold performance and error-floor performance could be improved to the optimal level of ML decoding if the decoding complexity is progressively increased, usually corresponding to the near-ML decoding with progressively increased size of list. For irregular LDPC code, the SNR-threshold performance and error-floor performance could only be improved to a bottle-neck even with unlimited decoding complexity. However, with the technique of CRC-aided hybrid decoding, the ML performance could be greatly improved and approached with reasonable complexity thanks to the improved code-weight distribution from the concatenation of CRC and irregular LDPC code. Finally, CRC-aided 5GNR-LDPC code is evaluated and the capacity-approaching capability is shown.展开更多
基金the National Natural Science Foundation of China(No.10271087).
文摘A random functional central limit theorem is obtained for processes of partial sums andproduct sums of linear processes generated by non-stationary martingale differences. It devel-ops and improves some corresponding results on processes of partial sums of linear processesgenerated by strictly stationary martingale differences, which can be found in [5].
基金Supported by the National Natural Science Foundation of China(11061012)Project Supported by Program to Sponsor Teams for Innovation in the Construction of Talent Highlands in Guangxi Institutions of Higher Learning([2011]47)the Guangxi Natural Science Foundation of China(2012GXNSFAA053010)
文摘Consider a sequence of i.i.d.positive random variables.An universal result in almost sure limit theorem for products of sums of partial sums is established.We will show that the almost sure limit theorem holds under a fairly general condition on the weight dk= k-1 exp（lnβk）,0≤β〈1.And in a sense,our results have reached the optimal form.
文摘In this paper, extracting parallelizatio n from the sum of disjoint products approach is discussed. A general framework of parallelizing disjoint products approach is presented. And a parallel version of the newest disjoint products algorithm is implemented. The results of testing s how the effect is so good to get linear speedups.
文摘In this paper, two-dimensional (2-D) correction scheme is proposed to improve the performance of conventional Min-Sum (MS) decoding of regular low density parity check codes. The adopted algorithm to obtain the correction factors is simply based on estimating the mean square difference (MSD) between the transmitted codeword and the posteriori information of both bit and check node that produced at the MS decoder. Semi-practical tests using software-defined radio (SDR) and specific code simulations show that the proposed quasi-optimal algorithm provides a comparable error performance as Sum-Product (SP) decoding while requiring less complexity.
文摘The objective in this presentation is to introduce some of the unique properties and applications of nullors in active circuit analysis and designs. The emphasis is to discuss the role nullors can play in symbolic representation of transfer functions. To show this we adopt the topological platform for the circuit analysis and use a recently developed Admittance Method (AM) to achieve the Sum of Tree Products (STP), replacing the determinant and cofactors of the Nodal Admittance Matrix (NAM) of the circuit. To construct a transfer function, we start with a given active circuit and convert all its controlled sources and I/O-ports to nullors. Now, with a solid nullor circuit (passive elements and nullors) we first eliminate the passive elements through AM operations. This produces the STPs. Second, the all-nullor circuit is then used to find the signs or the STPs. Finally, the transfer function (in symbolic, if chosen) is obtained from the ratio between the STPs.
文摘In this paper, both the high-complexity near-ML list decoding and the low-complexity belief propagation decoding are tested for some well-known regular and irregular LDPC codes. The complexity and performance trade-off is shown clearly and demonstrated with the paradigm of hybrid decoding. For regular LDPC code, the SNR-threshold performance and error-floor performance could be improved to the optimal level of ML decoding if the decoding complexity is progressively increased, usually corresponding to the near-ML decoding with progressively increased size of list. For irregular LDPC code, the SNR-threshold performance and error-floor performance could only be improved to a bottle-neck even with unlimited decoding complexity. However, with the technique of CRC-aided hybrid decoding, the ML performance could be greatly improved and approached with reasonable complexity thanks to the improved code-weight distribution from the concatenation of CRC and irregular LDPC code. Finally, CRC-aided 5GNR-LDPC code is evaluated and the capacity-approaching capability is shown.
