A Near-Optimal Multiuser Detector for MC-CDMA systems Using Geometrical Approach

Najkha, A.; Roland, Christian; Boutillon, Emmanuel

doi:10.1109/icassp.2005.1415850

Cited by 7 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the second sub-section, we show the BDM efficiency to explore communication strategies and their impact in final design, by studying a real application: an Hyper-plane Intersection and Selection HIS algorithm used in MC-CDMA systems (see [9] for more details on the application).…”

Section: Methodsmentioning

confidence: 99%

See 1 more Smart Citation

Exploration and Rapid Prototyping of DSP Applications using SystemC Behavioral Simulation and High-level Synthesis

Thabet

Coussy

Heller

et al. 2008

J Sign Process Syst Sign Image Video Technol

View full text Add to dashboard Cite

Early exploration of communication architectures and timing behaviors is a key step in modern system design flows. This paper proposes a framework for the design space exploration of DSP applications. The proposed approach is based on four main abstraction levels: algorithmic, architectural (communication interface), behavioral (I/O timing diagram) and RTL. The system specification is based on a set of Behavioral Description Models (BDM) which communicate through channels: each BDM represents a hardware component. For this purpose, a BDM (1) embeds a sequential function-that describes the computing algorithm to be implemented-into a module and (2) includes a set of I/O and control processes. Communication architectures and timing behaviors (I/O scheduling, I/O parallelism...) of each BDM can be modified and easily explored by adding I/O and control code into the dedicated concurrent processes. This allows keeping the description of the functionality unchanged throughout the refinement steps. The high-level synthesis tool GAUT is next used to generate, from the unmodified sequential function, the RTL architectures that respect the constraints i.e. the refined I/O timing behavior. The use of BDMs for the system description allows the designer to simulate and to evaluate several communication architectures and several timing behaviors during the performance analysis phase. The interest of our approach is shown through the case study of a Hyper-plane Intersection and Selection HIS algorithm for MC-CDMA system.

show abstract

Section: Methodsmentioning

confidence: 99%

“…Let sm i (n) represents the path metric for state i, and bm ij (n), the branch metric of a corresponding transition from state i to state j, with the time step denoted by n. Then, an example of the ACS recursion corresponding to state 0 is shown in (9).…”

Section: Educational Example Of An Add-compare-select Acs Componentmentioning

confidence: 99%

Exploration and Rapid Prototyping of DSP Applications using SystemC Behavioral Simulation and High-level Synthesis

Thabet

Coussy

Heller

et al. 2008

J Sign Process Syst Sign Image Video Technol

View full text Add to dashboard Cite

show abstract

“…In non-linear iterative detectors [48]- [52], probabilistic data association (PDA) [53] aims to suppress the MAI in each iteration in order to improve the overall error performance. Suboptimal polynomial time detectors that are based on the geometric approach are studied in [54], [55].…”

Section: Introductionmentioning

confidence: 99%

Low-Complexity Decoder for Overloaded Uniquely Decodable Synchronous CDMA

et al. 2022

View full text Add to dashboard Cite

We consider the problem of designing a low-complexity decoder for antipodal uniquely decodable (UD) /errorless code sets for overloaded synchronous code-division multiple access (CDMA) systems, where the number of signals K a max is the largest known for the given code length L. In our complexity analysis, we illustrate that compared to maximum-likelihood (ML) decoder, which has an exponential computational complexity for even moderate code lengths, the proposed decoder has a quasi-quadratic computational complexity. Simulation results in terms of bit-error-rate (BER) demonstrate that the performance of the proposed decoder has only a 1 − 2 dB degradation in signal-to-noise ratio (SNR) at a BER of 10 −3 when compared to ML. Moreover, we derive the proof of the minimum Manhattan distance of such UD codes and we provide the proofs for the propositions; these proofs constitute the foundation of the formal proof for the maximum number users K a max for L = 8.

show abstract

“…In non-linear iterative detectors [12] - [14] and in probabilistic data association (PDA) [15] the aim is to suppress the MAI in each iteration in order to improve the overall error performance. Suboptimal polynomial time detectors that are based on the geometric approach are studied in [16] - [17].…”

Section: Introductionmentioning

confidence: 99%

Fast Decoder for Overloaded Uniquely Decodable Synchronous Optical CDMA

Kulhandjian

D’Amours

et al. 2019

2019 IEEE Wireless Communications and Networking Conference (WCNC)

View full text Add to dashboard Cite

In this paper, we propose a fast decoder algorithm for uniquely decodable (errorless) code sets for overloaded synchronous optical code-division multiple-access (O-CDMA) systems. The proposed decoder is designed in a such a way that the users can uniquely recover the information bits with a very simple decoder, which uses only a few comparisons. Compared to maximum-likelihood (ML) decoder, which has a high computational complexity for even moderate code lengths, the proposed decoder has much lower computational complexity. Simulation results in terms of bit error rate (BER) demonstrate that the performance of the proposed decoder for a given BER requires only 1 − 2 dB higher signal-to-noise ratio (SNR) than the ML decoder.

show abstract

A Near-Optimal Multiuser Detector for MC-CDMA systems Using Geometrical Approach

Cited by 7 publications

References 10 publications

Exploration and Rapid Prototyping of DSP Applications using SystemC Behavioral Simulation and High-level Synthesis

Exploration and Rapid Prototyping of DSP Applications using SystemC Behavioral Simulation and High-level Synthesis

Low-Complexity Decoder for Overloaded Uniquely Decodable Synchronous CDMA

Fast Decoder for Overloaded Uniquely Decodable Synchronous Optical CDMA

Contact Info

Product

Resources

About