876 research outputs found
Low-complexity dominance-based Sphere Decoder for MIMO Systems
The sphere decoder (SD) is an attractive low-complexity alternative to
maximum likelihood (ML) detection in a variety of communication systems. It is
also employed in multiple-input multiple-output (MIMO) systems where the
computational complexity of the optimum detector grows exponentially with the
number of transmit antennas. We propose an enhanced version of the SD based on
an additional cost function derived from conditions on worst case interference,
that we call dominance conditions. The proposed detector, the king sphere
decoder (KSD), has a computational complexity that results to be not larger
than the complexity of the sphere decoder and numerical simulations show that
the complexity reduction is usually quite significant
A Tight Bound for Probability of Error for Quantum Counting Based Multiuser Detection
Future wired and wireless communication systems will employ pure or combined
Code Division Multiple Access (CDMA) technique, such as in the European 3G
mobile UMTS or Power Line Telecommunication system, but also several 4G
proposal includes e.g. multi carrier (MC) CDMA. Former examinations carried out
the drawbacks of single user detectors (SUD), which are widely employed in
narrowband IS-95 CDMA systems, and forced to develop suitable multiuser
detection schemes to increase the efficiency against interference. However, at
this moment there are only suboptimal solutions available because of the rather
high complexity of optimal detectors. One of the possible receiver technologies
can be the quantum assisted computing devices which allows high level
parallelism in computation. The first commercial devices are estimated for the
next years, which meets the advert of 3G and 4G systems. In this paper we
analyze the error probability and give tight bounds in a static and dynamically
changing environment for a novel quantum computation based Quantum Multiuser
detection (QMUD) algorithm, employing quantum counting algorithm, which
provides optimal solution.Comment: presented at IEEE ISIT 2002, 7 pages, 2 figure
Multiuser MIMO-OFDM for Next-Generation Wireless Systems
This overview portrays the 40-year evolution of orthogonal frequency division multiplexing (OFDM) research. The amelioration of powerful multicarrier OFDM arrangements with multiple-input multiple-output (MIMO) systems has numerous benefits, which are detailed in this treatise. We continue by highlighting the limitations of conventional detection and channel estimation techniques designed for multiuser MIMO OFDM systems in the so-called rank-deficient scenarios, where the number of users supported or the number of transmit antennas employed exceeds the number of receiver antennas. This is often encountered in practice, unless we limit the number of users granted access in the base stationâs or radio portâs coverage area. Following a historical perspective on the associated design problems and their state-of-the-art solutions, the second half of this treatise details a range of classic multiuser detectors (MUDs) designed for MIMO-OFDM systems and characterizes their achievable performance. A further section aims for identifying novel cutting-edge genetic algorithm (GA)-aided detector solutions, which have found numerous applications in wireless communications in recent years. In an effort to stimulate the cross pollination of ideas across the machine learning, optimization, signal processing, and wireless communications research communities, we will review the broadly applicable principles of various GA-assisted optimization techniques, which were recently proposed also for employment inmultiuser MIMO OFDM. In order to stimulate new research, we demonstrate that the family of GA-aided MUDs is capable of achieving a near-optimum performance at the cost of a significantly lower computational complexity than that imposed by their optimum maximum-likelihood (ML) MUD aided counterparts. The paper is concluded by outlining a range of future research options that may find their way into next-generation wireless systems
Turbo receivers for interleave-division multiple-access systems
In this paper several turbo receivers for Interleave-Division Multiple-Access (IDMA) systems will be discussed. The multiple access system model is presented first. The optimal, Maximum A Posteriori (MAP) algorithm, is then presented. It will be shown that the use of a precoding technique at the emitter side is applicable to IDMA systems. Several low complexity Multi-User Detector (MUD), based on the Gaussian approximation, will be next discussed. It will be shown that the MUD with Probabilistic Data Association (PDA) algorithm provides faster convergence of the turbo receiver. The discussed turbo receivers will be evaluated by means of Bit Error Rate (BER) simulations and EXtrinsic Information Transfer (EXIT) charts
4. generĂĄciĂłs mobil rendszerek kutatĂĄsa = Research on 4-th Generation Mobile Systems
A 3G mobil rendszerek szabvĂĄnyosĂtĂĄsa a vĂ©gĂ©hez közeledik, legalĂĄbbis a meghatĂĄrozĂł kĂ©pessĂ©gek tekintetĂ©ben. EzĂ©rt lĂ©tfontossĂĄgĂș azon technikĂĄk, eljĂĄrĂĄsok vizsgĂĄlata, melyek a következĆ, 4G rendszerekben meghatĂĄrozĂł szerepet töltenek majd be. Több ilyen kutatĂĄsi irĂĄnyvonal is lĂ©tezik, ezek közĂŒl projektĂŒnkben a fontosabbakra koncentrĂĄltunk. A következĆben felsoroljuk a kutatott terĂŒleteket, Ă©s röviden összegezzĂŒk az elĂ©rt eredmĂ©nyeket. SzĂłrt spektrumĂș rendszerek KifejlesztettĂŒnk egy Ășj, rĂĄdiĂłs interfĂ©szen alkalmazhatĂł hĂvĂĄsengedĂ©lyezĂ©si eljĂĄrĂĄst. SzimulĂĄciĂłs vizsgĂĄlatokkal tĂĄmasztottuk alĂĄ a megoldĂĄs hatĂ©konysĂĄgĂĄt. A projektben kutatĂłkĂ©nt rĂ©sztvevĆ Jeney GĂĄbor sikeresen megvĂ©dte Ph.D. disszertĂĄciĂłjĂĄt neurĂĄlis hĂĄlĂłzatokra Ă©pĂŒlĆ többfelhasznĂĄlĂłs detekciĂłs technikĂĄk tĂ©mĂĄban. Az elĂ©rt eredmĂ©nyek Imre SĂĄndor MTA doktori disszertĂĄciĂłjĂĄba is beĂ©pĂŒltek. IP alkalmazĂĄsa mobil rendszerekben TovĂĄbbfejlesztettĂŒk, teszteltĂŒk Ă©s ĂĄltalĂĄnosĂtottuk a projekt keretĂ©ben megalkotott Ășj, gyƱrƱ alapĂș topolĂłgiĂĄra Ă©pĂŒlĆ, a jelenleginĂ©l nagyobb megbĂzhatĂłsĂĄgĂș IP alapĂș hozzĂĄfĂ©rĂ©si koncepciĂłt. A tĂ©makörben Szalay MĂĄtĂ© Ph.D. disszertĂĄciĂłja mĂĄr a nyilvĂĄnos vĂ©dĂ©sig jutott. Kvantum-informatikai mĂłdszerek alkalmazĂĄsa 3G/4G detekciĂłra Ăj, kvantum-informatikai elvekre Ă©pĂŒlĆ többfelhasznĂĄlĂłs detekciĂłs eljĂĄrĂĄst dolgoztunk ki. Ehhez Ășj kvantum alapĂș algoritmusokat is kifejlesztettĂŒnk. Az eredmĂ©nyeket nemzetközi folyĂłiratok mellett egy sajĂĄt könyvben is publikĂĄltuk. | The project consists of three main research directions. Spread spectrum systems: we developed a new call admission control method for 3G air interfaces. Project member Gabor Jeney obtained the Ph.D. degree and project leader Sandor Imre submitted his DSc theses from this area. Application of IP in mobile systems: A ring-based reliable IP mobility mobile access concept and corresponding protocols have been developed. Project member MĂĄtĂ© Szalay submitted his Ph.D. theses from this field. Quantum computing based solutions in 3G/4G detection: Quantum computing based multiuser detection algorithm was developed. Based on the results on this field a book was published at Wiley entitled: 'Quantum Computing and Communications - an engineering approach'
Transient behavior of an adaptive synchronous CDMA receiver
A steepest descent algorithm is used to update the adaptive weights of a two-stage synchronous Code-Division Multiple-Access (CDMA) receiver that was proposed recently. An issue of the adaptive CDMA system - the convergence and stability property of the receiver is investigated in this thesis.
This adaptive synchronous CDMA receiver uses a decorrelator at the first stage and adopts a neural network which acts as an interference canceler at the second stage. It can achieve near-optimum performance. Furthermore, its computational complexity is just a square function of the number of users. The only requirement is the knowledge of the users\u27 signature sequences.
The analysis shows that the algorithm for the adaptive weights is convergent and straightforward in implementation. The guaranteed fast convergence of the receiver weights and the tractable theoretical analysis on it, as revealed in this thesis, make this adaptive receiver a promising approach for wireless communications
- âŠ