An Efficient Circulant MIMO Equalizer for CDMA Downlink: Algorithm and VLSI Architecture



EURASIP Journal on Applied Signal Processing

Stage 1


Stage 2


Stage 3


Stage 4


x(0) = 0

x(8) = 0

x(4)

x(12) = 0

x(2)

x(10) = 0

x(6) = 0

x(14) = 0

x(1)

x(9) = 0

x(5) = 0

x(13) = 0

x(3)

x(11) = 0

x(7) = 0

x(15) = 0


x

x

x

x

x

Figure 3: Reduced-state FFT butterfly tree.


Wι06∕Λ λ.>∙∕AΛΛ

> .∩, ' >. V < у ∕v '∙v >

1

W 6, А л Λ∕'.A.'∖ √

> / >

Wг i I W À Y \ \
ʌ
W16'∙∕ΛV√'.


W136
÷-O∕τ
w 4б//
÷-CUΛ

W 15б/ /


W 6б/ /
÷-0-'-A

W 7б-'
÷-Oi-∙


-γ-∙->


unit, each operation involves a full complex multiplication,
which has 4 real multiplications and г real additions. Since
the
kth subcarrier of the Fmm vector is


fmm (k) = emm (0)+2%


i=1


emm(i)WL-Fki ,


Table 1: Complexity comparison for different FFT schemes.

(13)

Real mult

Real add

Full FFT

2Lp log2 Lp

Lplog2 Lp

RS-FFT w/o ZP

2N log2 Lp - 2Lp + 2

Lp log2 Lp - 2Lp +2

RS-FFT with ZP

2Lp log2 Lp - 6Lp + 12

Lp log2 Lp - 4Lp + 12


by defining the input sequence to the FFT module as {x(i)} =
[0, emm(1),..., em,m(L), 0, ..., 0], we only need to compute
the real part FFT of the
x(i) to get fmm(k). From the but-
terfly decomposition, we have the recursion for the real-part
FFT computation as

% ( X ( к )) = % ( X 1( к )) + % ( WkpX2( к )),
%{X{к + L2p)) =%(X 1(к)) -%(WkpX2(к))

(14)


for к = 0, 1, ...,Lp/2 - 1. This reduces the complex multi-
plication and addition to only real multiplication and addi-
tion for one stage. The butterfly unit becomes a reduced-state
partial-butterfly-unit (PBFU) as the dotted line units shown
in
Figure 3 for an example of 16-point FFT.

From the recursion, it can be shown that we can prune
the redundant computations by replacing the complex mul-
tiplication in the butterfly units for some portion of the FFT
BFU tree. Before considering the many zeros in the input
coefficients, the total number of PBFU is
Lp - 1. Since the
total number of BFU is (
Lp/2) log2 Lp, the total number of
full-BFU (FBFU) is given by (
Lp/2) log2 Lp - Lp + 1. Con-
sidering that
x(i) = 0onlyfori [1, L], L<Lp/2, we can
further truncate the computations related to the zero values.
After pruning all the unnecessary BFU branches, the FBFUs
and PBFUs only take effects from stage 3. The number of
FBFU is reduced to (
Lp/2) * log2 Lp - 2Lp + 6. This also
reduces the number of memory access and register files for
stage 1 and stage 2 as well as in the partial BFUs. The fi-
nal data flow is shown as the BFU tree in
Figure 3. In the
figure, only the shaded portion has full-BFUs.
Table 1 sum-
marizes the required operations in terms of the real mul-
tiplications/additions and memory read/write. In the table,
RS-FFT indicates the reduced-state FFT- and ZP-means zero
pruning. Although the saving diminishes when the length of
FFT increases to a very large number, the RS-FFT with ZP



More intriguing information

1. Lumpy Investment, Sectoral Propagation, and Business Cycles
2. CGE modelling of the resources boom in Indonesia and Australia using TERM
3. Modelling the Effects of Public Support to Small Firms in the UK - Paradise Gained?
4. A Review of Kuhnian and Lakatosian “Explanations” in Economics
5. Improving behaviour classification consistency: a technique from biological taxonomy
6. Equity Markets and Economic Development: What Do We Know
7. Credit Markets and the Propagation of Monetary Policy Shocks
8. The name is absent
9. The name is absent
10. The Role of Land Retirement Programs for Management of Water Resources