Báo cáo hóa học: " Research Article Computationally Efficient Partial Crosstalk Cancellation in Fast Time-Varying DSL " pdf

... DSLAM can avoid delay in partial crosstalk cancellation for fast time-varying crosstalk environments. Considering the large number of independent DSL users in the cable, the crosstalk profile and ... will see in this paper, handling time-varying crosstalk is much easier for systems with crosstalk cancella- tion using a joint modem or a shared DSL access multiplexo...

Ngày tải lên: 22/06/2014, 23:20

... sources impinge with the distinct incident directions. Remarks. (1) The proposed EVSA algorithm is still effective in the case of partly coherent or incoherent sources in which there exist two incoherent ... decreases as the SNR increases. Also, the inc rease of intervector sensor spacing, which results in the array aperture extension, 2 EURASIP Journal on Advances in Signal Pr ocessin...

Ngày tải lên: 21/06/2014, 05:20

... Hindawi Publishing Corporation EURASIP Journal on Advances in Signal Processing Volume 2009, Article ID 204351, 6 pages doi:10.1155/2009/204351 Research Article Computationally Efficient ... product of a single window function with the scaling property and that the corresponding distribution is scale covariant as well as being computationally efficient and having reduced interferen...

Ngày tải lên: 21/06/2014, 22:20

... 2 M  p t−1 k + 2 M    r 2t k   2 +   r 2t+1 k   2  (27) with initial value  p 0 k = 1. The metrics in (22) related with coordinate interleaved STB symbols are not suitable for Viterbi decoding. Substitut- ing (23 )in( 22) and using (11), the metrics in ... Communications and Networking two-symbol interleaver is considered between TC and STBC, to the symbol interleaver case. 2....

Ngày tải lên: 22/06/2014, 06:20

... n . (19) Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking Volume 2011, Article ID 738386, 5 pages doi:10.1155/2011/738386 Research Article An Efficient Method ... (35)canbe computed by inverting the formula (36). Taking into account the approximation, we get n ∗ i = ρ i ( 1 − α i ) . (38) Note that in practice the solution n ∗ i is not usually...

Ngày tải lên: 21/06/2014, 05:20

... derivative and its applications,” in Proceedings of the International Conference on Vibrating Engineering, pp. 288–291, Dalian, China, 1998. Advances in Difference Equations 13 00.20.40.60.81 0.2 0.4 0.6 0.8 t 1 u, ... τ  m−μ−1 f m  τ  dτ, 2.2 Hindawi Publishing Corporation Advances in Difference Equations Volume 2011, Article ID 303472, 15 pages doi:10.1155/2011/303472 Research...

Ngày tải lên: 21/06/2014, 05:20

... cross-terms Hindawi Publishing Corporation EURASIP Journal on Advances in Signal Processing Volume 2011, Article ID 725189, 16 pages doi:10.1155/2011/725189 Research Article An Efficient Algorithm for Instantaneous ... component IF MAE obtained using the MBD. (c) Third component IF MAE obtained using the MBD. (d) First component IF MAE obtained using the RIDB. (e) Second component IF...

Ngày tải lên: 21/06/2014, 07:20

... network, the overlapping of superframes in two-hop neighborhood (interference range) is eliminated by interlacing. Typically, interlacing is imple- mented by time div ision, for example in IEEE 802.15.4 ... contains only a source and a destination node. At the beginning of a channel access period, a destination node activates its receiver and begins receiving the channel for possible inco...

Ngày tải lên: 21/06/2014, 11:20

... shown in Columns 5 and 6 (see label Parti. BI in the table). The switching reduction data from the Partial Bus-Invert encoding (PBI) a nd Multiple Partial Bus-Invert (MPBI) encoding are shown in ... the switching activity is mainly determined by the frequently executed loop blocks (named as dominant block in this paper). To find a partition, we use instruction typ es in the domin...

Ngày tải lên: 21/06/2014, 20:20

... 306 ∗ Recursive PCA using two normal sequences as training data ∗∗ Recursive PCA using three normal sequences as training data ∗∗∗ Recursive PCA using four normal sequences as training data orthogonal ... not precise. In the previous works, only the first two normal walking sequences of each individual were used as training data in [20, 22], and the first three were used in [21] as traini...

Ngày tải lên: 21/06/2014, 20:20