Space-time multiuser detectors for TDD-UTRA: design and optimization

Beretta, Marta; Colamonico, A.; Nicoli, Monica; Rampa, Vittorio; Spagnolini, Umberto

doi:10.1109/vtc.2001.956623

Cited by 6 publications

(4 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most of the complexity of the linear detector algorithms employed for MUD scheme proposed in the previous section arises from the inversion methods of the large correlation matrix R and from the matched filter computation [8]. As depicted in Fig.…”

Section: Efficient Detector Algorithmsmentioning

confidence: 99%

“…As far as the matched filter output y MF is concerned, its computational cost dominates using an antenna array (M >> 1); however its calculation has a high degree of parallelism that can be easily exploited during the hardware implementation (e.g. using a polyphase Q-decimated filter bank) [8].…”

Section: Efficient Detector Algorithmsmentioning

confidence: 99%

“…For a complete description of this algorithm, the interested reader is referred to [17]. In addition, references [8] and [23] show a brief comparison of the ACD algorithm performance with respect to the SWD one in the TDD-UTRA and the CWTS scenario, respectively.…”

Section: E Remarksmentioning

confidence: 99%

“…Two main MUD techniques are available in literature: blockbased MUD [2], [3], [4] and one-shot MUD also known as sliding windows detector (SWD) [5]. Both families may be implemented using real-time hardware [4], [6], [7], [8], [9], [10]. In practice, algorithm selection is performed taking into account various aspects such as performance, complexity and implementation issues.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Design and Implementation of a Low Complexity Multiuser Detector for Hybrid CDMA Systems

Rampa

2017

JCOMSS

View full text Add to dashboard Cite

In hybrid CDMA systems, multiuser detection (MUD) algorithms are adopted at the base station to reduce both multiple access and inter-symbol interference by exploitingspace-time (ST) signal processing techniques. Linear ST-MUD algorithms solve a linear problem where the system matrix has a block-Toeplitz shape. While exact inversion techniques impose an intolerable computational load, reduced complexity algorithms may be efficiently employed even if they show suboptimal behavior introducing performance degradation and nearfar effects. The block-Fourier MUD algorithm is generally considered the most effective one. However, the block-Bareiss MUD algorithm, that has been recently reintroduced, shows also good performance and low computational complexity comparingfavorably with the block-Fourier one. In this paper, both MUD algorithms will be compared, along with other well known ones, in terms of complexity, performance figures, hardware feasibility and implementation issues. Finally a short hardware description of the block-Bareiss and block-Fourier algorithms will be presented along with the FPGA (Field Programmable Gate Array) implementation of the block-Fourier using standard VHDL (VHSIC Hardware Description Language) design.

show abstract

Section: Efficient Detector Algorithmsmentioning

confidence: 99%

Section: Efficient Detector Algorithmsmentioning

confidence: 99%

Section: E Remarksmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Design and Implementation of a Low Complexity Multiuser Detector for Hybrid CDMA Systems

Rampa

2017

JCOMSS

View full text Add to dashboard Cite

show abstract

A comparison analysis of prefiltering methods in space-time trellis-based reduced-state turbo-detection

2008

View full text Add to dashboard Cite

National audienceIn this paper, we investigate two different prefiltering strategies, i.e., multiple input multiple output (MIMO) channel shortening and MIMO whitened matched filtering, to decode iteratively a space time bit interleaved coded modulation transmitted over MIMO block fading intersymbol interference channels using a trellis-based post-detector. Indeed, resorting to such front-ends allows significant complexity gain when compared to the optimal maximum a posteriori-based turbo-receiver. While those two approaches have been exhaustively visited in the past, their fair comparison in terms of trade-off between complexity and performance has - to our knowledge - never been tackled before. This paper aims at giving some valuable insights about the respective benefits of these two prefiltering methods with respect to the channel characteristics and overall receiver complexity

show abstract

Multiuser Detector for Hybrid CDMA Systems based on the Bareiss Algorithm

Bifano

Rampa²

Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005.

View full text Add to dashboard Cite

Space-time multiuser detectors for TDD-UTRA: design and optimization

Cited by 6 publications

References 5 publications

Design and Implementation of a Low Complexity Multiuser Detector for Hybrid CDMA Systems

Design and Implementation of a Low Complexity Multiuser Detector for Hybrid CDMA Systems

A comparison analysis of prefiltering methods in space-time trellis-based reduced-state turbo-detection

Multiuser Detector for Hybrid CDMA Systems based on the Bareiss Algorithm

Contact Info

Product

Resources

About