Learn More
Adaptive filtering has been an enabling technology and has found ever-increasing applications in various state-of-the-art communication systems. Traditionally, adaptive filtering has been developed based on the Wiener or minimum mean square error (MMSE) approach, and the famous least mean square algorithm with its low computational complexity readily meets(More)
Based on an EXtrinsic Information Transfer (EXIT) chart-assisted receiver design, a low-complexity near-Maximum A Posteriori (MAP) detector is constructed for high-throughput systems. A high throughput is achieved by invoking high-order modulation schemes or multiple transmit antennas, while employing a novel sphere detector (SD) termed as a center-shifting(More)
Low-Density Parity Check (LDPC) error correction decoders have become popular in diverse communications systems, owing to their strong error correction performance and their suitability to parallel hardware implementation. A great deal of research effort has been invested into the implementation of LDPC decoder designs on Field-Programmable Gate Array(More)
Low-Density Parity Check (LDPC) error correction decoders have become popular in communications systems, as a benefit of their strong error correction performance and their suitability to parallel hardware implementation. A great deal of research effort has been invested into LDPC decoder designs that exploit the flexibility, the high processing speed and(More)
In this paper, we propose the novel concept of Repeat Accumulate Code Division Multiple Access (RA-CDMA), which employs unique, user-specific channel code generator matrices (interleavers) for differentiating the users. We also suggest a Multilevel Structured (MLS) interleaver generation technique for the sake of reducing the memory storage requirements of(More)
The iterative exchange of extrinsic information between the K-best sphere detector (SD) and the channel decoder is appealing since it is capable of achieving a near maximum a posteriori (MAP) performance at a moderate complexity. However, the computational complexity imposed by the K-best SD significantly increases when using a large value of K for the sake(More)
When the maximum number of best candidates retained at each tree search level of the K-Best Sphere Detection (SD) is kept low for the sake of maintaining a low memory requirement and computational complexity, the SD may result in a considerable performance degradation in comparison to the full-search based Maximum Likelihood (ML) detector. In order to(More)
A generically applicable hybrid multiuser detector (MUD) concept is proposed by appropriately activating different MUDs in consecutive turbo iterations based on the mutual information (MI) gain. It is demonstrated that the proposed hybrid MUD is capable of approaching the optimal Bayesian MUD’s performance despite its reduced complexity, which is at a(More)
A novel iterative multiuser detector (MUD) is proposed for employment in space division multiple access (SDMA) aided orthogonal frequency division multiplexing (OFDM) systems, where the uplink transmissions of the users share the same bandwidth. The individual users' signals are differentiated with the aid of their unique user-specific channel impulse(More)
Iterative multiuser receivers constitute an effective solution for transmission over Multiple Access Interference (MAI) infested channels, when invoking a combined multiuser detector and channel decoder. Most reduced-complexity methods in this area use the Complex-valued Minimum Mean Squared Error (CMMSE) Multiuser Detector (MUD). Since the desired output(More)