
The authors proposed a fast algorithm to perform the QR decomposition of the FBLP (forward-backward linear prediction) matrix. It is based on exploring the special Toeplitz-Hankel form of the FBLP matrix. The computational complexity is then reduced to 10n/sup 2/+4mn+O(n) The fast algorithm, can also be easily implemented onto a linear systolic array. The number of time steps required is further reduced to 2m+n-1 by using the parallel implementation. >
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
