Keith Chugg's CV - The Communication Sciences Institute ...
Keith Chugg's CV - The Communication Sciences Institute ...
Keith Chugg's CV - The Communication Sciences Institute ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
<strong>Keith</strong> M. Chugg – Curriculum Vita – October 12, 2007 9<br />
Publications<br />
http://csi.usc.edu/chugg/research/publications.shtml<br />
Books Published<br />
B-1. K. M. Chugg, A. Anastasopoulos, and X. Chen, Iterative Detection: Adaptivity, Complexity<br />
Reduction, and Applications, Kluwer Academic Press, 2001.<br />
Book Chapters<br />
BC-1. A. Polydoros and K. M. Chugg, “Per-Survivor Processing (PSP),” Chapter 2 in Wireless<br />
<strong>Communication</strong>s: TDMA vs. CDMA (Eds. S. G. Glisic and P. A. Leppänen), KAP, 1997;<br />
(also presented at PIMRC 1997, Oulu, Finland, Sept. 1997).<br />
BC-2. K. M. Chugg, “Iterative Detection in <strong>Communication</strong> Systems,” chapter in Wiley Encyclopedia<br />
of <strong>Communication</strong>s, J.G. Proakis (editor), Dec. 2002.<br />
Journal Articles under Review<br />
JR-1. T. R. Halford and K. M. Chugg, “<strong>The</strong> extraction and complexity limits of graphical models<br />
for linear codes,” November 2006, submitted to the IEEE Trans. Information <strong>The</strong>ory.<br />
JR-2. J. Melzer and K. M. Chugg, “Systematic with serially concatenated parity codes,” 2006,<br />
submitted to IEEE Trans. <strong>Communication</strong>s.<br />
JR-3. T. R. Halford and K. M. Chugg, “Random redundant iterative soft-in soft-out decoding,”<br />
submitted to IEEE Trans. <strong>Communication</strong>s.<br />
JR-4. P. Kim and K. M. Chugg, “Capacity for complex linear STBCs with multiple rates,” submitted<br />
to IEEE Trans. Wireless <strong>Communication</strong>s.<br />
Journal Articles in Print or to Appear<br />
J-1. A. Anastasopoulos, K. M. Chugg, G. Colavolpe, G. Ferrari, and R. Raheli, “Iterative detection<br />
for channels with memory: Algorithms and complexity,” 2007, to appear IEEE Proceedings.<br />
J-2. X. Chen and K. M. Chugg, “Iterative soft-in/soft-out algorithms for arbitrary sparse channels,”<br />
IEEE Trans. <strong>Communication</strong>s, 2007, IEEE Trans. <strong>Communication</strong>s (accepted).<br />
J-3. T. R. Halford and K. M. Chugg, “An algorithm for counting short cycles in bipartite graphs,”<br />
IEEE Trans. Information <strong>The</strong>ory, vol. 52, pp. 287–292, January 2006.<br />
J-4. T. R. Halford, A. J. Grant, and K. M. Chugg, “Which codes have 4-cycle-free Tanner graphs”<br />
IEEE Trans. Information <strong>The</strong>ory, vol. 52, pp. 4219–4223, September 2006.<br />
J-5. O.W. Yeung and K. M. Chugg, “An iterative algorithm and low complexity hardware architecture<br />
for fast acquisition of PN codes in UWB systems,” Springer J. VLSI Signal Processing<br />
(special issue on Ultrawideband Systems), vol. 43, April 2006.<br />
J-6. M. Zhu and K. M. Chugg, “Bounds on the expansion properties of Tanner graphs,” May<br />
2006, accepted with minor revisions, IEEE Trans. Information <strong>The</strong>ory.