In this paper,we exhibit a free monoid containing all prefix codes in connection with the sets of i-th powers of primitive words for all i≥2.This extends two results given by Shyr and Tsai in 1998 at the same time.
由于序列模式挖掘需要花费大量计算时间,并需要占用大量存储空间.减少计算量、节省存储空间开销成为序列模式挖掘的关键.因PrefixSpan算法不产生候选,而适当应用Bitmap数据结构可避免重复扫描数据库,基于此,本文提出了BM-PrefixSpan算法...由于序列模式挖掘需要花费大量计算时间,并需要占用大量存储空间.减少计算量、节省存储空间开销成为序列模式挖掘的关键.因PrefixSpan算法不产生候选,而适当应用Bitmap数据结构可避免重复扫描数据库,基于此,本文提出了BM-PrefixSpan算法,用于序列模式挖掘,设计并构造了PFPBM(Prefix of First Position on BitMap)表用于记录序列中的每个项在位图中第1次出现的位置.实验结果表明,BM-PrefixSpan算法综合了PrefixSpan和SPAM算法的优点,能够更快、更好地挖掘出序列模式.展开更多
A new cyclic prefix(CP)-based nonoverlapping FBMC-QAM(CP-NO-FBMC-QAM)system with two prototype filters is proposed in this paper,which satisfies complex orthogonality conditions and good frequency energy confinement a...A new cyclic prefix(CP)-based nonoverlapping FBMC-QAM(CP-NO-FBMC-QAM)system with two prototype filters is proposed in this paper,which satisfies complex orthogonality conditions and good frequency energy confinement at the same time.We analyze its inter-carrier interference/inter-symbol interference(ICI/ISI)over multipath channels.Owing to the additional CP,the ISI of received symbols over multipath channels is eliminated in the proposed system,and the resulting improvement in the signal-to-interference ratio(SIR)performance is evaluated by theoretical analysis.Moreover,for the ICI caused by multipath propagation in received symbols,we develop a method that eliminates the ICI by frequency-domain channel estimation and equalization before the receiver filtering process.The proposed CP-NO-FBMC-QAM system and ICI cancellation method(ICICM)are validated by comparisons of implementation complexity,power spectral density(PSD),bit error rate(BER)and channel estimation performance with conventional CP-based orthogonal frequency division multiplexing(CP-OFDM)and FBMC-QAM systems.展开更多
基金Supported by the National Natural Science Foundation of China(11861071).
文摘In this paper,we exhibit a free monoid containing all prefix codes in connection with the sets of i-th powers of primitive words for all i≥2.This extends two results given by Shyr and Tsai in 1998 at the same time.
文摘由于序列模式挖掘需要花费大量计算时间,并需要占用大量存储空间.减少计算量、节省存储空间开销成为序列模式挖掘的关键.因PrefixSpan算法不产生候选,而适当应用Bitmap数据结构可避免重复扫描数据库,基于此,本文提出了BM-PrefixSpan算法,用于序列模式挖掘,设计并构造了PFPBM(Prefix of First Position on BitMap)表用于记录序列中的每个项在位图中第1次出现的位置.实验结果表明,BM-PrefixSpan算法综合了PrefixSpan和SPAM算法的优点,能够更快、更好地挖掘出序列模式.
文摘A new cyclic prefix(CP)-based nonoverlapping FBMC-QAM(CP-NO-FBMC-QAM)system with two prototype filters is proposed in this paper,which satisfies complex orthogonality conditions and good frequency energy confinement at the same time.We analyze its inter-carrier interference/inter-symbol interference(ICI/ISI)over multipath channels.Owing to the additional CP,the ISI of received symbols over multipath channels is eliminated in the proposed system,and the resulting improvement in the signal-to-interference ratio(SIR)performance is evaluated by theoretical analysis.Moreover,for the ICI caused by multipath propagation in received symbols,we develop a method that eliminates the ICI by frequency-domain channel estimation and equalization before the receiver filtering process.The proposed CP-NO-FBMC-QAM system and ICI cancellation method(ICICM)are validated by comparisons of implementation complexity,power spectral density(PSD),bit error rate(BER)and channel estimation performance with conventional CP-based orthogonal frequency division multiplexing(CP-OFDM)and FBMC-QAM systems.
