Personal tools

Near-Optimal Reduced-Complexity Sequence Detectors for TD-HSPA

From iis-projects

Revision as of 17:59, 30 January 2014 by Kgf (talk | contribs) (Created page with "File:Progressive grouping stage with MLD pruning.png|thumb|420px|A tree portion of the progressive grouping stage with MLD pruning, which is used in the pre-processing step ...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search
A tree portion of the progressive grouping stage with MLD pruning, which is used in the pre-processing step in a low-complexity sequence detector.

Date

2012

Personnel

Karim Badawi

Funding

Hasler Foundation

Partners

ACP

Summary

TD-HSPA is a standard that emerged from China initially known as TD-SCDMA, which was later adopted by 3GPP. It uses a TDMA channel access method combined with an adaptive synchronous CDMA component on 1.6 MHz slices of spectrum, allowing deployment in even tighter frequency bands than TD-CDMA.

It exhibits a flexible TDD asymmetric nature giving it an advantage over other 3G standards, and providing a flexible data rate upto 2.8Mbit/s.

TD-HSPA operates over physical channels in multipath propagation conditions, hence, severe inter-symbol interference is experienced by the User Equipment (UE) at high mobility speeds upto 120 km/h.

In order to bring this to practice, clever multiuser detection and equalization techniques have to be deployed at the UE. However, this task is not a trivial one in an environment such as that of the TD-HSPA standard (deploying higher order modulation up-to 64-QAM and multiplexing of up-to 16 CDMA codes).

In this project, novel and well-known techniques such as Zero-Forcing equalizer, MMSE linear equalizer, MMSE-SIC, and MMSE-PIC detectors have been implemented and investigated with focus on their performance/complexity tradeoff. Additionally, a novel guided (non-exhaustive) sequence detection algorithm has been designed and investigated, and its performance was found to approach that of the ideal exhaustive search algorithms..

↑ top