Solving the block-Toeplitz least-squares problem in parallel

Alonso, Pedro; Badía, Jordi; Vidal, Antonio M.

doi:10.1002/cpe.883

Cited by 7 publications

(3 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, that reduction in complexity could be expected also from an implementation point of view. Apart from the number of hardware architectures proposed for general QR decomposition [21], parallel algorithms and architectures also exist for block-Toeplitz matrices [22].…”

Section: A Preprocessing Stage Of the Sdmentioning

confidence: 99%

See 1 more Smart Citation

On the Complexity of the Sphere Decoder for Frequency-Selective MIMO Channels

Barbero

Ratnarajah

Cowan

2008

IEEE Trans. Signal Process.

View full text Add to dashboard Cite

Abstract-This paper compares the complexity of the sphere decoder (SD) and a previously proposed detection scheme, denoted here as block SD (BSD), when they are applied to the detection of multiple-input multiple-output (MIMO) systems in frequency-selective channels. The complexity of both algorithms depends on their preprocessing and tree search stages. Although the BSD was proposed as a means of greatly reducing the complexity of the preprocessing stage of the SD, no study was done on how the complexity of the tree search stage could be affected by that reduced preprocessing stage. This paper shows, both analytically and through simulation, that the reduction in preprocessing complexity provided by the BSD has the side effect of increasing the complexity of its tree search stage compared to that of the SD, independent of the signal-to-noise ratio (SNR). In addition, this paper shows how sorting the columns of the frequency-selective channel matrix in the SD does not reduce the complexity of the tree search stage, contrary to what occurs in frequency-flat channels.Index Terms-Detection, frequency-selective channel, multipleinput multiple-output (MIMO), sphere decoder (SD).

show abstract

Section: A Preprocessing Stage Of the Sdmentioning

confidence: 99%

“…Finally, the lower bound of the complexity of the tree search of the BSD can be written as (22) where the lower order terms have been discarded.…”

Section: Tree Search Stage Of the Bsdmentioning

confidence: 99%

On the Complexity of the Sphere Decoder for Frequency-Selective MIMO Channels

Barbero

Ratnarajah

Cowan

2008

IEEE Trans. Signal Process.

View full text Add to dashboard Cite

show abstract

“…Parallel Schur-type algorithms can be found, i.e., in [22] where the least squares problem is solved with a refinement step to improve the accuracy of the solution. Also, the block-Toeplitz case is a practical study in [23,24].…”

Section: Introductionmentioning

confidence: 99%

A multilevel parallel algorithm to solve symmetric Toeplitz linear systems

2007

View full text Add to dashboard Cite

This paper presents a parallel algorithm to solve a structured linear system with a symmetric-Toeplitz matrix. Our main result concerns the use of a combination of shared and distributed memory programming tools to obtain a multilevel algorithm that exploits the actual different hierarchical levels of memory and computational units present in parallel architectures. This gives, as a result, a so-called parallel hybrid algorithm that is able to exploit each of these different configurations. Our approach has been done not only by means of combining standard implementation tools like OpenMP and MPI, but performing the appropriate mathematical derivation that allows this derivation. The experimental results over different representations of available parallel hardware configurations show the usefulness of our proposal.

show abstract

A runtime fault survival method for deployed software during production runs

Seo

Park

Choi

2016

J. Softw. Evol. and Proc.

View full text Add to dashboard Cite

Runtime memory faults during production run should be more thoroughly addressed because they severely affect system availability. This paper proposes a method for mitigating memory faults during production runs of deployed software, thereby ensuring normal system operation until patches to fix the faults are delivered. Furthermore, the method helps enhance debugging efficiency by providing accurate on‐site fault information used by developers to release timely patches. The core of the method is to offer information tagging to identify runtime faults and a fault survival algorithm to provide differentiated fault mitigation according to the runtime state. We implemented ROPHE on a Linux 2.6 platform and conducted an empirical study of representative Linux applications. The results show that the average fault‐handling rate among the applications is 35.75%, whereas the RemOte runtime Protection for High‐risk Error (ROPHE) greatly improves capacity to an average of 91.94%. Specifically, the fault‐handling rates of the applications ranged widely from 7.32% to 62.96%, while ROPHE provided fault‐survival rates in the relatively narrow range of 82.35–97.44%. The experimental results show that the proposed method guarantees the same level of reliability for all applications regardless of their individual fault handling capacity. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

Solving the block-Toeplitz least-squares problem in parallel

Cited by 7 publications

References 33 publications

On the Complexity of the Sphere Decoder for Frequency-Selective MIMO Channels

On the Complexity of the Sphere Decoder for Frequency-Selective MIMO Channels

A multilevel parallel algorithm to solve symmetric Toeplitz linear systems

A runtime fault survival method for deployed software during production runs

Contact Info

Product

Resources

About