Paper - FPGA Design of A Reduced Complexity Sphere Decoder ForWireless Applications
Paper - FPGA Design of A Reduced Complexity Sphere Decoder ForWireless Applications
Abstract
0XOWLSOHLQSXWDQGPXOWLSOHRXWSXW 0,02 WHFKQRORJ\KDVEHHQZLGHO\DSSOLHGLQZLUHOHVVFRPPXQLFDWLRQVVLQFHLWRIIHUVVLJQL¿FDQW
increases in data throughput a link range without additional bandwidth or increased transmit power. In this project, a MAP Algorithm
for Multi input Multi Output (MIMO) Sphere Decoder for wireless applications is proposed. FEC (Forward Error Correction)
Algorithm for sphere decoder to reduce its error rate and its VLSI architecture is also proposed for the iterative MIMO receiver.
7KHGHHSO\SLSHOLQHGDUFKLWHFWXUHHPSOR\VWKHRSWLPL]HGK\EULGHQXPHUDWLRQVHDUFKIRUWKHEHVWFKLOGQRGHWRHVWLPDWHHI¿FLHQWO\
By adding the counterhypotheses in parallel with other candidates, the proposed iterative MIMO detector improves the detection
SHUIRUPDQFHVLJQL¿FDQWO\ZLWKORZGHWHFWLRQODWHQF\&RPSDUHGZLWKSUHYLRXVORZFRPSOH[LW\WHFKQLTXHVWKLVZRUNUHGXFHVJDWH
FRXQWVZKHQFRPSDUHGZLWKH[LVWLQJPHWKRGDQGUHTXLUHVRQO\DRQHOLQHEXIIHUPHPRU\7KLVSURSRVHGELRUWKRJRQDOEDVHGVSKHUH
GHFRGHUV\VWHPLVGHVLJQHGXVLQJ9HULORJ+'/VLPXODWHGXVLQJ0RGHOVLP6RIWZDUHDQGV\QWKHVL]HGXVLQJ;LOLQ[3URMHFW1DYLJDWRU
Keywords
FEC, MIMO, Power, Sphere, Latency and Hybrid.
)LJ$UFKLWHFWXUHRI3($ )LJ$UFKLWHFWXUHRI3(&
Moreover, the best node ZLWKWKHPLQLPXP0$DWHDFKOHYHOLV 7KH EHVW FKLOG HVWLPDWH VHOHFWLRQ XQLW %&68 UHFHLYHV WKH
DOVRLGHQWL¿HGDQGEXIIHUHGLQ&*8DFFRUGLQJWRWKHVLJQRI/$i,b
ZKLFKDYRLGVIXOOVRUWLQJRIWKHVHW^0$ Vi `7KH//5FDOFXODWLRQ SDUWLDO0$3QRGH DQG¿QGVLWVEHVWFKLOGHVWLPDWH by
XQLW /&8 LQWKHODVWVWDJHFDOFXODWHVWKH//5VRIHDFKWUDQVPLWWHG
HPSOR\LQJWKH2+(MXVWWKHVDPHDVLWLVLQ3(%7KHFDQGLGDWH
ELWDFFRUGLQJWR EDVHGRQWKHFDQGLGDWHOLVWVL and L+. DGGLQJXQLW &$8 XVHVELWÀLSSLQJVWUDWHJ\WRDGGWKUHHVLEOLQJ
nodes of , which feed forward to a multiplexer, and only one
B. Processing element (PE-B) Architecture: of them is selected per cycle for MP computation. The serial
PE-B is used to implement the single expansion where only the best computation method saves the number of MP FRPSXWDWLRQEORFNV
QRGHHVWLPDWHLVVHOHFWHGDQGSUHVHUYHGXVLQJWKHSURSRVHG2+( LQ&$8E\DQGUHGXFHVWKHQXPEHURI3(%VIROORZLQJLQ
the subsequent stages compared to the parallel method, without
impacting the throughput of the whole architecture.
(1)
(2)
)LJ$UFKLWHFWXUHRI3(%
(3)
$VVKRZQLQ)LJWKHLQWHUIHUHQFHFDQFHOODWLRQXQLW ,&8 LQ
PE-B computes in (1) to eliminate the inter antenna interference :KHUH denotes the bth bit.
introduced by previously detected symbols. To enumerate the best
child node with the minimum MC, a quantization step Q is E. LLR Calculation Unit (LCU)
UHTXLUHGWR¿QGWKHV\PEROZKLFKLVQH[WWR /Ri,i7KH+(XQLW 7KH//5 ORJOLNHOLKRRGUDWLR &DOFXODWLRQ8QLWLVXVHGWRFDOFXODWH
+(8 FKRRVHVsCA,i DFFRUGLQJWRVWHS RIWKH2+(PHWKRG WKHOLNHOLKRRG¶VEHWZHHQWKHWZRRUPRUHGDWDPRGHOV,Q/&8
XQLW0$3 PD[LPXPa posteriori) algorithm is proposed to reduce
WKHKDUGZDUHFRPSOH[LW\DQG)(& )RUZDUG(UURU&RUUHFWLRQ
is also proposed to reduce its bit error rate during transmission.
7KHSURSRVHG/&8DUFKLWHFWXUHFRQVLVWVRIF\FOLFVKLIWUHJLVWHU
;25 PDWUL[ PDMRULW\ JDWH DQG FRQWURO XQLW7KH F\FOLF VKLIW
UHJLVWHUZLOOVHQGWKHLQSXWVWRHDFKÀLSÀRSVDQGWKHRXWSXWVDUH
IHGEDFNLQDF\FOLFPDQQHU,Q;250DWUL[WKHYDOXHVDUHWDNHQ
IURPWKHVKLIWUHJLVWHU$QGWKHVHYDOXHVDUH;25RQHE\RQH
$QG3DULW\FKHFNVXPLVSHUIRUPHG7KDWLVFRXQWLQJWKHQXPEHU
of zeros and ones. If number of ones is greater than zeros error
correction is performed. Otherwise the bits are under gone cyclic
VKLIW7KHVH3URFHVVHVDUHGRQHLQ0DMRULW\*DWH$QGLWFDQEH
done until all the bits are evaluated.
)LJ)(&7UDQVPLWWHU
7KHIRUZDUGHUURUFRUUHFWLRQFRGHLVJLYHQEHORZ
r0=a2+a1+a0 modulo-2
r1=a3+a2+a1 modulo-2
r2=a1+a0+a3 modulo-2
7KH)(&UHFHLYHULVVKRZQLQ¿JWKDWFRQVLVWVRIELWVIURPWKH
WUDQVPLWWHUDQGWKHELWVDUHJLYHQWRWKHFKHFNHUDQGIRUHDFKELW
the syndrome value will be estimated using the code given below.
7KHFRUUHFWLRQORJLFDQDO\]HUZLOOFKHFNIRUHUURUDFFRUGLQJWR
the calculated syndrome values using the Table I shown below.
)LJ3URSRVHG'HFRGHU$UFKLWHFWXUH
)LJ)(&5HFHLYHU
6\QGURPHHVWLPDWLRQ
60=b2+b1+b0+q0 modulo-2
61=b3+b2+b1+q1 modulo-2
62=b2+b1+b0+q2 modulo-2
7DEOH/RJLFDOGHVLJQPDGHE\FRUUHFWLRQORJLFDQDO\]HULQ
)(&UHFHLYHU
Syndrome 000 001 010 011 100 101 110 111
)LJ$UFKLWHFWXUHRI&RQWURO8QLW
Error 1RQH q0 q1 b2 q2 b0 b3 b1
7KH)(&WUDQVPLWWHULVVKRZQLQ¿J7KHJHQHUDWRUUHFHLYHV
DGDWDZRUGDQGJHQHUDWHVSDULW\FKHFNELWVDORQJZLWKWKHGDWD
ZRUG(DFKRIWKHSDULW\FKHFNELWVKDQGOHVRXWRIELWVRIWKH MAP Algorithm:
data word using forward error correction code. The forward error 0$3DOJRULWKPLVXVHGWR¿QGWKHHUURULQPXOWLELWVDQGLWDOVR
correction code for transmitter is given below. reduces the hardware complexity.