Please use this identifier to cite or link to this item:
https://dspace.upt.ro/xmlui/handle/123456789/1772
Title: | On the MMSE iterative equalization for TDMA packet systems [articol] |
Authors: | Păun, Adrian-Florin Obreja, Şerban Georgică |
Subjects: | Turbo equalization MMSE filter TDMA systems |
Issue Date: | 2006 |
Publisher: | Timişoara: Editura Politehnica |
Citation: | Păun, Adrian-Florin. On the MMSE iterative equalization for TDMA packet systems. Timişoara: Editura Politehnica, 2006 |
Series/Report no.: | Buletinul ştiinţific al Universităţii „Politehnica” din Timişoara, România. Seria electronică şi telecomunicaţii, Tom 51(65), fasc. 2 (2006), p. 129-134 |
Abstract: | Original turbo equalization using a trellis-based channel equalizer and channel decoder improves significantly the bit error rate performance. However, a large alphabet modulation employed in the systems with multipath channels requires an excessive high number of states in such equalizer, so the optimal maximum a posteriori probability (MAP) becomes prohibitively complex. Therefore, sub-optimum equalizers with a priori information from the channel decoder have to be considered in order to enhance its performance. In this paper we investigate the performances of minimum mean square error (MMSE) filter based iterative equalization for the Enhanced General Packet Radio Service (EGPRS) radio link. The simulation results demonstrate that MMSE turbo equalization constitutes an attractive candidate for single-carrier wireless transmissions with multilevel modulation, in long delay-spread environments. |
URI: | http://primo.upt.ro:1701/primo-explore/search?query=any,contains,On%20the%20MMSE%20iterative%20equalization%20for%20TDMA%20packet%20systems&tab=default_tab&search_scope=40TUT&vid=40TUT_V1&lang=ro_RO&offset=0 Link Primo |
Appears in Collections: | Articole științifice/Scientific articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
BUPT_ART_Păun_f.pdf | 1.49 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.