Pipelining and number theory for multiuser detection Sridhar Rajagopal and Joseph R. Cavallaro Rice University This work is supported by Nokia, TI, TATP.

Slides:

Advertisements

Similar presentations

Multiuser Detection for CDMA Systems

Advertisements

Real-Time DSP Multiprocessor Implementation for Future Wireless Base-Station Receivers Bryan Jones, Sridhar Rajagopal, and Dr. Joseph Cavallaro.

1 Wireless Communication Low Complexity Multiuser Detection Rami Abdallah University of Illinois at Urbana Champaign 12/06/2007.

EE360: Lecture 8 Outline Multiuser Detection

M. Interleaving Montgomery High-Radix Comparison Improvement Adders CLA CSK Comparison Conclusion Improving Cryptographic Architectures by Adopting Efficient.

Multiplication.

VLSI Arithmetic Adders & Multipliers Prof. Vojin G. Oklobdzija University of California

RICE UNIVERSITY Implementing the Viterbi algorithm on programmable processors Sridhar Rajagopal Elec 696

A bit-streaming, pipelined multiuser detector for wireless communications Sridhar Rajagopal and Joseph R. Cavallaro Rice University

Multiuser Detection (MUD) Combined with array signal processing in current wireless communication environments Wed. 박사 3학기 구 정 회.

Efficient VLSI architectures for baseband signal processing in wireless base-station receivers Sridhar Rajagopal, Srikrishna Bhashyam, Joseph R. Cavallaro,

Reconfigurable Computing - Multipliers: Options in Circuit Design John Morris Chung-Ang University The University of Auckland ‘Iolanthe’ at 13 knots on.

Advanced VLSI Design Unit 05: Datapath Units. Slide 2 Outline  Adders  Comparators  Shifters  Multi-input Adders  Multipliers.

Tinoosh Mohsenin and Bevan M. Baas VLSI Computation Lab, ECE Department University of California, Davis Split-Row: A Reduced Complexity, High Throughput.

FPGA Implementations for Volterra DFEs

RICE UNIVERSITY DSPs for 4G wireless systems Sridhar Rajagopal, Scott Rixner, Joseph R. Cavallaro and Behnaam Aazhang This work has been supported by Nokia,

TI DSPS FEST 1999 Implementation of Channel Estimation and Multiuser Detection Algorithms for W-CDMA on Digital Signal Processors Sridhar Rajagopal Gang.

Efficient VLSI architectures for baseband signal processing in wireless base-station receivers Sridhar Rajagopal Srikrishna Bhashyam, Joseph R. Cavallaro,

RICE UNIVERSITY DSP architectures for wireless communications Sridhar Rajagopal Department of Electrical and Computer Engineering Rice University, Houston.

Multiuser OFDM with Adaptive Subcarrier, Bit and Power Allocation (IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 17, NO. 10, OCTOBER 1999)

RICE UNIVERSITY “Joint” architecture & algorithm designs for baseband signal processing Sridhar Rajagopal and Joseph R. Cavallaro Rice Center for Multimedia.

RICE UNIVERSITY Advanced Wireless Receivers: Algorithmic and Architectural Optimizations Suman Das Rice University Department of Electrical and Computer.

Area: VLSI Signal Processing.

IT253: Computer Organization

RICE UNIVERSITY DSPs for future wireless systems Sridhar Rajagopal.

DSP Architectural Considerations for Optimal Baseband Processing Sridhar Rajagopal Scott Rixner Joseph R. Cavallaro Behnaam Aazhang Rice University, Houston,

Implementing algorithms for advanced communication systems -- My bag of tricks Sridhar Rajagopal Electrical and Computer Engineering This work is supported.

RICE UNIVERSITY On the architecture design of a 3G W-CDMA/W-LAN receiver Sridhar Rajagopal and Joseph R. Cavallaro Rice University Center for Multimedia.

Equalization Techniques By: Mohamed Osman Ahmed Mahgoub.

Implementing Multiuser Channel Estimation and Detection for W-CDMA Sridhar Rajagopal, Srikrishna Bhashyam, Joseph R. Cavallaro and Behnaam Aazhang Rice.

Redundant Number Systems and Online Arithmetic Sridhar Rajagopal June 16, 2000.

Full Tree Multipliers All k PPs Produced Simultaneously Input to k-input Multioperand Tree Multiples of a (Binary, High-Radix or Recoded) Formed at Top.

SR: 599 report Channel Estimation for W-CDMA on DSPs Sridhar Rajagopal ECE Dept., Rice University Elec 599.

Recursive Architectures for 2DLNS Multiplication RESEARCH CENTRE FOR INTEGRATED MICROSYSTEMS - UNIVERSITY OF WINDSOR 11 Recursive Architectures for 2DLNS.

Algorithms and Architectures for Future Wireless Base-Stations Sridhar Rajagopal and Joseph Cavallaro ECE Department Rice University April 19, 2000 This.

Application of Addition Algorithms Joe Cavallaro.

Reconfigurable Computing - Options in Circuit Design John Morris Chung-Ang University The University of Auckland ‘Iolanthe’ at 13 knots on Cockburn Sound,

EEL 5722 FPGA Design Fall 2003 Digit-Serial DSP Functions Part I.

RICE UNIVERSITY Handset architectures Sridhar Rajagopal ASICsProgrammable The support for this work in.

Efficient VLSI architectures for baseband signal processing in wireless base-station receivers Sridhar Rajagopal, Srikrishna Bhashyam, Joseph R. Cavallaro,

Introduction to Intrusion Detection Systems. All incoming packets are filtered for specific characteristics or content Databases have thousands of patterns.

Reconfigurable Computing - Options in Circuit Design John Morris Chung-Ang University The University of Auckland ‘Iolanthe’ at 13 knots on Cockburn Sound,

High Computation Mahendra Sharma. Hybrid number representation The hybrid number representations proposed are capable of bounding the maximum length of.

Optimal Sequence Allocation and Multi-rate CDMA Systems Krishna Kiran Mukkavilli, Sridhar Rajagopal, Tarik Muharemovic, Vikram Kanodia.

Array Multiplier Haibin Wang Qiong Wu. Outlines Background & Motivation Principles Implementation & Simulation Advantages & Disadvantages Conclusions.

CORDIC (Coordinate rotation digital computer)

Sridhar Rajagopal Bryan A. Jones and Joseph R. Cavallaro

Fang Fang James C. Hoe Markus Püschel Smarahara Misra

CORDIC (Coordinate rotation digital computer)

UNIVERSITY OF MASSACHUSETTS Dept

A programmable communications processor for future wireless systems

Sridhar Rajagopal April 26, 2000

Instructor: Dr. Phillip Jones

CSE 575 Computer Arithmetic Spring 2005 Mary Jane Irwin (www. cse. psu

Optimal Sequence Allocation and Multi-rate CDMA Systems

How to ATTACK Problems Facing 3G Wireless Communication Systems

A New Approach to Pipeline FFT Processor

Sridhar Rajagopal and Joseph R. Cavallaro Rice University

Sridhar Rajagopal and Joseph R. Cavallaro Rice University

DSPs for Future Wireless Base-Stations

High Throughput LDPC Decoders Using a Multiple Split-Row Method

On-line arithmetic for detection in digital communication receivers

Data Wordlength Reduction for Low-Power Signal Processing Software

UNIVERSITY OF MASSACHUSETTS Dept

Sridhar Rajagopal, Srikrishna Bhashyam,

DSP Architectures for Future Wireless Base-Stations

On-line arithmetic for detection in digital communication receivers

Suman Das, Sridhar Rajagopal, Chaitali Sengupta and Joseph R.Cavallaro

DSPs for Future Wireless Base-Stations

Restrictive Compression Techniques to Increase Level 1 Cache Capacity

Presentation transcript:

Pipelining and number theory for multiuser detection Sridhar Rajagopal and Joseph R. Cavallaro Rice University This work is supported by Nokia, TI, TATP and NSF

Motivation Several multiuser detection schemes Hardware implementation infeasible Optimize algorithm + hardware Design a reduced complexity multiuser detection algorithm and its implementation for 3GPP W-CDMA

Approaches Algorithm –parallel interference cancellation –reduced complexity, parallel structure Pipelining –bit-streaming, avoid block detection Number theory –Most Significant Digit First (MSDF) computation –sign detection

Contributions decrease detection latency and storage requirements by window length (12X) On-line arithmetic based on MSDF computation –further latency reduction by 1.9X –increase in throughput by 3X –possible savings in area

Outline Parallel interference cancellation Pipelining On-line arithmetic Conclusions Current research directions

Multiuser detection r i-2 r i-1 riri r i+1 Interference from previous bits of other users Interference from future bits of other users Desired user User 1 User j riri bibi b i+1 time

Multiuser detection Optimal - MLSE Decorrelating MMSE Serial/Parallel interference cancellation Top 3 require inversion of matrices Block based detection

Parallel interference cancellation Block based detection

Block detection

Outline Parallel interference cancellation Pipelining On-line arithmetic Conclusions Current research directions

Parallel interference cancellation Block Toeplitz structure - suitable for pipelining

Pipelined detection

Being designed as a class project in Elec 422/423 VLSI class

Outline Parallel interference cancellation Pipelining On-line arithmetic Conclusions Current research directions

Redundant number systems Conventional systems ( , r=10) –radix r has r possible digits Redundant ( , ,…. r=10) –>r possible digits. Limit carry propagation Totally parallel addition/subtraction ONLY.

On-line arithmetic Uses a redundant number system Pipelined bit-serial arithmetic Most Significant Digit First computation Successive computations as soon as  inputs available (  = 1-4, typically) Can do operations such as addition, multiplication, division, square-root etc.

On-line detection and decoding Entire chain can be done on-line Work with hard decisions (sign of MSD) simple way to use softer decisions (2 or more digits)

On-line arithmetic for detection

Conventional arithmetic - matched filter

On-line matched filter

Conventional multiuser detection

On-line multiuser detection

Comparisons N = K =32, d = 8, S = 3, r = 4, t ol = 2, t conv = 1, t stop = 2

Outline Parallel interference cancellation Pipelining On-line arithmetic Conclusions Current research directions

Conclusions Techniques such as pipelining and on-line arithmetic can be used to implement multiuser detection for W-CDMA. Lower latency Higher throughput Smaller area Simple hardware - adders and multipliers

Current research directions Reconfigurable computing -RENE Chameleon - hardware mNIC card