Jocelyn Fiorina

Learn More
In ultra-wideband (UWB) communications based on time-hopping (TH) impulse radio, one of the most frequently studied receivers is the correlation receiver. The multiuser interference (MUI) at the output of this receiver is sometimes modeled as a Gaussian random variable. In order to justify this assumption, the conditions of validity of the Central Limit(More)
In Ultra-Wide Band (UWB) communications based on Time Hopping (TH) Impulse Radio, one of the most frequently studied detectors is the correlation detector also called Single User Matched Filter (SUMF). Often the Multi-User Interference (MUI) at the output of this detector is modeled as a Gaussian random variable. In order to justify this assumption, the(More)
Space-Time Block Codes (STBCs) suffer from a prohibitively high decoding complexity unless the low-complexity decodability property is taken into consideration in the STBC design. For this purpose, several families of STBCs that involve a reduced decoding complexity have been proposed, notably the multi-group decodable and the fast decodable (FD) codes.(More)
The huge potential of Ultra Wide Band Impulse Radio (UWB IR) with Multiple Access was initially evaluated using the Standard Gaussian Approximation which assumed that Multi User Interference could be approximated as classical Gaussian noise. Later the Standard Gaussian Approximation has been proved to be unvalid in several cases. Thus the performance of the(More)
Space-time coding techniques have become common-place in wireless communication standards as they provide an effective way to mitigate the fading phenomena inherent in wireless channels. However, the use of Space-Time Block Codes (STBCs) increases significantly the optimal detection complexity at the receiver unless the low complexity decodability property(More)
Recently, Space-Time Block Codes (STBCs) with fast Maximum-Likelihood Decoding (MLD) have gained a lot of interest from a practical perspective. In [1] and [2], B. Rajan proposed a systematic approach to build such codes from the representations of the real Clifford algebras. In the SariSezginer code [8], another approach was proposed to build fast(More)