An independent method for paper [10] is presented. Weighted lattice paths are enumerated by counting function which is a natural extension of Gaussian multinomial coefficient in the case of unrestricted paths. Convolu...An independent method for paper [10] is presented. Weighted lattice paths are enumerated by counting function which is a natural extension of Gaussian multinomial coefficient in the case of unrestricted paths. Convolutions for path counts are investigated, which yields some Vandcrmondc-type identities for multinomial and q-multinomial coefficients.展开更多
Bit-interleaved coded modulation (BICM) is suitable to bandwidth-efficient communication systems. Hybrid automatic repeat request (HARQ) can provide more reliability to high-speed wireless data transmission. A new pat...Bit-interleaved coded modulation (BICM) is suitable to bandwidth-efficient communication systems. Hybrid automatic repeat request (HARQ) can provide more reliability to high-speed wireless data transmission. A new path weight complementary convolutional (PWCC) code used in the type-Ⅱ BICM-HARQ system is proposed. The PWCC code is composed of the original code and the complimentary code. The path in trellis with large hamming weight of the complimentary code is designed to compensate for the path in trellis with small hamming weight of the original code. Hence, both of the original code and the complimentary code can achieve the performance of the good code criterion of corresponding code rate. The throughput efficiency of the BICM-HARQ system wit PWCC code is higher than repeat code system, a little higher than puncture code system in low signal-to-noise ratio (SNR) values and much higher than puncture code system, the same as repeat code system in high SNR values. These results are confirmed by the simulation.展开更多
A graph is introduced,which allows of a combinatorial interpretation of a discrete-timesemi-infinite Lotka-Volterra (dLV) equation.In particular,Hankel determinants used in a determinantsolution to the dLV equation ar...A graph is introduced,which allows of a combinatorial interpretation of a discrete-timesemi-infinite Lotka-Volterra (dLV) equation.In particular,Hankel determinants used in a determinantsolution to the dLV equation are evaluated,via the Gessel-Viennot method,in terms of non-intersectingsubgraphs.Further,the recurrence of the dLV equation describing its time-evolution is equivalentlyexpressed as a time-evolution of weight of specific subgraphs.展开更多
文摘An independent method for paper [10] is presented. Weighted lattice paths are enumerated by counting function which is a natural extension of Gaussian multinomial coefficient in the case of unrestricted paths. Convolutions for path counts are investigated, which yields some Vandcrmondc-type identities for multinomial and q-multinomial coefficients.
基金the National Natural Science Foundation of China(Nos. 60302006 and 60462002)
文摘Bit-interleaved coded modulation (BICM) is suitable to bandwidth-efficient communication systems. Hybrid automatic repeat request (HARQ) can provide more reliability to high-speed wireless data transmission. A new path weight complementary convolutional (PWCC) code used in the type-Ⅱ BICM-HARQ system is proposed. The PWCC code is composed of the original code and the complimentary code. The path in trellis with large hamming weight of the complimentary code is designed to compensate for the path in trellis with small hamming weight of the original code. Hence, both of the original code and the complimentary code can achieve the performance of the good code criterion of corresponding code rate. The throughput efficiency of the BICM-HARQ system wit PWCC code is higher than repeat code system, a little higher than puncture code system in low signal-to-noise ratio (SNR) values and much higher than puncture code system, the same as repeat code system in high SNR values. These results are confirmed by the simulation.
文摘A graph is introduced,which allows of a combinatorial interpretation of a discrete-timesemi-infinite Lotka-Volterra (dLV) equation.In particular,Hankel determinants used in a determinantsolution to the dLV equation are evaluated,via the Gessel-Viennot method,in terms of non-intersectingsubgraphs.Further,the recurrence of the dLV equation describing its time-evolution is equivalentlyexpressed as a time-evolution of weight of specific subgraphs.
