loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
15th IEEE Symposium on Computer Arithmetic (ARITH-15 '01)
On-line Arithmetic for Detection in Digital Communication Receivers
Vail, Colorado
June 11-June 13
ISBN: 0-7695-1150-3
Sridhar Rajagopal, Rice University
Joseph R. Cavallaro, Rice University
Abstract: This paper demonstrates the advantages of using on-line arithmetic for traditional and advanced detection algorithms for communication systems. Detection is one of the core computationally-intensive physical layer operations in a communication receiver and determines the communication data rates. Detection algorithms typically involve hard decisions (sign based testing) to find the sign of the transmitted information bit. This results in extraneous computations in a conventional number system as the sign is obtained only at the end due to the Least Significant Digit First (LSDF) nature of computations. On-line arithmetic, based on a signed digit number representation, provides Most Significant Digit First (MSDF) computation. Hence, the computations can stop after the first non-zero MSD (sign) is computed and additional computations for the successive digits can be avoided. Back-conversion to a conventional number system is not required as the sign of the digit represents the detected bit. A comparison of a radix-4 serial digit on-line multiuser detector with an 8-bit parallel conventional arithmetic multiuser detector shows a decrease in latency by 1.79X, a 3X increase in throughput, and possible savings in area.
Citation:
Sridhar Rajagopal, Joseph R. Cavallaro, "On-line Arithmetic for Detection in Digital Communication Receivers," arith, pp.0257, 15th IEEE Symposium on Computer Arithmetic (ARITH-15 '01), 2001
Usage of this product signifies your acceptance of the Terms of Use.