1

The Next Generation Challenge for Software Defined Radio

Mark Woh1, Sangwon Seo1, Hyunseok Lee1, Yuan Lin1, Scott Mahlke1, Trevor Mudge1, Chaitali Chakrabarti2, Krisztian Flautner3
1 2

Advanced Computer Architecture Lab, University of Michigan Department of Electrical Engineering, Arizona State University 3 ARM, Ltd.

3G Wireless

Large Coverage
Outdoor - High Mobility Up to 14Mbps

University of Michigan -SAMOS 2007

Expected Wireless Growth

The growth of wireless will require more bandwidth

University of Michigan -SAMOS 2007
3

4G Wireless
Macro Cells
Pico Cells

Isolated HotSpots 1Gbps Coverage Large Coverage 100Mbps Coverage Outdoor - High Mobility Indoor Very Low Mobility

What we need
Adaptive high performance transmission system Great candidate for SDR
University of Michigan -SAMOS 2007
4

Next Generation Wireless 4G

IFFT

MOD (OFDM)

MIMO encoder

Channel Encoder

...

...

TX

Antenna DEMOD (OFDM)

FFT

MIMO decoder
STBC VBLAST

Channel Decoder
Turbo code LDPC code

3 Major Components to 4G

Modulation/Demodulation Multiple-Input Multiple-Out (MIMO) Channel Decoder/Encoders

University of Michigan -SAMOS 2007

...

...

RX

Modulation - OFDM
Properties of OFDM -High Spectral Efficiency -Low Intersymbol Intereference -Flat Fading Subcarriers Can sustain high data rates with multiple users

-Nfsc

-fsc

fsc

Nfsc

Can be implemented with IFFT/FFT

University of Michigan -SAMOS 2007

Major Component of Modulation FFT/IFFT

x[0]

complex add

X[0]

x[1]

complex mult

complex sub

X[1]

eiw

Very wide data level parallelism Requires complex operations

University of Michigan -SAMOS 2007
7

MIMO (Multiple Input Multiple Out)

Previously we used single antenna systems Now we use multiple antennas to increase the channel
capacity

Diversity - High Reliability Space Time Block Codes (STBC)

Multiplexing High Throughput Vertical-BLAST (V-BLAST)

University of Michigan -SAMOS 2007

Space Time Block Codes (STBC)

-x[2]* x[1] Transmit Antennas Channel Receive Antennas Tx1
h11 h21 h12 h22

x[1]*

Time
x[2] Tx2

Rx1
n11 n12

Rx2
n21 n22 y21 = h21x[1] + h22x[2] + n21 y22 = -h21x[2]* + h22x[1]* + n22 h21

Noise Received Signal

y11 = h11x[1] + h12x[2] + n11 y12 = -h11x[2]* + h12x[1]* + n12 h11

Channel Estimation

Combiner
h12 ~x[1] ~x[2] h22

Channel Estimation

~x[1] = h11*y11 + h12y12* + h21*y21 + h22y22* ~x[2] = h12*y11 - h11y12* + h22*y21 - h21y22*
University of Michigan -SAMOS 2007
9

STBC
Receiver Antenna 1 and 2 y21 y11 y22* y12*

10

Complex Multiply

Accumulate

~x[1] ~x[2]

h22 h21 h12 h11 Channel Estimation

Conjugate +Negation

Requires complex operations Low Data Movement Highly parallelizable

University of Michigan -SAMOS 2007

10

Vertical-BLAST (V-BLAST)
Mod
Demod

11

S/P

V-Blast Detector Mod M Transmitters Channel Estimation Nulling Vector

Demod

R Receivers

8 1 2 3 4

10

11

12

10

11

12

10

11

12

Strongest Signal Linear Combination of Data Subtract Strong Signal Repeat

13

14

15

16

13

14

15

16

13

14

15

16

Data Stream of 4 Tx

University of Michigan -SAMOS 2007

11

V-BLAST
Implementation Based on Square Root Method for V-BLAST
Original requires repeated pseudo-inverse calculation for finding the Complexity Requires matrix operations on complex numbers Many Matrix Transformations
strongest signal This algorithm has reduces complexity

12

University of Michigan -SAMOS 2007

12

Channel Decoding
3G Technologies in 4G
Viterbi Turbo Decoder New to 4G LDPC Better performance characteristics compared to Turbo and Viterbi

13

University of Michigan -SAMOS 2007

13

LDPC
L Node L0 L1 L2 L3 L4 L5 L6 L7
H=

14

Original Value 1 1 0 1 0 1 0 0 1
1 0 1

Message from Check Nodes Decision E1 0 E0 0 E1 1 E0 0 E0 1 E1 0 E2 0 1 1 E0 1

0 0 1 0 0 1

1 1 0 0

0 1 1 0

E3 1 E1 0 E2 0 E3 1 E3 0 E2 1 E3 0 0 0 1 E2 1
1 1 0 0 1 1 0 1 0

1 0 0 1 0 1 0 1

E0

E1

E2

E3

L0
1

L1
1

L2
0

L 3 L4
1 0

L5
1

L6
0

L7
1

Message Sent = [ 1 Message Recieved = [ 1

University of Michigan -SAMOS 2007

0 1

0 0

1 1

0 0

1 1

0 0

1] 1]
14

LDPC

15

Min-Sum Decoding Used Regular LDPC code Can get benefit from Wide SIMD
Can do the Bit Node and Check Node Alignment of Check and Bit nodes is a problem

University of Michigan -SAMOS 2007

15

SODA PE Architecture
SODA DSP 3. Local memory 1. SIMD pipeline
Pred. Regs

16

SIMD ALU+ Mult

W B

5. DMA

Local SIMD Memory

SIMD Reg. File

E X

SIMD Shuffle Network (SSN)

W B

System Interconnect

Global Memory

RF
DMA S T V

ALU

SIMD to Scalar (VtoS)

V T S

Local Scalar Memory

2. Scalar pipeline
Scalar RF
E X

Scalar ALU

W B

AGU RF

E X

AGU ALU

W B

4. AGU pipeline

SIMD 32 Wide, 16-bit datapath, Predicate Execution

University of Michigan -SAMOS 2007
16

4G Workload on SODA
Key 4G algorithms FFT IFFT STBC V-BLAST LDPC 100 Mbps MCycle/s 2x360 2x360 240 7700 1 Gbps MCycle/s 4x360 4x360 1900 4x18500

17

100 Mbps 4G requires 8Ghz SODA PE 1 Gbps 4G requires 20Ghz SODA PE

University of Michigan -SAMOS 2007

17

SODA With Technology Scaling

4000 3500 0.8 0.7 0.6 0.5 0.4 0.3 0.2 0.1 0 180nm 130nm 90nm 65nm 45nm 32nm 22nm

18

Frequency (Mhz)

3000 2500 2000 1500 1000 500 0

ITRS Scaled Frequency

Fixed Scaled Frequency

Scaled Power

180nm Vdd (V) 1.8

130nm 1.3

90nm 1.1

65nm 1.1

45nm 1

32nm 0.9

Power (W)

22nm 0.8

University of Michigan -SAMOS 2007

18

SDR Challenges In 4G
We cant do any of 4G with technology scaling on one core

Would 8GHz cores even be an energy efficient solution? What about 1Gbps? Are we ever going to get a 20GHz core? Cannot rely on technology scaling to give us 4G for free 4G SDR will require algorithmic and architectural innovations

19

University of Michigan -SAMOS 2007

19

4G Algorithm-Architectural Co-design
Architectural improvements (SODA II)
Specialized functional units
CISC-like complex arithmetic operations

20

Specialized data movement hardware

Less strain on the memory system

Wider SIMD How wide can we go? More PEs What does the interconnect look like? Algorithmic optimization through parallelization Reduce intra-kernel communication Reduce memory accesses Arithmetic is much cheaper than data movement

University of Michigan -SAMOS 2007

20

Thanks
Questions?

21

University of Michigan -SAMOS 2007

21

Successive Cancelling for V-BLAST

22

V-BLAST successive interference cancelling (SIC)

The ith ZF-nulling vector wi is defined as the unique

minimum-norm vector satisfying

Orthogonal to the subspace spanned by the contributions to yi due

to the symbols not yet estimated and cancelled and is given by the ~ ith row of H

University of Michigan -SAMOS 2007

22

Alamouti Scheme

23

Assumption: the channel remains unchanged over two consecutive symbols

Rate = 1 Diversity order = 2 Simple decoding

University of Michigan -SAMOS 2007

23

Advantages of Software Defined Radio

Multi-mode operations Lower costs

Faster time to market Prototyping and bug fixes Chip volumes Longevity of platforms
802.16a UWB EDGE 802.16a

24

SDR Bluetooth

Enables future wireless communication

innovations Cognitive radio

802.11b

WCDMA

802.11n

University of Michigan -SAMOS 2007

24