Reduced complexity multi-turbo multi-user detector

Details Reduced complexity multi-turbo multi-user detector Reduced complexity multi-turbo multi-user detector

2005-11-22

2005-11-22

Jeanpierre, Peguy (Department: 2819)

Coded data generation or conversion

Digital code to digital code converters

C375S341000

Reexamination Certificate

active

06967598

ABSTRACT:
A reduced complexity Turbo multi-user detector (MUD) processing system in multiple access communications channels that decreases the likelihood of improper decoding of the final values of interest and decreases the computation complexity for each iteration, thereby allowing for a reduction in the number of iterations performed and lowers the overall complexity without negatively impacting performance. In one form the present invention comprises a multi-user detector coupled to two or more decoder sections, two ore more recoders, and a compare and adjust section in such a manner that data flows iteratively to correct for errors in a computationally efficient manner.

REFERENCES:
patent: 6028897 (2000-02-01), Wang
patent: 6029264 (2000-02-01), Kobayashi et al.
patent: 6166667 (2000-12-01), Park
patent: 6263467 (2001-07-01), Hladik et al.
patent: 6298461 (2001-10-01), Tong et al.
patent: 6430722 (2002-08-01), Eroz et al.
patent: 6499128 (2002-12-01), Gerlach et al.
patent: 6510536 (2003-01-01), Crozier et al.
patent: 6529559 (2003-03-01), Crozier et al.
patent: 6704376 (2004-03-01), Mills et al.
patent: 6801588 (2004-10-01), Yamaguchi
patent: 6831574 (2004-12-01), Mills et al.
patent: 2001/0021233 (2001-09-01), Jin
patent: 2001/0025358 (2001-09-01), Eidson et al.
patent: 2002/0007474 (2002-01-01), Fujita et al.
patent: 2003/0028843 (2003-02-01), Chang et al.
patent: 2003/0138035 (2003-07-01), Mills
patent: 2003/0138065 (2003-07-01), Mills et al.
patent: 2003/0182369 (2003-09-01), MacLeod
patent: 2003/0193966 (2003-10-01), Mills
patent: 2003/0204808 (2003-10-01), Mills
patent: 2004/0017863 (2004-01-01), Learned
patent: 2005/0053173 (2005-03-01), Egnor et al.
Robertson, Patrick et al., “A Comparison of Optimal and Sub-Optimal MAP Decoding Algorithms Operating in the Log Domain”, IEEE, 1995, pp 1009-1013.
Hagenauer, Joachim et al., “A Viterbi Algorithm with Soft-Decision Outputs and its Applications”, IEEE, 1989, pp 1680-1686.
Pottie, Gregory J. et al., “A Comparison of Reduced Complexity Decoding Algorithms for Trellis Codes”, IEEE Journal On Selected Areas in Communications, Dec. 1989, pp 1369-1380, vol. 7 No. 9.
Berrou, Claude et al., “Near Shannon Limit Error—Correcting Coding and Decoding: Turbo-Codes”, IEEE, 1993, pp 1064-1070.
Berrou, Claude et al., “Near Optimum Error Correcting Coding and Decoding: Turbo-Codes”, IEEE Transactions on Communications, Oct. 1996, pp 1261-1271, vol. 44 No. 10.
Wang, Duanyi et al., “Low Complexity MAP Decoding for Turbo Codes”, IEEE, 2000, pp. 1035-1039.
Alexander, Paul D. et al., “Iterative Multiuser Interference Reduction: Turbo CDMA”, IEEE Transactions On Communications, Jul. 1999, pp 1008-1014, vol. 47, No. 7.
Poor, H. Vincent, “Turbo Multiuser Detection: An Overview”, IEEE 6th Int. Symp. on Spread-Spectrum Tech. & Appli., Sep. 6-8 2000, pp 583-587, NJIT, New Jersey.
Wang, Xiaodong et al., “Iterative (Turbo) Soft Interference Cancellation and Decoding for Coded CDMA”, IEEE Transactions On Communications, Jul. 1999, pp 1046-1061, vol. 47 No. 7.
DAS, Suman et al., “Computationally Efficeint Interative Multisuser Detection and Decoding”, IEEE, 1998, pp 631-635.
Herzog, Rupert et al., “Iterative Decoding and Despreading improves CDMA-Systems using M-ary Orthogonal Modulation and FEC”, IEEE, 1997, pp 909-913.
Jin, Hui et al., “Coding Theorems for Turbo Code Ensembles”, Was to be submitted to IEEE Trans. Inform. Theory, Jan. 2001, pp 1-25.
Moher, Michael, “An Interative Multiuser Decoder for Near-Capacity Communications”, IEEE Transactions on Communications, Jul. 1998, pp 870-880, vol. 46 No. 7.
Wang, Xiaodong et al., “Turbo Multiuser Detection For Turbo-Coded CDMA”, IEEE, 1999, pp 1456-1460.
Benedetto, Serglo et al., “Analysis, Design, and Iterative Decoding of Double Serially Concatenated Code with Interleavers”, IEEE Journal on Selected Areas in Communications, Feb. 1998, pp 231-244, vol. 16 No. 2.
Reed, Mark C. et al. “Reduced Complexity Iterative Multi-User Detection for DS/CDMA with FEC”, pp 1-5, date unknown.
Reed, Mark C. et al. “Near Single User Performance using Iterative Multi-User Detection for CDMA with Turbo-Code Decoder”, pp 1-5, date unknown.
Forney, David G., Jr., “Concatenated Codes”, Technical Report, Dec. 1, 1965, pp. 115 total.

Affiliated with

Also associated with

Rating

Reduced complexity multi-turbo multi-user detector does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Reduced complexity multi-turbo multi-user detector, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reduced complexity multi-turbo multi-user detector will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3469836