curriculum vitae - ieee information theory society...† rws 2006, 2007, 2008: member of technical...
TRANSCRIPT
Curriculum VitaeAlexei Ashikhmin
Communications and Statistical Sciences Research DepartmentBell Laboratories/Alcatel-Lucent600 Mountain Ave., 2C-355Murray Hill, NJ 07974-0636phone: (908) 582-4107; fax: (908) 582-3340e-mail: [email protected]
PROFESSIONAL EXPERIENCE:
1999-current Research ScientistBell Labs, Alcatel-Lucent Inc.Communications and Statistical Sciences Research Department
1997-1999 Director’s Postdoctoral FellowLos Alamos National LaboratoryComputer, Information and Communication Division
1995-1996 Visiting ResearcherDelft University of Technology, the NetherlandsFaculty of Informatics
1991-1995 Ph.D. StudentInstitute for Information Transmission ProblemsRussian Academy of Sciences, Computer and Information Research Group
1988-1991 Research AssistantPerm State UniversityDepartment of Computer Science
EDUCATION:
1994 Ph.D. in Electrical Engineering Institute for Information Transmission Problems,Russian Academy of Sciences, Moscow, Russia
THESIS: Fast Decoding Algorithms1988 M.S. in Electrical Engineering Perm Polytechnic Institute, Russia
(Cum Laude)THESIS: Fast Decoding of Reed-Muller Codes
HONORS:
2010 Bell Laboratories Team Award:Crasstalk Cancellation in DSL systems
2004 S. O. Rice Prize Paper Award:Best paper, IEEE Transactions on Communicationson design of LDPC codes for MIMO information transmission
2002 Bell Laboratories President’s Gold Award:breakthrough results on the ability to deliver unprecedented wireless bit-rates
1997-1999 Director’s Fellowship, Los Alamos National Laboratory1994 Young Investigators Award, Institute for Information Transmission Problems,
Russian Academy of Sciences1993 Young Investigators Award, Institute for Information Transmission Problems,
Russian Academy of Sciences
Alexei Ashikhmin, Ph.D. BELL LABS 2
TEACHING EXPERIENCE:
• Columbia University: Adjunct Professor – 2007, Error Correcting Codes, (E6718);2005, Communications Theory II, (E6713); 2005, Error Correcting Codes, (E6718)
• The National Taiwan University: Minicourse Foundations of Quantum Error Correction,2004
• Massachusetts Institute of Technology: Minicourse Quantum Error Correcting Codes, 1999
• Los Alamos National Laboratory: Expository Lecture Series Information Theory and ErrorCorrecting Codes, 1997
PROFESSIONAL ACTIVITIES:
• CISS 2010: Organizer of Broadband Access Networks Session
• Editorial Board Member: International Journal of Information and Coding Theory
• Associate Editor 2003–2006: IEEE Transactions on Information Theory
• ITW 2006: Organizer of Quantum Coding Theory Session
• Workshop on Algebraic Coding Theory and Information Theory, DIMACS Center:Organizer, 2003
• ISIT 2005, 2006, 2007, 2008, 2009, 2010, 2011: Member of Technical Program Committee
• RWS 2006, 2007, 2008: Member of Technical Program Committee
• 2007, XI International Symposium on Problems of Redundancy in Information andControl Systems: Member of Technical Program Committee
• IWCMC 2006, 2007, 2008: Member of Technical Program Committee
• Columbia University: Member of Dissertation Thesis Committee, 2006
• Tel-Aviv University: Ph.D. Thesis Reviewer, 2006
• Bell Labs: Supervising Internship Students, 2000–2008
INVITED LECTURES:
2008 Institute for Telecommunications Research, University of South Australia2008 SIAM Conference on Discrete Mathematics, Burlington, Vermont, USA2007 Physics Department, Princeton University, USA2007 AMS Meeting, North Carolina, USA2006 International Theory Workshop, Chengdu, China2006 International Theory Workshop, Punta del Este, Uruguay2006 Information Theory and Applications Center Inauguration Workshop, UCSD, CA2005 CalIT2 Seminar at University of California, San Diego, CA2005 “Workshop of Statistical Physics and Coding,” Santa Fe, NM2004 “38th Annual Conference on Information Science and Systems”, Princeton, NJ2004 “Lucent Distinguished Lecture Series”, University of Michigan, Ann Arbor, MI
Alexei Ashikhmin, Ph.D. BELL LABS 3
2003 “ 41st Allerton Conference on Communication, Control, and Computing”, Allerton, IL2003 AMS Meeting, North Carolina, USA2002 “General Theory of Information Transfer”, Bielefeld University, Germany2001 “Asymptotic and Computational Problems in Coding Theory”, Princeton, NJ2001 “Quantum Error Correction”, AMS Meeting , Stevens Institute of Technology, NJ1999 “Codes and Association Schemes”, Rutgers University, NJ
REFEREE:IEEE Transactions on Information Theory, IEEE Transactions on Communications, Quantum Infor-mation and Computation, Quantum Information Processing, Mathematical Reviews, Discrete Mathe-matics, Journal of Combinatorial Designs
US Patents Granted or Filed in 2009, 2008, 2007
• A. Ashikhmin, “Coding in a MIMO Communication Systems,” U.S. Patent 7599444.
• A. Ashikhmin, G. Kramer, and S. ten Brink, “Methods and Apparatus for CommunicationUsing Generalized Low Density Parity Check Codes,” U.S. Patent 7251769.
• A. Ashikhmin, S. Litsyn, ”Method and Apparatus for Map Decoding of Binary HammingCodes and Related Error Correction Codes”, U.S. Patent 7168028.
• A. Ashikhmin, G. Kramer, and S. ten Brink, “MIMO Systems Having a Channel DecoderMatched to a MIMO Detector”, US patent 7013116 .
• A. Ashikhmin “Method and Apparatus for MAP Decoding of First Order Reed-Muller Codesand Related Error Correction Codes,” US patent 6990626 .
• A. Ashikhmin, T. Marzetta, “Neighbor Orthogonal Training Pilots For Multi-Cell Communi-cation Systems,” filed in 2009.
• A. Ashikhmin, P. Whiting, “Crosswalk Estimation And Power Setting Based On InterpolationIn A Multi-Channel Communication System,” filed in 2009.
• A. Ashikhmin, P. Whiting, “Channel Estimation In A Multi-Channel Communication SystemUsing Pilot Signals Having Quasi-Orthogonal Subpilots,” filed in 2009.
• A. Ashikhmin, J. Jose, T. Marzetta, “Methods For Reducing Inter-Cell Interference by Pre-coding Signals For Transmission In Wireless MIMO System,” filed in 2009.
• A. Ashikhmin, P. Whiting, “Power Control Using Denoised Crosswalk Estimates In A Mulit-Channel Communication System,” filed in 2009.
• A. Ashikhmin, “Methods For Precoding Signals For Transmission In Wireless MIMO System,”filed in 2008.
• A. Ashikhmin, J. Jose, T. Marzetta, “Efficient Scheduling In Time Division Duplex (TDD)Multiple Input Multiple Output (MIMO) Broadcast,” filed in 2008.
• A. Ashikhmin, T. Marzetta, A. J. van Wijngaarden, “Synchronization Of A Receiver,” filedin 2008.
Alexei Ashikhmin, Ph.D. BELL LABS 4
• A. Ashikhmin, P. Whiting, et. al., “Methods For Optimizing Precoder Settings Using AverageSINR Reports For Groups Of Tones,” filed in 2008.
• A. Ashikhmin, P. Whiting, et. al., “Methods For Optimizing Precoder Settings Using AverageSINR Reports For Groups Of Tones,” filed in 2008.
• A. Ashikhmin, C. Nuzman, et. al. “Fast Seamless Joining Of Channels In A Multi-ChannelComunication System,” filed in 2008.
• A. Ashikhmin, G. Kramer, P. Whiting, A. J. van Wijngaarden, M. Zivkovic, “Use of ToneGrouping for Improved Convergence of the SINR Feedback Channel Estimation,” filed 2007.
• A. Ashikhmin, “Providing Feedback in a MIMO Broadcast System,” US patent, filed 2007.
• A. Ashikhmin, Complex Vector Quantization Codebook for Use In Downlink Multi-UserMIMO Mobile Broadcast Systems, filed 2007.
• A. Ashikhmin, Method and Apparatus for Quantizing Complex Vectors In CommunicationSystem, filed 2007.
• A. Ashikhmin, P. Whiting, A. J. van Wijngaarden, M. Zivkovic, “Crosstalk Estimation Meth-ods and Apparatus Using Auxiliary Time-Domain Signals,” filed 2007.
1
Journal Publications of Alexei Ashikhmin
• A. Ashikhmin, A. R. Calderbank, “Grassmannian Packings from Operator Reed-MullerCodes,” IEEE Trans. on Information Theory, 56, pp.5689–5714, 2010.
• R.-R. Chen, R. Peng, A. Ashikhmin, B. Farhang-Boroujeny, “ Approaching MIMOCapacity Using Bitwise Markov Chain Monte Carlo Detection,” IEEE Trans. on Commu-nications, 58, pp.423–428, 2010.
• P. Whiting, G. Kramer, C. Nuzman, A. Ashikhmin, A. de Lind van Wijngaarden, M.Zivkovic, “Analysis of Inverse Crosstalk Channel Estimation Using SNR Feedback,” IEEETransactions on Signal Processing, 58 , pp.1–34, 2010.
• M. Magarini, R.-J. Essiambre, B. Basch, A. Ashikhmin, G. Kramer, A. de Lind vanWijngaarden, “Concatenated Coded Modulation for Optical Communications Systems,”IEEE Photonics Technology Letters, 22, pp.1244–1246, 2010.
• N. Sharma, A. Ashikhmin, “Iterative Estimation and Decoding for the Multi-Path Chan-nels with RAKE Reception,” IEEE Trans. on Communications, 56, pp. 1398–1403, 2008.
• K. Li, X. Wang, A. Ashikhmin, “EXIT Functions of Hadamard Components in Repeat-Zigzag-Hadamard (RZH) Codes,” IEEE Trans. on Information Theory, 54, pp. 1773–1785, 2008.
• Y. Jian, A. Ashikhmin, N. Sharma, “LDPC Codes for Flat Rayleigh Fading Channelswith Channel Side Information,” IEEE Trans. on Communications, 56, pp. 1207–1213,2008.
• Y.-N. Lee, A. Ashikhmin, J.-T. Chen, “Impact of Soft Channel Construction on Itera-tive Channel Estimation and Data Decoding for Multicarrier Systems,” IEEE Trans. onWireless Communications, 7, pp. 2762–2770, 2008.
• Y. Jiang, A. Ashikhmin, R. Koetter, A. Singer, “Extremal Problems of InformationCombining,” IEEE Trans. on Information Theory, 54, pp. 51–71, 2008.
• A. Ashikhmin, A. J. de Lind van Wijngaarden, Z. Haibo, T. L. Marzetta, C. Qinghong,P. A. Wilford, S.-R. Zhou, M. A. Zuniga, E. Zurankski, “Design and Development of aTerrestrial Digital Video Broadcast Demodulation Core: An International CollaborationEffort,” Bell Labs Technical Journal, Bell Labs Technical Journal, 12, Issue 2, pp. 97–118,2007.
• A. Ashikhmin, S. Litsyn, “Foundations of Quantum Error Correction,” AMS/IP Studiesin Advanced Mathematics, 41: Recent Trends in Coding Theory and its Applica-tions, pp. 151–185, 2007.
• A. Ashikhmin, V. Skachek, “Decoding of Expander Codes at Rates Close to Capacity,”IEEE Trans. on Information Theory, 52, pp. 5475–5485, 2006.
• E. Sharon, A. Ashikhmin, S. Litsyn, “EXIT Functions for Binary Input MemorylessSymmetric Channels”, IEEE Trans. on Communications, 54, pp. 1207–1214, 2006.
• E. Sharon, A. Ashikhmin, S. Litsyn, “Analysis of Low-Density Parity-Check codes basedon EXIT functions”, IEEE Trans. on Communications, 54, pp. 1407–1414, 2006.
2
• A. Ashikhmin, Gerard Cohen, Michael Krivelevich, and S. Litsyn, “Bounds on DistanceDistributions in Codes of Known Size”, IEEE Trans. on Inform.Theory, 51, pp. 250–258,2005.
• A. Ashikhmin, G. Kramer, and S. ten Brink, “Extrinsic Information Transfer Functions:a Model and Properties,” IEEE Trans. on Inform.Theory, 50, pp. 2657–2674, 2004.
• A. Ashikhmin and S. Litsyn, “Fast MAP Decoding of First Order Reed-Muller andHamming Codes”, IEEE Trans. on Inform.Theory, 50, pp. 1812–1818, 2004.
• S. ten Brink, G. Kramer, A. Ashikhmin, “Detection and Decoding of Multi-AntennaSignals with Low-Density Parity-Check Codes,” IEEE Trans. on Comm. Theory, 52,pp. 670–678, 2004.
• G. Kramer, A. Ashikhmin, A. J. van Wijngaarden, and X. Wei, “Spectral Efficiencyof Coded Phase Shift Keying for Fiber Optic Communication,” Journal of LightwaveTechnology, 21, pp. 2438–2446, 2003
• A. Ashikhmin and A. Barg, “Bounds on the Covering Radius of Linear Codes,” Designs,Codes and Cryptography, 27, pp. 261–269, 2002.
• E. Knill, R. Laflamme, A. Ashikhmin, H. Barnum, L. Viola, and W. Zurek, “Introductionto quantum error correction,” LA Science, 27(LAUR-01-6115 and LAUR-02-4311), pp.188-225, 2002.
• A. Ashikhmin and A. Barg, “Linear Codes with Exponentially Many Light Vectors,”Journal of Combinatorial Theory, Series A, 96, pp. 369-399, 2001.
• A. Ashikhmin and E. Knill, “Nonbinary Quantum Stabilizer Codes,” IEEE Trans. onInf. Theory, 47, pp. 3065–3072, 2001.
• A. Ashikhmin, A. Barg, and S. Litsyn, “Estimates of the Distance Distribution of Nonbi-nary Codes, with Applications,” Codes and Association Schemes, AMS, 56, pp. 287–303,2001.
• A. Ashikhmin, M. A. Tsfasman, and S. Litsyn, “ Asymptotically Good Quantum Codes,”Phys. Rew. A., 63, pp. 032311-1–032311-5, 2001.
• A. Ashikhmin, A. Barg, and S. Litsyn, “Estimates of the Distance Distribution of Codesand Designs,” IEEE Trans. Inform.Theory, 47, pp. 1050–1062, 2001.
• A. Ashikhmin, A. Barg, and S. Litsyn, “A New Upper Bound the Reliability Functionof the Gaussian Channel,” IEEE Trans. on Inf. Theory, 46, 2000.
• A. Ashikhmin, A. Barg, E. Knill, and S. Litsyn, “Quantum Error Detection II: Lowerand Upper Bounds,” IEEE Trans. on Inf. Theory, 46, pp. 789–801, 2000.
• A. Ashikhmin, A. Barg, E. Knill, and S. Litsyn, “Quantum Error Detection I: Statementof the Problem,” IEEE Trans. on Inf. Theory, 46, pp. 778–789, 2000.
• A. Ashikhmin, A. Barg, and S. Litsyn, “A New Upper Bounds on Codes Decodableinto Size-2 List,” Numbers, Information and Complexity, Kluwer Academic Publishers,pp. 239–244, 2000.
• A. Ashikhmin, T. Laihonen, and S. Litsyn, “On Relations Between Covering Radius andDual Distance,” IEEE Trans. on Inf. Theory, 45, pp. 1808–1816, 1999.
3
• A. Ashikhmin and S. Litsyn, “Upper Bounds on the Size of Quantum Codes”, IEEETrans. on Inf. Theory, 45, pp. 1206–1216, 1999.
• A. Ashikhmin, A. Barg, and S. Litsyn, “New Upper Bounds on Generalized Weights,”IEEE Trans. on Inf. Theory, 45, pp. 1258–1263, 1999.
• A. Ashikhmin and A. Barg, “Binomial Moments: Bounds and Applications,” IEEETrans. on Inf. Theory, 45, pp. 438–453, 1999.
• A. Barg and A. Ashikhmin, “Binomial Moments of a Code Distance Distribution andthe Probability of Undetected error,” Designs, Codes and Cryptography, 16, pp. 103–116,1999.
• A. Ashikhmin and A. Barg, “Minimal Vectors in Linear Codes,” IEEE Trans. on Inf.Theory, 44, pp. 211–217, 1998.
• A. Ashikhmin and J. Simonis, “On the Delsarte Inequalities,” Linear Algebra and itsApplications, 269, pp. 197–217, 1998.
• A. Ashikhmin, “Generalized Hamming Weights of Galois Ring Linear Codes,” Designs,Codes and Cryptography, 14, pp. 107–127, 1998.
• J. Simonis and A. Ashikhmin, “Almost Affine Codes,” Designs, Codes and Cryptography,14, pp. 179–197, 1998.
• A. Ashikhmin and S. Litsyn, “Fast Decoding of Non-Binary First Order Reed-MullerCodes,” Applicable Algebra in Engineering, Communication and Computing, 7, pp. 299–308, 1996.
• A. Ashikhmin and S. Litsyn, “Fast Decoding Algorithms for First Order Reed-Mullerand Related Codes,” Designs, Codes and Cryptography, 7, pp. 187–214, 1996.
• A. Ashikhmin, A. Barg, G. Cohen, and L. Huguet, “Variations on Minimal Codewordsin Linear Codes,” Lecture Notes in Computer Science, 948, Springer Verlag, pp. 96–105,1995.
• A. Ashikhmin and V. Zyablov, “Partial Unit Memory Codes on the Base of Subcodesof Hadamard Codes,” Lecture Notes in Computer Science, 829, pp. 69–73, 1994.
Conference Presentations (2005–2010)
• S. Aly, A. Ashikhmin, “Nonbinary quantum cyclic and subsystem codes over asymmetrically-decohered quantum channels,” IEEE Information Theory Workshop (ITW), pp.1–5. 2010.
• K. Appaiah, A. Ashikhmin, T. Marzetta, “Pilot Contamination Reduction in Multi-userTDD Systems,” IEEE International Conference on Communications, Cape Town, SouthAfrica, pp.1–5. 2010.
• A. Ashikhmin, “Spherical Codes Containing a Rich Collection of Orthonormal Bases,”47th Annual Allerton Conference on Communication, Control, and Computing, Allerton,IL, 2009.
• J. Jose, A. Ashikhmin, T. Marzetta, S. Vishwanath, “Pilot contamination problem inmulti-cell TDD systems,” IEEE International Symposium on Information Theory, Seoul,Korea, pp.2184–2188, 2009.
4
• P. Whiting, A. Ashikhmin, G. Kramer, C. Nuzman, A. J. van Wijngaarden, M. Zivkovic,M. Peeters, M. Guenach, J. Maes, J. Verlinden, “DSL Crosstalk Coefficient AcquisitionUsing SNR Feedback,” 2008 IEEE GLOBECOM, New Orleans, pp.1–5, 2008.
• J. Jose, A. Ashikhmin, P. Whiting, S. Vishwanath, “Precoding methods for multi-userTDD MIMO systems,” 46th Annual Allerton Conference on Communication, Control, andComputing, Allerton, IL, 2008.
• J. Jose, A. Ashikhmin, P. Whiting, S. Vishwanath, “Scheduling and Pre-Conditioningin Multi-User MIMO TDD Systems,” 2008 International Conference on Communications,Beijing, China, 2008.
• A. Ashikhmin, R. Gopalan, “Grassmannian Packings for Efficient Quantization in MIMOBroadcast Systems,” 2007 IEEE International Symposium on Information Theory, pp.1811-1815, Nice, France, 2007.
• K. Li, X. Wang, A. Ashikhmin, “EXIT Functions of Hadamard Components in Repeat-Zigzag-Hadamard (RZH) Codes,” 2007 IEEE International Symposium on InformationTheory, pp.881–885, Nice, France, 2007.
• V. Agrawal, A. Ashikhmin, A. R. Calderbank, “A Grassmannian Packing Based on theNordstrom-Robinson Code,” 2006 IEEE International Symposium on Information Theory,pp. 1–5, China, 2006.
• A. Ashikhmin, A. R. Calderbank, W. Kewlin, “Multidimensional Second Order Reed-Muller Codes as Grassmannian Packings,” 2006 IEEE International Symposium on Infor-mation Theory, pp. 1001 – 1005, Seattle, WA, 2006.
• A. Ashikhmin, “Fidelity of a Quantum ARQ Protocol,” 2006 IEEE Information TheoryWorkshop, pp. 42 – 46, Uruguay, 2006.
• Y. Jiang, A. Ashikhmin, R. Koetter, A. C. Singer, “Extremal problems of informationcombining,” 2005 IEEE International Symposium on Information Theory, pp. 1236 – 1240,Australia, 2005.
• A. Ashikhmin, A. R. Calderbank, “ Space-time Reed-Muller codes for noncoherentMIMO transmission, ” 2005 IEEE International Symposium on Information Theory, pp. 1952- 1956, Australia, 2005.
• A. Ashikhmin, A., V. Skachek, “Decoding of expander codes at rates close to capacity,”2005 IEEE International Symposium on Information Theory, pp. 317 - 321, Australia,2005.
• R.-R. Chen, B. Farhang-Boroujeny, A. Ashikhmin, “Capacity-approaching LDPC codesbased on Markov Chain Monte Carlo MIMO detection,” 2005 IEEE 6th Workshop onSignal Processing Advances in Wireless Communications, pp. 285 – 288, New York, 2005.
• A. Ashikhmin, A. R. Calderbank, “First Order Space-Time Reed-Muller Codes,” 43rdAnnual Allerton Conference on Communication, Control, and Computing, Allerton, pp. 1086–1095, IL, 2005
Jean-Claude Belfiore's Short Biography
Jean-Claude Belfiore received the "Diplôme d'ingénieur" (Eng. degree) from Ecole Supérieure d'Electricité (Supelec) in 1985, the "Doctorat" (PhD) from ENST in 1989 and the "Habilitation à diriger des Recherches" (HdR) from Université Pierre et Marie Curie (UPMC) in 2001. In 1989, he was enrolled at the “Ecole Nationale Supérieure des Télécommunications, ENST, also called “Télécom ParisTech", where he is presently full Professor in the Communications & Electronics department. He is carrying out research at the Laboratoire de Traitement et Communication de l'Information, LTCI , joint research laboratories between ENST and the “Centre National de la Recherche Scientifique” (CNRS), UMR 5141, where he is in charge of research activities in the areas of digital communications, information theory and coding. Jean-Claude Belfiore has made pioneering contributions on modulation and coding for wireless systems (especially space-time coding) by using tools of number theory. He is also, with Ghaya Rekaya and Emanuele Viterbo, one of the co-inventors of the celebrated Golden Code. He is now working on wireless network coding, cooperative communications and coding for physical security. In 2007, he was the recipient of the SEE Blondel Medal. He is author or co-author of more than 200 technical papers and communications and he has served as advisor for more than 30 Ph.D. Students.
Jean-Claude Belfiore's Publications
Journals
Submitted Journal Papers
A. F. Oggier, P. Solé and J.-C. Belfiore, "Codes over Matrix Rings for Space-Time Coded Modulations," submitted to IEEE Transactions on Information Theory, available on arXiv arXiv:1008.1387v1 [cs.IT]
B. L. Mroueh and J.-C. Belfiore, "How to achieve the Optimal DMT of Selective Fading MIMO Channels," submitted to IEEE Transactions on Information Theory, available on arXiv arXiv:1010.2686v1 [cs.IT]
C. M. Kobayashi, S. Yang, M. Debbah and J.-C. Belfiore, "Outage Efficient Strategies for Network MIMO with Partial CSIT," submitted to IEEE Trans. on Signal Processing, available on arXiv arXiv:1001.2421v1 [cs.IT]
D. L. Luzzi, G. Rekaya-Ben Othman and J.-C. Belfiore, "Algebraic reduction for space-time codes based on quaternion algebras," submitted to Advances in Mathematics of Communications, available on arXiv:0809.3365v2 [cs.IT]
E. S. Yang and J. -C. Belfiore, "Diversity of MIMO Multihop Relay Channels," submitted to IEEE Transactions on Information Theory, available on arXiv 0708.0386
Accepted Journal Papers
I. S. Yang and J. -C. Belfiore, "Diversity-Multiplexing Tradeoff of Double Scattering MIMO Channels," accepted for publication in the IEEE Transactions on Information Theory, available on arXiv 0603124v2 [cs.IT]
II. M. Sarkiss, G. Rekaya-Ben Othman, M. O. Damen and J.-C. Belfiore, "Construction of New Delay-Tolerant Space-Time Codes," accepted for publication in IEEE Transactions on Information Theory, available on arXiv 1011.0474v1 [cs.IT]
Published Journal Papers
1. M. Pischella and J.-C. Belfiore, "Distributed Margin Adaptive Resource Allocation in MIMO OFDMA Networks," IEEE Transactions on Communications, Volume 58, Issue 9, Sept. 2010, pdf
2. L. Luzzi, G. Rekaya-Ben Othman and J.-C. Belfiore, "Augmented Lattice Reduction for MIMO Decoding," IEEE Transactions on Wireless Communications, Volume 9, Issue 9, Sept. 2010, Page(s): 2853 - 2859, pdf
3. A. Mahmood and J.-C. Belfiore, "An Efficient Algorithm for Optimal Discrete Bit-Loading in MultiCarrier Systems," IEEE Transactions on Communications, Volume 58, Issue 6, June 2010, Page(s):1627 - 1630, pdf
4. M. Pischella and J.-C. Belfiore, "Weighted Sum Throughput Maximization in Multicell OFDMA Networks," IEEE Transactions on Vehicular Technology, Volume 59, Issue 2, Feb. 2010, Page(s): 896 - 905, pdf
5. M. Pischella and J.-C. Belfiore, "Resource Allocation for QoS-Aware OFDMA Using Distributed Network Coordination," IEEE Transactions on Vehicular Technology, Volume 58, Issue 4, May 2009, Page(s): 1766 - 1775, pdf
6. L. Luzzi, G. Rekaya-Ben Othman, J.-C. Belfiore and E. Viterbo, "Golden Space-Time Block Coded Modulation," IEEE Transactions on Information Theory, Volume 55, Issue 2, Feb. 2009, Page(s): 584 - 595, pdf
7. M. Pischella and J.-C. Belfiore, "Power control in distributed cooperative OFDMA cellular networks," IEEE Transactions on Wireless Communications, Volume 7, Issue 5, Part 2, May 2008, Page(s):1900 - 1906, pdf
8. C. Abou-Rjeily, N. Daniele and J.-C. Belfiore, "On the Amplify-and-Forward Cooperative Diversity with Time-Hopping Ultra-Wideband Communications," IEEE Transactions on Communications, Volume 56, Issue 4, April 2008, Page(s):630 - 641, pdf
9. M. Pischella and J.-C. Belfiore, "Distributed resource allocation for rate-constrained users in multi-cell OFDMA networks," IEEE Communications Letters, Volume 12, Issue 4, April 2008, Page(s):250 - 252, pdf
10.I. Krikidis and J.-C. Belfiore, "Scheduling for Amplify-and-Forward Cooperative Networks," IEEE Transactions on Vehicular Technology, Volume 56, Issue 6, Part 2, Nov. 2007, Page(s):3780 - 3790, pdf
11.I. Kammoun, A. M. Cipriano and J.-C. Belfiore, "Non-Coherent Codes over the Grassmannian," IEEE Transactions on Wireless Communications, Volume 6, Issue 10, October 2007, Page(s):3657 - 3667, pdf
12.S. Yang and J.-C. Belfiore, "Towards the Optimal Amplify-and-Forward Cooperative Diversity Scheme," IEEE Transactions on Information Theory, Volume 53, Issue 9, Sept. 2007, Page(s):3114 - 3126, pdf
13.G. Feideropoulou, M. Trocan, J. E. Fowler, B. Pesquet-Popescu, and J.-C. Belfiore, "Rotated Constellations for Video Transmission Over Rayleigh Fading Channels ," IEEE Signal Processing Letters, Volume 14, Issue 9, Sept. 2007, Page(s):629 - 632, pdf
14.C. Abou-Rjeily and J.-C. Belfiore, "On Space–Time Coding With Pulse Position and Amplitude Modulations for Time-Hopping Ultra-Wideband Systems," IEEE Transactions on Information Theory, Volume 53, Issue 7, July 2007, Page(s):2490 - 2509, pdf
15.C. Abou-Rjeily and J.-C Belfiore, "A Space-Time Coded MIMO TH-UWB Transceiver with Binary Pulse Position Modulation," IEEE Communications Letters, Volume 11, Issue 6, June 2007, Page(s):522 - 524, pdf
16.I. Krikidis and J.-C. Belfiore, "Three Scheduling Schemes for Amplify-and-Forward Relay Environments," IEEE Communications Letters, Volume 11, Issue 5, May 2007, Page(s):414 - 416, pdf
17.Y. Hong, E. Viterbo, and J.-C. Belfiore, "Golden Space–Time Trellis Coded Modulation," IEEE Transactions on Information Theory, Volume 53, Issue 5, May 2007, Page(s):1689 - 1705, pdf
18.C. Abou Rjeily, N. Daniele and J.-C. Belfiore, "Distributed Algebraic Space-Time Codes
for Ultra-Wideband Communications," Wireless Personal Communications, Volume 43, April 2007, Springer, pp. 107 - 121, pdf
19.S. Yang and J.-C. Belfiore, "Optimal Space–Time Codes for the MIMO Amplify-and-Forward Cooperative Channel," IEEE Transactions on Information Theory, Volume 53, Issue 2, Feb. 2007, Page(s):647 - 663, pdf
20.C. Abou-Rjeily, N. Daniele, J.-C. Belfiore, "Space–Time Coding for Multiuser Ultra-Wideband Communications," IEEE Transactions on Communications, Volume 54, Issue 11, Nov. 2006, Page(s):1960 - 1972, pdf
21.F. Oggier, G. Rekaya, J.-C. Belfiore and E. Viterbo, "Perfect Space-Time Block Codes," IEEE Transactions on Information Theory, Volume 52, Issue 9, Sept. 2006, Page(s):3885 - 3902, pdf
22.C. Abou-Rjeily, N. Daniele and J.-C. Belfiore, "A 2x2 antennas ultra-wideband system with biorthogonal pulse position modulation," IEEE Communications Letters, Volume 10, Issue 5, May 2006, Page(s):366 - 368, pdf
23.G. Feideropoulou, M. Trocan, J. E. Fowler, B. Pesquet-Popescu, and J.-C. Belfiore, "Joint source-channel coding with partially coded index assignment for robust scalable video," IEEE Signal Processing Letters, Volume 13, Issue 4, April 2006, Page(s):201 - 204, pdf
24.E. Jandot-dit-Danjou and J.-C. Belfiore, "A 2x2 antennas Bluetooth system," IEEE Communications Letters, Volume 9, Issue 9, Sep 2005, Page(s):784 - 786, pdf
25.J.-C. Belfiore, G. Rekaya and E. Viterbo, "The Golden code: a 2x2 full-rate space-time code with nonvanishing determinants," IEEE Transactions on Information Theory, Volume 51, Issue 4, April 2005, Page(s):1432 - 1436, pdf
26.I. Kammoun and J.-C. Belfiore, "A new family of Grassmann space-time codes for non-coherent MIMO systems," IEEE Communications Letters, Volume 7, Issue 11, Nov. 2003, Page(s):528 - 530, pdf
27.M. O. Damen, N. C. Beaulieu and J.-C. Belfiore, "Bandwidth-efficient linear Modulations for multiple-antenna transmission," IEEE Transactions on Information Theory, Volume 49, Issue 9, Sept. 2003, Page(s):2292 - 2298, pdf
28.M. O. Damen, A. Tewfik and J.-C. Belflore, "A construction of a space-time code based on number theory," IEEE Transactions on Information Theory, Volume 48, Issue 3, March 2002, Page(s):753 - 760, pdf
29.M. O. Damen, K. Abed-Meraim and J.-C. Belfiore, "Diagonal algebraic space-time block codes," IEEE Transactions on Information Theory, Volume 48, Issue 3, March 2002, Page(s):628 - 636, pdf
30.M. O. Damen, A. Chkeif, and J.-C. Belfiore, "Lattice code decoder for space-time codes," IEEE Communications Letters, Volume 4, Issue 5, May 2000, Page(s):161 - 163, pdf
31.M. O. Damen, K. Abed-Meraim, and J.-C. Belfiore, "Generalized sphere decoder for asymmetrical space-time communication architecture," Electronics Letters, Volume 36, Issue 2, 20, Jan. 2000, Page(s):166 - 167, pdf
32.X. Giraud, E. Boutillon and J.-C. Belfiore, "Algebraic tools to build modulation schemes for fading channels," IEEE Transactions on Information Theory, Volume 43, Issue 3, May 1997, Page(s):938 - 952, pdf
33.R. Haas and J.-C. Belfiore, "A Time-Frequency Well-localized Pulse for Multiple Carrier Transmission," Wireless Personal Communications, Volume 5, Issue 1, Jan. 1997, Kluwer Academic Press, pp. 1 - 18, pdf
34.J. Boutros, E. Viterbo, C. Rastello and J.-C. Belfiore, "Good lattice constellations for both Rayleigh fading and Gaussian channels," IEEE Transactions on Information Theory, Volume 42, Issue 2, March 1996, Page(s):502 - 518, pdf
35.R. Haas and J.-C. Belfiore, "Spectrum efficiency limits in mobile cellular systems," IEEE Transactions on Vehicular Technology, Volume 45, Issue 1, Feb. 1996, Page(s):33 - 40, pdf
36.X. Giraud and J.-C. Belfiore, "Constellations matched to the Rayleigh fading channel," IEEE Transactions on Information Theory, Volume 42, Issue 1, Jan. 1996, Page(s):106 - 115, pdf
37.X. Giraud and J.-C. Belfiore, "The Constellation Design problem," Annales des Télécommunications, Volume 50, Num. 9-10, 1995, Page(s):824 - 831, pdf
38.K. Leeuwin, J.-C. Belfiore, and G. K. Kaleh, "Chernoff bound of trellis-coded modulation over correlated fading channels," IEEE Transactions on Communications, Volume 42, Issue 8, Aug. 1994, Page(s):2506 - 2511, pdf
39.J. Holtz, X. Giraud and J.-C. Belfiore, "Compared merits of hard/soft decoding for coherent optical communications impaired by phase noise," Journal of Lightwave Technology, Volume 11, Issue 12, Dec. 1993, Page(s):2093 - 2099, pdf
40.K. Leeuwin-Boullé and J.-C. Belfiore, "The cutoff rate of time correlated fading channels," IEEE Transactions on Information Theory, Volume 39, Issue 2, March 1993, Page(s):612 - 617, pdf
Conferences (2005-2010)
• J.-C. Belfiore and M. A. Vázquez Castro, "Managing interference through space-time codes, lattice reduction and network coding," Information Theory Workshop, Cairo Jan. 2010.
• C. Abgrall, E. Calvanese-Srinati and J.-C. Belfiore, "Multi-Cell Interference Aware Resource Allocation for Half-Duplex Relay Based Cooperation," IEEE Vehicular Technology Conference, VTC Spring-2010.
• C. Abgrall, E. Calvanese-Srinati and J.-C. Belfiore, "Centralized Power Allocation for Interference Limited Network," IEEE Vehicular Technology Conference, VTC Fall-2010.
• S. Yang and J.-C. Belfiore, "Distributed rotation recovers spatial diversity," 2010 IEEE Symposium on Information Theory, Austin.
• G. Rekaya, L. Luzzi and J.-C. Belfiore, "Algebraic reduction for the Golden Code," Information Theory Workshop, Cairo Jan. 2010.
• J.-C. Belfiore and F. Oggier, "Secrecy Gain: a Wiretap Lattice Code Design," ISITA 2010, Taiwan
• J.-C. Belfiore and P. Solé, "Unimodular Lattices for the Gaussian Wiretap Channel," Information Theory Workshop, Dublin, Sep. 2010.
• L. Mroueh and J.-C. Belfiore, "How to achieve the optimal DMT of selective fading MIMO channels?" Information Theory Workshop, Dublin, Sep. 2010.
• M. Badr, M. O. Damen and J.-C. Belfiore, "Delay-tolerant distributed space-time block codes for the asynchronous multiple-access channel," 2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications, Page(s): 521 - 525
• C. Abgrall, E. Calvanese-Strinati and J.-C. Belfiore, "Inter-cell interference mitigation allocation for half-duplex relays based cooperation," 2009 2nd IFIP Wireless Days (WD)
• M. Pischella and J.-C. Belfiore, "Distributed resource allocation in MIMO OFDMA networks with statistical CSIT," IEEE 10th Workshop on Signal Processing Advances in Wireless Communications, SPAWC '09, Page(s): 126 - 130
• M. Pischella and J.-C. Belfiore, "Graph-based weighted sum throughput maximization in OFDMA cellular networks," Second International Workshop on Cross Layer Design, IWCLD '09
• M. Badr, G. Rekaya-Ben Othman, and J.-C. Belfiore, "Unbalanced space-time block codes for non uniform energy distribution multiple access channels," 2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications, Page(s): 315 - 319
• G. Rekaya-Ben Othman, L. Luzzi and J.-C. Belfiore, "Algebraic Reduction for the Golden Code," IEEE International Conference on Communications, ICC '09
• M. Kobayashi, M. Debbah and J.-C. Belfiore, "Outage efficient strategies for network MIMO with partial CSIT," IEEE International Symposium on Information Theory, ISIT 2009, Page(s): 249 - 253
• F. Oggier, P. Sole and J.-C. Belfiore, "Codes over M2(F2) and applications to Golden space-
time coded modulation IEEE International Symposium on Information Theory, ISIT 2009, Page(s): 85 - 88
• R. Ouertani, G. Rekaya-Ben Othman and J.-C. Belfiore, "An Adaptive MIMO Decoder," IEEE 69th Vehicular Technology Conference, VTC Spring 2009
• M. Pischella and J.-C. Belfiore, "Achieving a Frequency Reuse Factor of 1 in OFDMA Cellular Networks with Cooperative Communications," Vehicular Technology Conference, 2008. VTC Spring 2008 , Page(s): 653 - 657
• M. Sarkiss, G. Rekaya-Ben Othman and J.-C. Belfiore, "4 × 4 Perfect space-time code partition,"42nd Asilomar Conference on Signals, Systems and Computers, 2008, Page(s): 1763 - 1767
• M. Sarkiss, M. O. Damen and J.-C. Belfiore, "2 × 2 delay-tolerant distributed space-time codeswith non-vanishing determinants," Personal, IEEE 19th International Symposium on Indoor and Mobile Radio Communications, PIMRC 2008
• M. Pischella and J.-C. Belfiore, "QoS-Based Resource Allocation with Cooperative Diversity in OFDMA," IEEE Vehicular Technology Conference. VTC Spring 2008, Page(s): 1896 - 1900
• M. Badr and J.-C. Belfiore, "Distributed space time codes for the Amplify-and-Forward Multiple-Access Relay channel," IEEE International Symposium on Information Theory, ISIT 2008, Page(s): 2543 - 2547
• L. Luzzi, G. Rekaya-Ben Othman, J.-C. Belfiore and E. Viterbo, "Golden space-time block coded modulation," IEEE Information Theory Workshop, ITW '08, Page(s): 86 - 90
• L. Mroueh, M. O. Damen, S. Rouquette-Leveil, G. Rekaya-Ben Othman and J.-C. Belfiore, "Code construction for the selective TDMA cooperative broadcast channel," IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2008
• A. Mahmood and J.-C. Belfiore, "Improved 3-dB Subgroup based Algorithm for Optimal
Discrete Bit-Loading," 2008 IEEE Sarnoff Symposium
• M. Badr, E. Calvanese-Strinati and J.-C. Belfiore, "Optimal Power Allocation for Hybrid Amplify-and-Forward Cooperative Networks," IEEE Vehicular Technology Conference, VTC Spring 2008, Page(s): 2111 - 2115
• L. Mroueh, S. Rouquette-Leveil, G. Rekaya-Ben Othman and J.-C. Belfiore, "DMT achieving schemes for the isotropic fading vector broadcast channel Personal, IEEE 19th International Symposium on Indoor and Mobile Radio Communications, PIMRC 2008
• M. Pischella and J.-C. Belfiore, "Distributed weighted sum throughput maximization in multi-cell wireless networks," IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2008
• M. Badr and J.-C. Belfiore, "Distributed space-time block codes for the MIMO Multiple Access Channel," IEEE International Symposium on Information Theory, ISIT 2008, Page(s): 2553 - 2557
• M. Badr and J.-C. Belfiore, "Distributed Space-Time Block Codes for the non cooperative Multiple Access Channel," IEEE International Zurich Seminar on Communications, 2008, Page(s): 132 - 135
• L. Mroueh, S. Rouquette-Leveil, G. Rekaya-Ben Othman and J.-C. Belfiore, "DMT of weighted parallel channels: Application to broadcast channels," IEEE International Symposium on Information Theory, ISIT 2008, Page(s): 2361 - 2365
• L. Berriche, K. Abed-Meraim and J.-C. Belfiore, "MIMO systems: Performance comparison of semi-blind techniques," 9th International Symposium on Signal Processing and Its Applications, ISSPA 2007
• S. Yang and J.-C. Belfiore, "Distributed (Space-Time) Codes for the MIMO Multihop Channel via Partitions of the Channel," 2007 IEEE Information Theory Workshop onInformation Theory for Wireless Networks
• Z. Zhao and J.-C. Belfiore, "Application of Cooperative Diversity in 802.11a Ad-hoc Networks," Proceedings of 16th International Conference on Computer Communications and Networks, ICCCN 2007, Page(s): 1016 - 1021
• L. Mroueh, S. Rouquette-Leveil, G. Rekaya-Ben Othman and J.-C. Belfiore, "On the performance of the Golden code in BICM-MIMO and in IEEE 802.11n cases," Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers, ACSSC 2007, Page(s): 1544 - 1548
• J.-C. Belfiore, M. Badr, S. Yang and G. Rekaya-Ben Othman, "DMT achieving Distributed Space Time Codes for the Multiple Access Channel," Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers, ACSSC 2007, Page(s): 810 - 813
• E. Calvanese-Strinati, S. Yang and J.-C. Belfiore, "Adaptive Modulation and Coding for Hybrid Cooperative Networks," IEEE International Conference on Communications, ICC '07, Page(s): 4191 - 4195
• C. Abou Rjeily and J.-C. Belfiore, "A Rate-1 2 × 2 Space-Time Code without any Constellation Extension for TH-UWB Communication Systems with PPM," 65th IEEE Vehicular Technology Conference, VTC2007-Spring, Page(s): 1683 - 1687
• S. Yang and J.-C. Belfiore, "On the Diversity of Rayleigh Product Channels," EEE International Symposium on Information Theory, ISIT 2007, Page(s): 1276 - 1280
• M. Sarkiss, J.-C. Belfiore and Y. Yuan-Wu, "Performance Comparison of Different Golden Code Detectors," IEEE 18th International Symposium on Personal, Indoor and Mobile
Radio Communications, PIMRC 2007
• C. Hucher, G. Rekaya-Ben Othman and J.-C. Belfiore, "Adaptive Amplify-and-Forward Cooperative Channel," IEEE International Symposium on nformation Theory, ISIT 2007, Page(s): 2706 - 2710
• M. Pischella and J.-C. Belfiore, "Optimal Power Allocation for Downlink Cooperative Cellular Networks," IEEE 65th Vehicular Technology Conference, VTC2007-Spring, Page(s): 2864 - 2868
• C. Hucher, G. Rekaya-Ben Othman and J.-C. Belfiore, "AF and DF Protocols based on Alamouti ST Code," IEEE International Symposium on Information Theory, ISIT 2007, Page(s): 1526 - 1530
• C. Abou Rjeily, N. Daniele and J.-C. Belfiore, "An Optimal 2 x 2 Space-Time Code for Time-Hopping Ultra-Wideband Systems with binary Pulse Position Modulation," 3rd International Symposium on Wireless Communication Systems, ISWCS '06, Page(s): 456 - 460
• S. Yang and J.-C. Belfiore, "Optimal Space-Time Codes for the MIMO Amplify-and-Forward Cooperative Channel," 2006 International Zurich Seminar on Communications, Page(s): 122 - 125
• C. Abou Rjeily, N. Daniele and J.-C. Belfiore, "MIMO UWB Communications Using Modified Hermite Pulses," 2006 IEEE 17th International Symposium on Personal, Indoor and Mobile Radio Communications
• C. Abou-Rjeily, N. Daniele and J.-C. Belfiore, "A New Full Rate Full Diversity ST Code with Nonvanishing Determinant for TH-UWB Systems," 2006 International Zurich Seminar on Communications, Page(s): 198 - 201
• C. Abou-Rjeily, N. Daniele, and J.-C. Belfiore, "Distributed Space-Time Coding with Ultra-Wideband Systems," 2006 IEEE 17th International Symposium on Personal, Indoor and Mobile Radio Communications
• C. Abou-Rjeily, N. Daniele and J.-C. Belfiore, "Performance of MIMO UWB Systems with Biorthogonal Pulse Position Modulation 2006 International Zurich Seminar on Communications, Page(s): 202 - 205
• L. Berriche, K. Abed-Meraim and J.-C. Belfiore, "Effect of Imperfect Channel Knowledge on the MIMO Channel Outage Capacity," IEEE 7th Workshop on Signal Processing Advances in Wireless Communications, SPAWC '06
• C. Abou-Rjeily, N. Daniele and J.-C. Belfiore, "On the Decode-and-Forward Cooperative Diversity with Coherent and Non-Coherent UWB Systems," The 2006 IEEE 2006 International Conference on Ultra-Wideband, Page(s): 435 - 440
• Y. Hong, E. Viterbo and J.-C. Belfiore, "High Rate Golden Space-Time Trellis Coded Modulation," Fortieth Asilomar Conference on Signals, Systems and Computers, ACSSC '06, Page(s): 2087 - 2091
• R. Ouertani, A. Saadani, G. Rekaya-Ben Othman and J.-C. Belfiore, "On the Golden Code Performance for MIMO-HSDPA System," IEEE 64th Vehicular Technology Conference, VTC-2006 Fall
• C. Abou Rjeily, N. Daniele and J.-C. Belfiore, "Diversity-Multiplexing Tradeoff of Single-Antenna and Multi-Antenna Indoor Ultra-Wideband Channels," The 2006 IEEE 2006 International Conference on Ultra-Wideband, Page(s): 441 - 446
• C. Abou Rjeily, N. Daniele and J.-C. Belfiore, "Amplify-and-Forward Cooperative
Diversity with Space-Time Coded UWB Systems," The 2006 IEEE 2006 International Conference on Ultra-Wideband, Page(s): 429 - 434
• S. Yang, J.-C. Belfiore and G. Rekaya-Ben Othman, "Perfect Space-Time Block Codes for parallel MIMO channels," 2006 IEEE International Symposium on Information Theory, Page(s): 1949 - 1953
• Y. Hong, E. Viterbo and J.-C. Belfiore, "A Space-Time Block Coded Multiuser MIMO Downlink Transmission Scheme," 2006 IEEE International Symposium on Information Theory, Page(s): 257 - 261
• S. Yang and J.-C. Belfiore, "A Novel Two-Relay Three-Slot Amplify-and-Forward Cooperative Scheme," 2006 40th Annual Conference on Information Sciences and Systems, Page(s): 1329 - 1334
• S. Yang and J.-C. Belfiore, "On Slotted Amplify-and-Forward Cooperative Diversity Schemes," 2006 IEEE International Symposium on Information Theory, Page(s): 2446 - 2450
• C. Abou Rjeily, N. Daniele and J.-C. Belfiore, "A New Family of Space-Time Codes for Pulse Amplitude and Position Modulated UWB Systems," 2006 IEEE International Symposium on Information Theory, Page(s): 2829 - 2833
• A. Cipriano, I. Kammoun and J.-C. Belfiore, "Simplified decoding for some non-coherent codes over the Grassmannian," 2005 IEEE International Conference on Communications, ICC 2005, Page(s): 757 - 761 Vol. 2
• I. Kammoun, A. Cipriano and J.-C. Belfiore, "A non-coherent SIMO architecture based on Grassmann codes," 2005 IEEE Workshop on Signal Processing Systems Design and Implementation, Page(s): 239 - 244
• G. Feideropoulou, J. E. Fowler, B. Pesquet-Popescu and J.-C. Belfiore, "Joint source-channel coding of scalable video with partially coded index assignment using Reed-Muller codes," 2005 IEEE International Conference on Image Processing, ICIP 2005, Volume: 3, Page(s): III - 888 - 891
• C. Abou-Rjeily, N. Daniele and J.-C. Belfiore, "On high data rate space-time codes for ultrawideband systems," 2005 IEEE International Conference on Ultra-Wideband, ICU 2005
• I. Kammoun, A. Cipriano and J.-C. Belfiore, "Performance analysis of some non-coherent space-time codes," 12th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2005
• C. Abou-Rjeily, N. Daniele and J.-C. Belfiore, "Differential space-time ultra-wideband communications," 2005 IEEE International Conference on Ultra-Wideband, ICU 2005
• M. Tlich, J.-C. Belfiore and A. Zeddam, "Optimization process of power distribution for a frequency multiplexing DMT transmission," 12th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2005
• J.-C. Belfiore and E. Viterbo, "Approximating the error probability for the independent Rayleigh fading channel," International Symposium on Information Theory, ISIT 2005, Page(s): 362 - 362
• G. Feideropoulou, B. Pesquet-Popescu and J.-C. Belfiore, "Bit Allocation Algorithm for Joint Source-Channel Coding of t+2D Video Sequences," IEEE International Conference on Acoustics, Speech, and Signal Processing, (ICASSP '05) Volume: 2, Page(s): 177 - 180
David Burshtein
ProfessorTel-Aviv UniversityFaculty of EngineeringSchool of Electrical EngineeringTel-Aviv 69978, IsraelOffice: (972)-3-6408057, Fax: (972)-3-6407095Email: [email protected]: http://www.eng.tau.ac.il/~burstyn
EDUCATION
1978-1982 Tel-Aviv University,Electrical Engineering, B.Sc. (Summa Cum-Laude),August 1982.
1983-1987 Tel-Aviv University,Electrical Engineering, Ph.D (the direct Ph.D program),December 1987.Title of Doctoral Dissertation: Optimal Identification andPower Spectrum Estimation of Discrete Linear Models.Name of Supervisor: Prof. E. Weinstein.
ACADEMIC APPOINTMENTS
Aug 2007 - Current Tel-Aviv University,Professor of Electrical Engineering.
March 2002 - July 2007 Tel-Aviv University,Associate Professor of Electrical Engineering.
Feb. 1998 - Feb. 2002 Tel-Aviv University,Senior Lecturer of Electrical Engineering with tenure.
Oct. 1992 - Jan. 1998 Tel-Aviv University,Lecturer of Electrical Engineering.
Oct. 1989 - Sept. 1992 Tel-Aviv University,Post. Doc. position.
ADDITIONAL PROFESSIONAL EXPERIENCE
1991 - 2004 Consultant to companies and to the ministryof defence in digital communications, signal
David Burshtein, 2010 2
processing and speech processing. In particular,in 1995 he spent a Sabbatical and leave ofabsence at DSPC.
Feb. 1988 - Oct. 1989 IBM, T. J. Watson Research Center, Yorktown –Heights, NY, Computer Science Dept., SpeechRecognition Group. Research Staff Member.Speech recognition algorithm design.
Dec. 1985 - Aug. 1987 The Israeli Defense Forces.Group leader (research and development, digitalcommunications, signal processing).
August 1982 - Dec. 1985 The Israeli Defense Forces.Research and development engineer(digital communications, signal processing).
AWARDS AND RECENT RESEARCH GRANTS
1978 Co-recipient of the 2’nd Prize, the WeizmannInstitute Mathematical Olympic
1997 “Excellent Student Paper” award to a student co-authoredpaper (paper [C10] below)
1999 Senior Member of the IEEE.
3/2004 – 2/2008 Principal Investigator, “Multimedia understanding (MUSCLE)”,Network of excellence (supported by the 6’th program of theEuropean union), $10000 per year.
10/2005 – 9/2009 Principal Investigator, “Theory and applications of iterativelydecoded codes in communications”, The Israel Science Foundation,$45000 per year.
10/2009 – 9/2013 Principal Investigator, “Decoding Algorithms and Analysis of Codeswith Sparse Factor Graphs”, The Israel Science Foundation,$45000 per year.
PROFESSIONAL SERVICE
• Reviewed manuscripts for numerous journals, international conferences and researchfoundations.
• Organizer of a session on LDPC codes in The IEEE 24th Convention of Electrical andElectronics Engineers in Israel, Eilat, November, 2006.
David Burshtein, 2010 3
• Technical program committee (TPC) member, The 5’th International Symposium onTurbo Codes & Related Topics (http://www.turbo-coding-2008.org), Lausanne, Switzer-land, September 2-5, 2008.
• Co-organizer (with S. Litsyn) of the special session on LDPC codes in The IEEE Infor-mation Theory Workshop (ITW) (http://www.itw2010dublin.org/), Dublin, Ireland,August, 2010.
• Technical program committee (TPC) member, The 6’th International Symposium onTurbo Codes & Iterative Information Processing(http://conferences.telecom-bretagne.eu/turbocodes), Brest, France, Septem-ber, 2010.
• Technical program committee (TPC) member, The IEEE International Symposiumon Information Theory (http://www.isit2011.org/), Saint Petersburg, Russia, July,2011.
RESEARCH ACTIVITIES
• Information Theory. Codes on graphs and iterative decoding algorithms, LDPC codes.
• Statistical pattern recognition. Signal processing.
GRADUATE STUDENTS
5 Ph.D. students and 16 M.Sc. research (with thesis) students have graduated.
David Burshtein, 2010 4
LIST OF PUBLICATIONS
Journal Papers
J1. D. Burshtein and E. Weinstein, “Some relations between the various criteria forautoregressive model order determination,” IEEE Transactions on Acoustics Speech andSignal Processing, volume 33, pp. 1017–1019, August 1985.
J2. D. Burshtein and E. Weinstein, “Confidence intervals for the maximum entropyspectrum,” IEEE Transactions on Acoustics Speech and Signal Processing, volume 35,pp. 504–510, April 1987.
J3. D. Burshtein and E. Weinstein, “On the application of the Wald statistic to orderestimation of ARMA models,” IEEE Transactions on Automatic Control, volume 36,pp. 1091–1096, September 1991.
J4. D. Burshtein, V. Della Pietra, D. Kanevsky and A. Nadas, “Splitting theoremsfor classification and regression trees,” Comptes Rendus de l’academie des sciences, t.313, series I, pp. 537–540, October 1991.
J5. D. Burshtein, “Joint modeling and maximum likelihood estimation of pitch and LPCparameters,” Journal of the Acoustical Society of America, volume 91, pp. 1531–1537,March 1992
J6. D. Burshtein, V. Della Pietra, D. Kanevsky and A. Nadas, “Minimum impuritypartitions,” The Annals of Statistics, volume 20, September 1992.
J7. D. Burshtein, “An efficient algorithm for calculating the likelihood and likelihoodgradient of ARMA models,” IEEE Transactions on Automatic Control, volume 38, pp.336–340, February 1993.
J8. D. Burshtein, “Nondirect convergence radius and number of iterations of the Hopfieldassociative memory,” IEEE Transactions on Information Theory, volume 40, pp. 838–847, May 1994.
J9. D. Robinson, M. Tieder, H. Halperin, D. Burshtein and Z. Nevo, “Maffucci’ssyndrome – the result of neural abnormalities?,” Cancer, volume 74, pp. 949–957,August 1994.
J10. D. Burshtein, “Robust parametric modeling of durations in hidden Markov models,”IEEE Transactions on Speech and Audio Processing, volume 4, pp. 240–242, May 1996.
J11. A. Erell and D. Burshtein, “Noise adaptation of HMM speech recognition systemsusing tied-mixtures in the spectral domain,” IEEE Transactions on Speech and AudioProcessing, volume 5, pp. 72–74, January 1997.
J12. D. Burshtein, “Long term attraction in higher order neural networks,” IEEE Trans-actions on Neural Networks, volume 9, no. 1, pp. 42–50, January 1998.
J13. D. Burshtein, “Typical error pattern recovery of the Hopfield memory under error-tolerant conditions,” IEEE Transactions on Information Theory, volume 44, no. 2, pp.861–865, March 1998.
David Burshtein, 2010 5
J14. S. Gannot, D. Burshtein and E. Weinstein, “Iterative and sequential Kalmanfilter-based speech enhancement algorithms,” IEEE Transactions on Speech and AudioProcessing, volume 6, no. 4, pp. 373–385, July 1998.
J15. J. Goldberger and D. Burshtein, “Scaled random trajectory segment models,”Computer Speech and Language, volume 12, pp. 51–73, March 1998.
J16. J. Goldberger, D. Burshtein and H. Franco, “Segmental modeling using a con-tinuous mixture of non-parametric models,” IEEE Transactions on Speech and AudioProcessing, volume 7, pp. 262–271, May 1999.
J17. D. Burshtein and G. Miller, “Expander graph arguments for message passing algo-rithms,” IEEE Transactions on Information Theory, volume 47, pp. 782–790, February2001.
J18. Y. Bendel, D. Burshtein, O. Shalvi and E. Weinstein, “Delayless frequencydomain acoustic echo cancellation,” IEEE Transactions on Speech and Audio Processing,volume 9, pp. 589–597, July 2001.
J19. S. Gannot, D. Burshtein and E. Weinstein, “Signal enhancement using beamform-ing and non-stationarity with applications to speech,” IEEE Transactions on SignalProcessing, volume 49, pp. 1614–1626, August 2001.
J20. G. Miller and D. Burshtein, “Bounds on the Maximum Likelihood decoding errorprobability of LDPC codes,” IEEE Transactions on Information Theory, volume 47,no. 7, pp. 2696–2710, November 2001.
J21. D. Burshtein and G. Miller, “Iterative decoding of LDPC codes: some bounds andproperties,” Physica A, volume 302, pp. 35–43, December 2001.
J22. D. Burshtein, D. Rainish, S. Shamai and D. Ben-Eli, “Fast synchronizationmethod for CDMA communication systems,” IEEE Journal on Selected Areas in Com-munications, volume 19, no. 12, pp. 2396–2405, December 2001.
J23. D. Burshtein and G. Miller, “Bounds on the performance of belief propagationdecoding,” IEEE Transactions on Information Theory, volume 48, no. 1, pp. 112–122,January 2002.
J24. D. Burshtein, M. Krivelevich, S. Litsyn and G. Miller, “Upper bounds on therate of LDPC codes,” IEEE Transactions on Information Theory, volume 48, no. 9,pp. 2437–2449, September 2002.
J25. D. Burshtein and S. Gannot, “Speech enhancement using a mixture-maximummodel,” IEEE Transactions on Speech and Audio Processing, volume 10, no. 6, pp.341–351, September 2002.
J26. R. Yaniv and D. Burshtein, “An enhanced dynamic time warping model for im-proved estimation of DTW parameters,” IEEE Transactions on Speech and Audio Pro-cessing, volume 11, no. 3, pp. 216–228, May 2003.
J27. A. Bennatan and D. Burshtein, “On the application of LDPC codes to arbitrarydiscrete-memoryless channels,” IEEE Transactions on Information Theory, volume 50,no. 3, pp. 417–438, March 2004.
David Burshtein, 2010 6
J28. S. Gannot, D. Burshtein and E. Weinstein, “Analysis of the power spectral devi-ation of the general transfer function GSC,” IEEE Transactions on Signal Processing,volume 52, no. 4, pp. 1115–1120, April 2004.
J29. A. Ben-Yishai and D. Burshtein, “A discriminative training algorithm for hiddenMarkov models,” IEEE Transactions on Speech and Audio Processing, volume 12, no.3, pp. 204–217, May 2004.
J30. D. Burshtein and G. Miller, “Asymptotic enumeration methods for analyzing LDPCcodes,” IEEE Transactions on Information Theory, volume 50, no. 6, pp. 1115–1131,June 2004.
J31. O. Barak, D. Burshtein and M. Feder, “Bounds on achievable rates of LDPCcodes used over the binary erasure channel”, IEEE Transactions on Information Theory,volume 50, no. 10, pp. 2483–2489, October 2004.
J32. D. Burshtein and G. Miller, “An efficient maximum likelihood decoding of LDPCcodes over the binary erasure channel,” IEEE Transactions on Information Theory,volume 50, no. 11, pp. 2837–2844, November 2004.
J33. A. Bennatan and D. Burshtein, “Design and analysis of nonbinary LDPC codes forarbitrary discrete-memoryless channels,” IEEE Transactions on Information Theory,volume 52, no. 2, pp. 549–583, February 2006.
J34. A. Bennatan, D. Burshtein, G. Caire and S. Shamai, “Superposition coding forside-information channels,” IEEE Transactions on Information Theory, volume 52, no.5, pp. 1872–1889, May 2006.
J35. S. Freundlich, D. Burshtein and S. N. Litsyn, “Approximately Lower TriangularEnsembles of LPDC Codes with Linear Encoding Complexity,” IEEE Transactions onInformation Theory, volume 53, no. 4, pp. 1484–1494, April 2007.
J36. H. Aronowitz and D. Burshtein, “Efficient Speaker Recognition Using Approx-imated Cross Entropy (ACE),” IEEE Transactions on Audio, Speech and LanguageProcessing, Special issue on Speaker and Language Recognition, volume 15, no. 7, pp.2033–2043, September 2007.
J37. O. Barak and D. Burshtein, “Lower Bounds on the Error Rate of LDPC CodeEnsembles,” IEEE Transactions on Information Theory, volume 53, no. 11, pp. 4225–4236, November 2007.
J38. A. Sloin and D. Burshtein, “Support Vector Machine Training for Improved HiddenMarkov Modeling,” IEEE Transactions on Signal Processing, volume 56, no. 1, pp.172–188, January 2008.
J39. A. Bennatan and D. Burshtein, “On the Fading Paper Achievable Region of theFading MIMO Broadcast Channel,” IEEE Transactions on Information Theory, volume54, no. 1, pp. 100–115, January 2008.
J40. D. Burshtein, “On the Error Correction of Regular LDPC Codes using the FlippingAlgorithm,” IEEE Transactions on Information Theory, volume 54, no. 2, pp. 517–530,February 2008.
David Burshtein, 2010 7
J41. I. Goldenberg and D. Burshtein, “Upper Bound on Error Exponent of RegularLDPC Codes Transmitted over the BEC,” IEEE Transactions on Information Theory,volume 55, no. 6, pp. 2674–2681, June 2009.
J42. D. Burshtein, “Iterative Approximate Linear Programming Decoding of LDPC Codeswith Linear Complexity,” IEEE Transactions on Information Theory, volume 55, no.11, pp. 4835–4859, November 2009.
J43. O. Barak, U. Erez and D. Burshtein, “Bounds on Rates of LDPC Codes for BECwith Varying Erasure Rate,” IEEE Transactions on Communications, vol. 58, no. 10,pp. 2835-2844, October 2010.
Other Edited Publications
E1. H. Aronowitz, D. Burshtein and A. Amir, “Speaker indexing in audio archivesusing Gaussian mixture scoring simulation,” Lecture Notes in Computer Science (LNCS)(revised selected papers from MLMI’04), volume 3361, pp. 243–252, S. Bengio and H.Bourlard (Editors), Springer Verlag, Berlin, Germany, 2005.
David Burshtein, 2010 8
Conferences
C1. L. R. Bahl, R. Bakis, J. Bellegarda, P. F. Brown, D. Burshtein, S. K. Das,
P. V. de Souza, P. S. Gopalakrishnan, F. Jelinck, D. Kanevsky, R. L. Mer-
cer, A. J. Nadas, D. Nahamoo and M. A. Picheny, “Large Vocabulary NaturalLanguage Continuous Speech Recognition,” in Proc. Int. Conf. Acoust., Speech, SignalProcessing, vol. 1, pp. 465-467, Glasgow, Scotland, May 1989.
C2. D. Burshtein, V. Della Pietra, D. Kanevsky and A. Nadas, “Minimum impuritypartitions for classification and regression,” invited talk, The 2’nd Conference of theIFCS, University of Virginia, Charlottesville, June 1989.
C3. D. Burshtein, “Joint estimation of pitch and AR parameters using the EM algorithm,”Proceedings of the International Conference on Acoustics, Speech and Signal Processing,volume 2, pp. 797-800, April 1990.
C4. D. Burshtein, V. Della Pietra, D. Kanevsky and A. Nadas, “A Splitting theoremfor tree construction,” The International Symposium on Information Theory, Budapest,June 1991.
C5. D. Burshtein, “Nondirect Convergence Analysis of the Hopfield Associative Memory,”World Congress on Neural Networks, Portland (Oregon), July 1993.
C6. D. Burshtein, “Neural Network Training Using the Simulated Annealing Method,”World Congress on Neural Networks, Portland (Oregon), July 1993.
C7. D. Burshtein, “Robust Parametric Modeling of Durations in Hidden Markov Models,”Proceedings of the International Conference on Acoustics, Speech and Signal Processing,Detroit (Michigan), May 1995.
C8. S. Gannot, D. Burshtein and E. Weinstein, “Iterative-batch and sequential algo-rithms for single microphone speech enhanement,” IEEE-Israel Conference, Jerusalem,Nov. 1996.
C9. S. Gannot, D. Burshtein and E. Weinstein, “Iterative-batch and sequential al-gorithms for single microphone speech enhancement,” Proceedings of the InternationalConference on Acoustics, Speech and Signal Processing, Munich, Apr. 1997.
C10. J. Goldberger, D. Burshtein and H. Franco, “Segmental modeling using a con-tinuous mixture of non-parametric models,” Eurospeech, vol. 3, pp. 1195-1198, Sept.1997.
C11. J. Goldberger and D. Burshtein, “Scaled random segmental models,” Proceedingsof the International Conference on Acoustics, Speech and Signal Processing, Seattle,May 1998.
C12. D. Burshtein and S. Gannot, “Speech enhancement using a mixture-maximummodel,” Eurospeech, vol. 6, pp. 2591-2594, Sept. 1999.
C13. S. Gannot, D. Burshtein and E. Weinstein, “Beamforming methods for multi-channel speech enhancement,” Proceedings of the International Workshop on AcousticEcho and Noise Control (IWAENC’99), pp. 96-99, Sept. 1999.
David Burshtein, 2010 9
C14. G. Miller and D. Burshtein, “Bounds on the Maximum Likelihood decoding er-ror probability of LDPC codes,” Proceedings of the IEEE International Symposium onInformation Theory (ISIT-2000), p. 290, Sorrento, Italy, June 2000.
C15. D. Burshtein and G. Miller, “Iterative decoding of LDPC codes: some bounds andproperties,” invited talk, Frontiers in the physics of complex systems, Israel, March2001.
C16. D. Burshtein and G. Miller, “Bounds on the performance of belief propagation de-coding,” IEEE International Symposium on Information Theory (ISIT-2001), Washing-ton - DC. Also presented in “Workshop on Statistical Physics and Capacity-ApproachingCodes”, Trieste, Italy, May 2001.
C17. S. Gannot, D. Burshtein and E. Weinstein, “Theoretical analysis of the gen-eral transfer function GSC,” The International Workshop on Acoustic Echo and NoiseControl (IWAENC–2001).
C18. D. Burshtein, M. Krivelevich, S. Litsyn and G. Miller, “Upper bounds on therate of LDPC codes,” Proceedings of the IEEE International Symposium on InformationTheory (ISIT-2002), p. 28, Lausanne, Switzerland, July 2002.
C19. D. Burshtein and G. Miller, “The application of asymptotic enumeration to theanalysis of LDPC codes,” invited talk, the 40th Annual Allerton Conference on Com-munication, Control and Computing, the University of Illinois, October 2002.
C20. G. Caire, D. Burshtein and S. Shamai, “LDPC coding for interference mitigationat the transmitter,” invited talk, the 40th Annual Allerton Conference on Communi-cation, Control and Computing, the University of Illinois, October 2002.
C21. T. Friedlander and D. Burshtein, “Decoding algorithms for LDPC codes transmit-ted over channels with ISI,” The 22nd Convention of Electrical and Electronics Engi-neers in Israel, p. 268, December 2002.
C22. A. Bennatan and D. Burshtein, “On the application of LDPC codes to arbitrarydiscrete-memoryless channels,” the IEEE International Symposium on Information The-ory (ISIT-2003).
C23. D. Burshtein and G. Miller, “An efficient maximum likelihood decoding of LDPCcodes over the binary erasure channel,” 3rd Asia-Europe workshop on Information the-ory, Kamogawa, Japan, June 2003
C24. A. Bennatan and D. Burshtein, “Iterative Decoding of LDPC Codes over ArbitraryDiscrete-Memoryless Channels,” invited talk, the 41st Annual Allerton Conference onCommunication, Control and Computing, the University of Illinois, October 2003.
C25. G. Caire, A. Bennatan, D. Burshtein and S. Shamai, “Coding schemes for thebinary symmetric channel with known interference,” invited talk, the 41st AnnualAllerton Conference on Communication, Control and Computing, the University of Illi-nois, October 2003.
C26. A. Bennatan, D. Burshtein, G. Caire and S. Shamai, “Superposition codingfor Gaussian dirty paper,” The 23rd IEEE Convention of Electrical and ElectronicsEngineers in Israel (IEEEI 2004), Herzlia, Israel, September 2004.
David Burshtein, 2010 10
C27. A. Bennatan, D. Burshtein, G. Caire and S. Shamai, “Superposition coding forGaussian dirty paper,” submitted to The 2004 International Symposium on InformationTheory and its Applications (ISITA 2004), Parma, Italy, October 2004.
C28. H. Aronowitz, D. Burshtein and A. Amir, “Text Independent Speaker RecognitionUsing Speaker Dependent Word Spotting,” The 8th International Conference on SpokenLanguage Processing (ICSLP), Jeju Island, Korea, October 2004.
C29. H. Aronowitz, D. Burshtein and A. Amir, “Speaker indexing in audio archivesusing test utterance Gaussian mixture modeling,” The 8th International Conference onSpoken Language Processing (ICSLP), Jeju Island, Korea, October 2004.
C30. H. Aronowitz and D. Burshtein, “Efficient speaker identification and retrieval,” inProc. 9’th European Conference on Speech Communication and Technology, Interspeech2005, pp. 2433–2436, Lisbon, Portugal, September 2005.
C31. H. Aronowitz, D. Irony and D. Burshtein, “Modeling Intra-Speaker Variabilityfor Speaker Recognition,” in Proc. 9’th European Conference on Speech Communicationand Technology, Interspeech 2005, pp. 2177–2180, Lisbon, Portugal, September 2005.
C32. O. Barak and D. Burshtein, “Lower Bounds on the Spectrum and Error Rate ofLDPC Code Ensembles,” The IEEE International Symposium on Information Theory(ISIT-2005), Adelaide, Australia, September 2005.
C33. A. Bennatan and D. Burshtein, “EXIT charts for non-binary LDPC codes overarbitrary discrete memoryless channels,” The IEEE International Symposium on Infor-mation Theory (ISIT-2005), Adelaide, Australia, September 2005.
C34. S. Freundlich, D. Burshtein and S. N. Litsyn, “Approximately Lower TriangularEnsembles of LPDC Codes with Linear Encoding Complexity,” The IEEE InternationalSymposium on Information Theory (ISIT-2006), Seattle, July 2006.
C35. D. Burshtein and O. Barak, “Upper Bounds on the Error Exponents of LDPC CodeEnsembles,” The IEEE International Symposium on Information Theory (ISIT-2006),Seattle, July 2006.
C36. A. Sloin and D. Burshtein, “Support Vector Machine Re-scoring of Hidden MarkovModels,” The IEEE 24th Convention of Electrical and Electronics Engineers in Israel,Eilat, November 2006.
C37. A. Bennatan and D. Burshtein, “On the Fading Paper Achievable Region of theFading MIMO Broadcast Channel,” invited talk, The 44th Annual Allerton Conferenceon Communication, Control and Computing, the University of Illinois, September 2006.
C38. D. Burshtein, “On the Error Correction of Regular LDPC Codes using the FlippingAlgorithm,” The IEEE International Symposium on Information Theory (ISIT-2007),Nice, France, June 2007.
C39. O. Barak, U. Erez and D. Burshtein, “Bounds on Rates of LDPC Codes forBEC with Varying Erasure Rate,” The IEEE International Symposium on InformationTheory (ISIT-2008), Toronto, Canada, July 2008.
David Burshtein, 2010 11
C40. D. Burshtein, “Iterative Approximate Linear Programming Decoding of LDPC Codeswith Linear Complexity,” The IEEE International Symposium on Information Theory(ISIT-2008), Toronto, Canada, July 2008.
C41. D. Burshtein, “Linear Complexity Approximate LP Decoding of LDPC Codes: Gen-eralizations and Improvements,” The 5’th International Symposium on Turbo Codes andRelated Topics, Lausanne, Switzerland, September 2008.
C42. I. Goldenberg and D. Burshtein, “Upper Bound on the Error Exponent of RegularLDPC Codes Transmitted over the BEC,” The 5’th International Symposium on TurboCodes and Related Topics, Lausanne, Switzerland, September 2008.
C43. D. Burshtein, “On the Correction of a Fixed Fraction of Errors in LDPC Codes UsingIterative Decoding Algorithms,” invited plenary session talk, The 5’th InternationalSymposium on Turbo Codes and Related Topics, Lausanne, Switzerland, September2008.
C44. O. Levi and D. Burshtein, “Bounds on the Thresholds of Non-binary LDPC Codes,”The IEEE 25th Convention of Electrical and Electronics Engineers in Israel, Eilat,December 2008.
C45. D. Burshtein and I. Goldenberg, “Improved Linear Programming Decoding andBounds on the Minimum Distance of LDPC Codes,” invited session on LDPC codes
organized by S. Litsyn and D. Burshtein, The IEEE Information Theory Work-shop, Dublin, Ireland, August 2010.
C46. I. Goldenberg and D. Burshtein, “Error Bounds for Repeat-Accumulate CodesDecoded via Linear Programming,” The 6’th International Symposium on Turbo Codesand Iterative Information Processing, Brest, France, September 2010.
C47. D. Goldin and D. Burshtein, “Approximate Iterative Linear Programming Decodingof LDPC Codes over GF(q) with Linear Complexity,” The IEEE 26th Convention ofElectrical and Electronics Engineers in Israel, Eilat, November 2010.
David Burshtein, 2010 12
Patents
P1. “Pattern recognition system and method,” joint with A. Erell, US patent no. 5,778,342,July 1998.
P2. “Apparatus and method for detecting digital FM,” joint with D. Rainish, US patentsno. 5,994,953 and 6,323,727, Nov. 1999 and Nov. 2001.
P3. “Efficient way to produce a delayed version of a maximum length sequence using adivision circuit,” US patent no. 6,038,577, Mar. 2000.
P4. “Method and device for detecting rate,” US patents no. 6,112,325 and 6,560,744, August2000 and May 2003.
P5. “Code synchronization unit and method,” joint with D. Rainish, S. Shamai (Shitz) andD. Ben-Eli, US patents no. 6,163,548 and 6,788,708, December 2000 and September2004.
P6. “Maximum likelihood sequence estimation in the presence of co-channel interference,”joint with D. Rainish, US patent no. 6,298,102, October 2001.
Nicolo Cesa-Bianchi: Curriculum vitæ et studiorumBorn 18.6.1963. Milan, Italy.
Current position
Professor of Computer Science, Universita degli Studi di Milano.
Address
Dipartimento di Scienze dell’InformazioneUniversita degli Studi di Milanovia Comelico 39, 20135 Milano, Italyphone: +39-02-503-16280email: [email protected]: www.cesa-bianchi.net
Education
1993 Ph.D. in Computer Science, Universita degli Studi di Milano.
1991–1993 Visiting scholar, University of California at Santa Cruz.
1993–1994 Postdoctoral student, Institute for Theoretical Computer Science, Graz University, Austria.
Past academic positions
1994–1998 Assistant professor, Dept. of Information Sciences, Universita degli Studi di Milano.
1998–2003 Associate professor, Dept. of Information Sciences, Universita degli Studi di Milano.
Professional activities
1997–2000 Member of the steering committee for the European Conf. on Computational Learning Theory.
1999–2005 Member of the reviewer board for Mathematical Reviews.
2000–2003 Member of the steering committee for the Conference on Computational Learning Theory.
1999 Co-editor of the special issue on papers from the 11th Annual Conference on Computational LearningTheory. Machine Learning, 37(3)239–240. Kluwer, 1999.
2000 Program chair of the Thirteenth Annual Conference on Computational Learning Theory, 28.6–1.7.2000,Stanford, USA
2001–2005 Associate editor for the Machine Learning journal.
2002 Program chair of the Thirteenth International Conference on Algorithmic Learning Theory, 24–26.11.2002,Lubeck, Germany, and co-editor of the associated special issue. Theoretical Computer Science, 350(1). El-sevier, 2006.
2005–NOW Action editor for the Machine Learning journal.
2009–NOW Action editor for the Journal of Machine Learning Research
2006–2009 President of the Association for Computational Learning.
February 2007 Invited professor at Ecole Normale Superieure, Paris, France.
1
2007 Area chair of the Twenty-First Annual Conference on Neural Information Processing Systems, 3–8.12.2007, Vancouver, Canada.
2009-2013 Panel member for the IDEAS programme (Advanced Grants) of the European Research Council.
2009 Area chair of the Twenty-Third Annual Conference on Neural Information Processing Systems, 7–12.12.2009, Vancouver, Canada.
2009 Co-editor of the special issue on “Learning from Multiple Sources”. Machine Learning, 79(1-2).Springer, 2010.
2009 Co-organizer of the NIPS workshop on “Learning from Multiple Sources with Applications to Robotics”,12.12.2009, Whistler, Canada.
2010–NOW Member of the College of Reviewers for Canada Research Chairs.
Invited talks in international events
International school “Principles of Nonparametric Learning”, 9–13.7.2001, Udine, Italy.
Workshop “Learning Theory”, International Conference on Foundations of Computational Mathematics,5–7.8-2002, Minneapolis, USA.
Workshop “Universal Learning Algorithms”, International Conference on Neural Information ProcessingSystems, 14.12.2002, Vancouver, Canada.
Workshop “Asymptotic Geometric Analysis and Machine Learning”, 24–26.3.2003, Marne-la-Vallee, France.
First joint Canada-France meeting of the mathematical sciences, 12-15.7.2004, Tolouse, France.
Workshop “Mathematical Foundations of Learning Theory”, 18–23.6.2004, Barcelona, Spain.
Fifteenth International Conference on Algorithmic Learning Theory, 2–5.10.2004, Padova, Italy.
Conference “Foundations of Computational Mathematics”, 4–6.7.2005, Santander, Spain.
25th European Meeting of Statisticians, 24–28.7.2005, Oslo, Norway.
International school on “The analysis of Patterns”, 29.10–4.11.2005, Erice, Italy.
IEEE Information Theory Workshop (ITW 2006), 13–17.3.2006, Punta del Este, Uruguay.
Workshop “Mathematical Foundations of Learning Theory II”, 31.5–3.6.2006, Paris, France.
Workhop “Advances in Statistical Aggregation”, 2007 Joint Statistical Meetings, 29.7–2.8.2007, Salt LakeCity, USA.
Workshop “Information Beyond Shannon”, 29–30.12.2008, Venice, Italy.
Conference “41emes Journees de Statistique”, Societe Francaise de Statistique (SFdS), 25–29.5.2009, Bor-deaux, France.
Machine Learning Seminar, IBM Haifa Research Lab, 7.6.2009, Haifa, Israel.
IEEE Workshop on Automatic Speech Recognition and Understanding, 13–17.12.2009, Merano, Italy.
ACM/BCS Visions Conference, 13–16.4.2010, Edinburgh, UK.
28th European Meeting of Statisticians, 17–22.8.2010, Piraeus, Greece.
2
Grants
1998–2001 Neural and Computational Learning II (EP 27150), IV framework, European Commission.
2001–2004 Kernel Methods for Images and Text (IST-2000-25431), V framework, European Commission.
2003–2007 Pattern Analysis, Statistical Modelling and Computational Learning (IST-2002-506778), VIframework, European Commission.
2006–2009 Statistical Multilingual Analysis for Retrieval and Translation (IST-FP6-033917), VI framework,European Commission.
2008–2012 Pattern Analysis, Statistical Modelling and Computational Learning 2 (ICT-216886), VII frame-work, European Commission.
2010–2011 Google Research Award.
Summary of research interestsMy research interests focus on the theory and application of machine learning. The main themes include:game-theoretic learning, design and analysis of learning algorithms, and the theory of statistical learning.
• Game-theoretic learning. This line of research is concerned with the study of algorithms that se-quentially predict the elements of a stream of data without making any assumption on the source. Thestudy of prediction of individual sequences was indipendently pursued in several areas, motivated byproblems as different as playing repeated games, compressing data, and classifying patterns. In aseries of papers, starting with “How to use expert advice”, I have carried out a comprehensive inves-tigation of the area and developed algorithms for several variants of the basic sequential forecastingproblem. These and further results have been collected in the monography “Prediction, learning, andgames” published by Cambridge University Press in 2006. Recently, I have started to apply the game-theoretic learning framework to classification problems in networked data represented as weightedgraphs.
• Design, analysis, and empirical validation of algorithms for pattern analysis. I am also interestedin the design of incremental learning algorithms that operate efficiently on large amounts of data andexhibit a performance that degrades gracefully in the presence of noise. In this area I have devel-oped and analyzed several kernel-based algorithms for regression, filtering, active learning, memorybounded learning, and hierarchical classification. Many of these algorithms have been tested on largetextual corpora (e.g, newsstories, medical abstracts, web pages).
• Statistical learning theory. In statistical learning one assumes that data are generated by independentdraws from a fixed and unknown probability distribution. Owing to its analytical tractability, thishas become the standard model for the study of learning algorithms in the framework of uniformconvergence theory. In this area I have shown the first combinatorial characterization of learnabilityfor general regression functions in terms of a suitable generalization of the Vapnik-Chervonenkisdimension. More recently, I have proven bounds on the risk of functions in the ensemble generatedby incremental training of learning algorithms.
3
List of publications
Books and book chapters
[B2] N. Cesa-Bianchi and G. Lugosi. Prediction, Learning, and Games. Cambridge University Press, 2006.
[B1] N. Cesa-Bianchi. Universal prediction. In: L. Gyorfi (editor), Principles of Nonparametric Learning,Springer (CISM courses and lectures no. 434), 2002.
Editorship of conference proceedings
[E2] N. Cesa-Bianchi, M. Numao and R. Reischuk. Proceedings of the 13th International Conference onAlgorithmic Learning Theory. Lecture Notes in Artificial Intelligence 2533, Springer, 2002.
[E1] N. Cesa-Bianchi and S. Goldman Proceedings of the 13th Annual Conference on ComputationalLearning Theory. ACM Press, 2000.
Journal papers
[J35] G. Cavallanti, N. Cesa-Bianchi, and C. Gentile. Linear algorithms for online multitask classificationJournal of Machine Learning Research, 11:2597–2630, 2010.
[J34] G. Cavallanti, N. Cesa-Bianchi, and C. Gentile. Learning noisy linear classifiers via Adaptive andSelective Sampling Machine Learning. To appear.
[J33] N. Cesa-Bianchi, D.R. Hardoon, and G. Leen. Guest Editorial: Learning from multiple sources.Machine Learning, 79(1–2):1–3. Springer, 2010.
[J32] G. Valentini and N. Cesa-Bianchi. HCGene: a software tool to support the hierarchical classificationof genes. Bioinformatics, 24(5):729-731, 2008.
[J31] N. Cesa-Bianchi and C. Gentile. Improved risk tail bounds for on-line algorithms. IEEE Transactionson Information Theory, 54(1)386-390. IEEE Press, 2008.
[J30] N. Cesa-Bianchi. Applications of regularized least squares to pattern classification. TheoreticalComputer Science, 382(3):221-231, Elsevier, 2007.
[J29] G. Cavallanti, N. Cesa-Bianchi and C. Gentile. Tracking the best hyperplane with a simple budgetPerceptron. Machine Learning, 69(2/3):143-167, Springer, 2007.
[J28] N. Cesa-Bianchi, Y. Mansour and G. Stoltz. Improved second-order bounds for prediction with expertadvice. Machine Learning, 66(2/3):321-352. Springer, 2007.
[J27] N. Cesa-Bianchi, G. Lugosi and G. Stoltz. Regret minimization under partial monitoring. Mathematicsof Operations Research, 31(3):562–580. INFORMS, 2006.
[J26] N. Cesa-Bianchi, C. Gentile and L. Zaniboni. Worst-case analysis of selective sampling for linearclassification. Journal of Machine Learning Research, 7:1205–1230, 2006.
[J25] P. Auer and N. Cesa-Bianchi. A distributed voting scheme to maximize preferences. RAIRO -Theoretical Informatics and Applications, 40:389–403. EDP Sciences, 2006.
4
[J24] N. Cesa-Bianchi, C. Gentile and L. Zaniboni. Incremental Algorithms for Hierarchical Classification.Journal of Machine Learning Research, 7:31–54, 2006.
[J23] N. Cesa-Bianchi, R. Reischuk and T. Zeugmann. Foreword. Theoretical Computer Science, 350(1)1–2. Elsevier, 2006. Special issue: 13th International Conference on Algorithmic Learning Theory.
[J22] N. Cesa-Bianchi, G. Lugosi and G. Stoltz Minimizing regret with label efficient prediction. IEEETransactions on Information Theory, 51(6):2152–2162. IEEE Press, 2005.
[J21] N. Cesa-Bianchi, A. Conconi and C. Gentile. A second-order Perceptron algorithm. SIAM Journalon Computing, 34(3):640–668. SIAM, 2005.
[J20] N. Cesa-Bianchi, A. Conconi and C. Gentile. On the generalization ability of on-line learning algo-rithms. IEEE Transactions on Information Theory, 50(9):2050–2057. IEEE Press, 2004.
[J19] N. Cesa-Bianchi and G. Lugosi. Potential-based algorithms in on-line prediction and game theory.Machine Learning, 51(3):239–261. Kluwer, 2003.
[J18] P. Auer, N. Cesa-Bianchi, Y. Freund and R.E. Schapire. The nonstochastic multiarmed bandit problem.SIAM Journal on Computing, 32(1):48-77, 2002.
[J17] P. Auer, N. Cesa-Bianchi and C. Gentile. Adaptive and self-confident on-line learning algorithms.Journal of Computer and System Sciences, 64(1):48–75, 2002.
[J16] P. Auer, N. Cesa-Bianchi and P. Fischer Finite-time analysis of the multiarmed bandit problem.Machine Learning, 47(2/3):235–256. Kluwer, 2002.
[J15] N. Cesa-Bianchi and G. Lugosi. Worst-case bounds for the logarithmic loss of predictors. MachineLearning, 43(3):247–264. Kluwer, 2001.
[J14] J. Baxter and N. Cesa-Bianchi. Guest editors’ introduction. Machine Learning, 37(3)239–240.Kluwer, 1999. Special issue: 11th Annual Conference on Computational Learning Theory.
[J13] N. Cesa-Bianchi and G. Lugosi. On prediction of individual sequences. The Annals of Statistics,27(6):1865-1895. The Institute of Mathematical Statistics, 1999.
[J12] N. Cesa-Bianchi. Analysis of two gradient-based algorithms for on-line regression. Journal ofComputer and System Sciences, 59(3):392–411. Academic Press, 1999.
[J11] N. Cesa-Bianchi, E. Dichterman, P. Fischer, E. Shamir and H.U. Simon. Sample-efficient strategiesfor learning in the presence of noise. Journal of the ACM, 46(5):684–719. ACM Press, 1999.
[J10] N. Cesa-Bianchi, D.P. Helmbold and S. Panizza. On Bayes methods for on-line boolean prediction.Algorithmica, 22(1/2):112–137. Springer, 1998.
[J9] N. Cesa-Bianchi and D. Haussler. A graph-theoretic generalization of the Sauer-Shelah lemma. Dis-crete Applied Mathematics, 86(1):27–35. Elsevier, 1998.
[J8] N. Alon, S. Ben-David, N. Cesa-Bianchi and D. Haussler. Scale-sensitive dimensions, uniform conver-gence, and learnability. Journal of the ACM, 44(4):615–631. ACM Press, 1997.
[J7] N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R. Schapire and M.K. Warmuth. How to useexpert advice. Journal of the ACM, 44(3):427–485. ACM Press, 1997.
[J6] P. Auer and N. Cesa-Bianchi. On-line learning with malicious noise and the Closure Algorithm. Annalsof Mathematics and Artificial Intelligence, 23(1/2):83-99. Baltzer Science Publishers, 1998.
5
[J5] N. Cesa-Bianchi, Y. Freund, D.P. Helmbold and M.K. Warmuth. On-line prediction and conversionstrategies. Machine Learning, 25:71–110. Kluwer Academic Publishing, 1996.
[J4] N. Cesa-Bianchi, P.M. Long and M.K. Warmuth. Worst-case quadratic loss bounds for prediction usinglinear functions and gradient descent. IEEE Transactions on Neural Networks, 7(3):604–619. IEEE Press,1996.
[J3] A. Bertoni, N. Cesa-Bianchi and G. Fiorino. Efficient learning with equivalence queries of conjunctionsof modulo functions. Information Processing Letters, 56:15–17. Elsevier, 1995.
[J2] S. Ben-David, N. Cesa-Bianchi, D. Haussler and P.M. Long. Characterizations of learnability forclasses of {0, . . . , n}-valued functions. Journal of Computer and System Sciences, 50(1):74–86. AcademicPress, 1995.
[J1] N. Cesa-Bianchi, A. Krogh and M.K. Warmuth. Bounds on approximate steepest descent for likelihoodmaximization in exponential families. IEEE Transactions on Information Theory, 40(4):1215–1218. IEEEPress, 1994.
Recent conference papers
N. Cesa-Bianchi, S. Shalev-Shwartz, and O. Shamir. Efficient learning with partially observed attributes.Proceedings of the 27th International Conference on Machine Learning. Omnipress, 2010.
N. Cesa-Bianchi, C. Gentile, F. Vitale, and G. Zappella. Random spanning trees and the prediction ofweighted graphs. Proceedings of the 27th International Conference on Machine Learning. Omnipress,2010.
N. Cesa-Bianchi, S. Shalev-Shwartz, and O. Shamir. Online learning of noisy data with kernels. Proceedingsof the 22nd Annual Conference on Learning Theory. Omnipress, 2010.
N. Cesa-Bianchi, C. Gentile, F. Vitale, and G. Zappella. Active learning on trees and graphs. Proceedingsof the 22nd Annual Conference on Learning Theory. Omnipress, 2010.
L. Jie, F. Orabona, M. Fornoni, B. Caputo, and N. Cesa-Bianchi OM-2: An online multi-class multi-kernellearning algorithm Proceedings of the 4th IEEE Online Learning for Computer Vision Workshop. IEEEPress, 2010.
N. Cesa-Bianchi, C. Gentile, and F. Vitale. Learning unknown graphs. Proceedings of the 20th InternationalConference on Algorithmic Learning Theory. Springer, 2009.
N. Cesa-Bianchi, C. Gentile, and F. Vitale. Fast and optimal prediction on a labeled tree. Proceedings of the22nd Annual Conference on Learning Theory. Omnipress, 2009.
N. Cesa-Bianchi, C. Gentile, and F. Orabona. Robust Bounds for Classification via Selective Sampling.Proceedings of the 26th International Conference on Machine Learning, Omnipress 2009.
N. Cesa-Bianchi and G. Lugosi. Combinatorial bandits. Proceedings of the 22nd Annual Conference onLearning Theory, Omnipress, 2009.
N. Cesa-Bianchi and G. Valentini. Hierarchical cost-sensitive algorithms for genome-wide gene functionprediction. Third International Workshop on Machine Learning in Systems Biology, 2009.
Milano, November 23, 2010
6
Curriculum Vitae George V. Moustakides
Address Department of Electrical and Computer Engineering, University of Patras, 26500 Rio, Greece.
Telephone: +30 2610 996405 (office), +30 2610 996445 (secretary); Fax: +30 2610 994798 E-mail: [email protected] Personal Website: http://www.ssp.ece.upatras.gr/moustakides/ Research Group Website: http://www.ssp.ece.upatras.gr/
Personal Information Born in Drama, Greece, in 1955. Married, no children.
Education PhD and MSc in Electrical Engineering and Computer Science (1980 - 1983), Princeton University, Department of Electrical Engineering and Computer Science. Thesis Title: The Representation of Bivariate Densities with Applications in Detection and Estimation. Thesis Advisor: John B. Thomas.
MSE in Systems Engineering (1979 - 1980), University of Pennsylvania, Department of Systems Engineering. Thesis Title: Robust Wiener Filters for Imprecise Second Order Statistics. Thesis Advisor: Saleem Kassam.
Diploma in Electrical Engineering (1973 - 1978), National Technical University of Athens, Department of Electrical & Mechanical Engineering. Thesis Title: Subharmonic oscillations in the systems ẍ+g(x,ẋ,t)=0. Thesis Advisor: John E. Diamessis.
Academic Positions Adjunct Professor (9/2009 - 1/2010), Department of Electrical Engineering, Columbia University, New York, NY, USA. (Invited by Prof. X. Wang).
Professor (2007 - Today), Department of Electrical & Computer Engineering, University of Patras, Pa-tras, Greece.
Research Scholar (10/2005 - 2/2006), Institute for Systems Research (ISR), University of Maryland, College Park, MA, USA. (Invited by Prof. J. Baras).
Professor (2002 - 2007), Department of Computer & Communication Engineering, University of Thes-saly, Volos, Greece.
Senior Rechercher (Directeur de Recherche) (2001 - 2004), Institut National de Recherche en Infor-matique et en Automatique (INRIA), France.
Research Scholar (9/2000 - 2/2001), Institut National de Recherche en Informatique et en Auto-matique (INRIA), France. (Invited by Dr. A. Benveniste).
Professor (1996 - 2002), Department of Computer Engineering and Informatics, University of Patras, Patras, Greece.
Associate Professor (1991 - 1996), Department of Computer Engineering and Informatics, University of Patras, Patras, Greece.
George V. Moustakides: Curriculum Vitae
2
Researcher (1988 - 1991), Computer Technology Institute of Patras, Patras, Greece.
Military Service (1986 - 1987), Greek Air Force. (Not an academic position, but a true "Academic" Experi-ence).
Junior Researcher (1983 - 1986), Institut National de Recherche en Informatique et en Automatique (INRIA), France.
Research and Teaching Assistant (1980 - 1983), Department of Electrical Engineering and Computer Science, Princeton University, Princeton, USA.
Research Assistant (1979 - 1980), Department of Systems Engineering, Moore School of Electrical Engineering, University of Pennsylvania, Philadelphia, USA.
Visiting Scholar (visits supported be the hosting institutes) University of Southern California (9/1/2011 - 28/2/2011), Department of Mathematics, Los Angeles, CA, USA. (Invited by Dr. A. Tartakovsky).
Bilkent University (1/9/2010 - 21/9/2010), Department of Industrial Engineering, Ankara, Turkey. (In-vited by Prof. S. Dayanik).
University of Southern California (10/1/2010 - 16/1/2010), Department of Mathematics, Los Angeles, CA, USA. (Invited by Dr. A. Tartakovsky).
Georgia Institute of Technology (12/7/2009 - 31/7/2009), School of Industrial and Systems Engineer-ing, Atlanta, GA, USA. (Invited by Prof. Y. Mei).
Université de Technologie de Troyes (8/6/2009 - 14/6/2009), Troyes, France. (Invited by Prof. I. Niki-forov).
University of Southern California (10/1/2009 - 25/1/2009), Department of Mathematics, Los Angeles, CA, USA. (Invited by Dr. A. Tartakovsky).
Georgia Institute of Technology (28/7/2008 - 30/8/2008), School of Industrial and Systems Engineer-ing, Atlanta, GA, USA. (Invited by Prof. Y. Mei).
Université de Technologie de Troyes (28/4/2008 - 7/5/2008), Laboratoire de Modélisation et de Sûreté de Systèmes, Troyes, France. (Invited by Prof. I. Nikiforov).
University of Southern California (5/2/2008 - 27/2/2008), Department of Mathematics, Los Angeles, CA, USA. (Invited by Dr. A. Tartakovsky).
Columbia University (15/5/2007 - 30/6/2007), Department of Statistics, New York, NY, USA. (Invited by the department to teach a summer course in Sequential Change detection).
Columbia University (31/3/2003-14/4/2003), Department of Statistics, New York, NY, USA. (Invited by Prof. Karatzas).
University of Pennsylvania (1/8/1999 – 31/8/1999), Department of Electrical Engineering, Philadel-phia, PA, USA. (Invited by Prof. S. Kassam).
Princeton University (1/8/1998 - 31/8/1998), Department of Electrical Engineering, Princeton, NJ, USA. (Invited by Prof. H.V. Poor).
Visiting Scholar (visits supported be the Greek Ministry of Education) Columbia University (19/7/2010 - 20/8/2010), Department of Electrical Engineering, New York, NY, USA. (Invited by Prof. X. Wang).
University of Pennsylvania (2/2000 - 7/2000), Department of Computer and Information Science, Philadelphia, PA, USA. (Invited by Prof. D. Metaxas).
Princeton University (10/1996 - 6/1997), Department of Electrical Engineering, Princeton, NJ, USA. (Invited by Prof. H.V. Poor).
George V. Moustakides: Curriculum Vitae
3
Teaching University of Patras, Greece Department of Computer Engineering and Informatics Undergraduate Level: Linear Algebra, Electric Circuits, Signals and Systems, Digital Signal Processing,
Digital Communications, Control Theory. Graduate Level: Detection and Estimation, Measure Theory (Lectures, Spring 1990).
Department of Electrical and Computer Engineering Undergraduate Level: Digital Signal Processing, Digital Signal Processing Laboratory, Stochastic Con-
trol, Fuzzy and Neural Control. Graduate Level: Detection and Estimation. Master's Interdepartmental Program, Signal Processing and Communication Systems Graduate Level: Detection and Estimation.
University of Thessaly, Greece Department of Computer and Communication Engineering Undergraduate Level: Signals and Systems, Digital Signal Processing. Graduate Level: Detection and Estimation.
Columbia University, USA Department of Statistics Graduate Level: Sequential Detection of Changes (Summer 2007).
Department of Electrical Engineering Graduate Level: Detection and Estimation (Fall 2009).
Student Advising George V. Moustakides is currently supervising one PhD student: Panagiotis Niavis (expected completion in 2013), Feedback cancellation algorithms in digital hearing aids, Department of Electrical and Computer Engineering, University of Patras, Patras, Greece.
And has been the PhD thesis advisor of: Georgios Fellouris (2010), Decentralized sequential decision making with asynchronous communica-tion, Statistics department, Columbia University, New York, NY, USA. Currently Post-Doc with the De-partment of Mathematics, University of Southern California, LA, USA.
Xenofon Doukopoulos (2004), Power techniques for blind channel estimation in wireless communica-tion systems, IRISA-INRIA, University of Rennes-1, Rennes, France. Currently with DibCom, Paris, France.
Emmanouil Psarakis (1991), Design of multidimensional FIR filters with the help of transformations, Department of Computer Engineering and Informatics, University of Patras, Greece. Currently Assis-tant Professor with the Computer Engineering and Informatics Department, University of Patras, Greece.
He has also participated in the supervision of the following PhD students: Alvaro Cardenas (2006), Evaluation of classifiers for security applications (Advisor: John Baras), De-partment of Electrical Engineering, University of Maryland, College Park, MD, USA. Currently with the Trusted Systems Innovation group, Fujitsu Laboratories of America, College Park, MA, USA.
Maben Rabi (2006), Packet based inference and control (Advisor: John Baras), Department of Electri-cal Engineering, University of Maryland, College Park, MD, USA. Currently Research Associate, De-partment of Engineering, University of Cambridge, Cambridge, United Kingdom.
Olympia Hadjiliadis (2005, honors), Change-point detection of two-sided alternatives in the Brownian motion model and its connection to the gambler's ruin problem with relative wealth perception (Advi-sor: Jan Vecer), Statistics department, Columbia University, New York, NY, USA. Currently, Associate Professor with the department of Mathematics, Brooklyn College, CUNY, New York, NY, USA.
George V. Moustakides: Curriculum Vitae
4
Jean-Luc Botto (1986), Study of the fast transversal algorithms: application to echo cancellation in audioconferencing (Advisor: Dr. Claude Samson), IRISA and University of Rennes-1, Rennes, France. Currently, with Phillips-France.
Prof. Moustakides is supervising one Master student: Giorgos Avramidis (expected completion 2010), Kalman filters and adaptive algorithms, Graduate in-ter-departmental program: Signal Processing & Communication Systems, University of Patras, Patras, Greece.
And has supervised the following Master students in the past: Nikoleta Garini (2009), Compression techniques for hearing aids, Graduate inter-departmental pro-gram: Signal Processing & Communication Systems, University of Patras, Patras, Greece.
Panagiotis Niavis (2009), Feedback cancellation algorithms, performance and stability analysis, Graduate inter-departmental program: Signal Processing & Communication Systems, University of Patras, Patras, Greece.
Charalambos Zarokostas (2009), Audio feedback cancellation in digital hearing aids, Graduate inter-departmental program: Signal Processing & Communication Systems, University of Patras, Patras, Greece.
Charalambos Stamatopoulos (2008), Detection of attacks in wireless networks, Graduate inter-departmental program: Signal Processing & Communication Systems, University of Patras, Patras, Greece.
Panagiota Matsuka (2007), Adaptive compression techniques for hearing aids, Graduate inter-departmental program: Signal Processing & Communication Systems, University of Patras, Patras, Greece.
Dimitrios Chatzoulis (2006), Turbo techniques for coding and equalization of telecommunication channels, Computer and Communication Engineering, University of Thessaly, Volos, Greece.
Amadou Dame Sall (2004), Bit Error Rate estimation in optical communication channels, DEA, Univer-sity of Rennes-1, Rennes, France. (Co-advisor with Frederic Cerou).
Xenofon Doukopoulos (2001), Blind channel estimation in CDMA communication systems, Graduate inter-departmental program: Signal Processing & Communication Systems, University of Patras, Pa-tras, Greece.
Prof. Moustakides is currently the diploma thesis advisor of four undergraduate students while he has supervised numerous undergraduate theses in the past.
Administrative Positions Head of the Computer Center (1994 - 2001), Department of Computer Engineering and Informatics, University of Patras.
Head of the Signal Processing & Communications Lab (1994 - 2001), Department of Computer Engi-neering and Informatics, University of Patras.
Co-Founder, Director and Vice Director (1998 - 2001) of the Master's Interdepartmental Program, Signal Processing and Communication Systems. Participating departments: Electrical & Computer En-gineering, Computer Engineering & Informatics, Physics, University of Patras, Greece.
Director of Graduate Studies (2004 - 2005), Department of Computer and Communication Engineer-ing, University of Thessaly, Volos, Greece.
Research Interests George V. Moustakides is active, or has demonstrated activity in the past, in the following areas: Sequential Detection and Optimal Stopping Sequential change detection and hypothesis testing (current activity) Event-triggered sampling in stochastic control and signal processing (current activity)
George V. Moustakides: Curriculum Vitae
5
Medical Signal Processing Signal processing for hearing aids (current activity) Detection techniques for noninvasive diagnostic methods
Applications of Probability and Statistics in Databases Privacy preserving data mining, Database security (current activity) Hypothesis testing techniques for record matching
Statistical and Adaptive Signal Processing Theoretical comparison methods based on stochastic approximation Adaptive signal processing algorithms and adaptive blind source separation Convergence study of adaptive estimation algorithms Stabilization of fast estimation algorithms Low computational complexity estimation algorithms for echo cancellation and equalization
Physical Layer Communications Detection of access layer misbehavior in Wireless Networks Blind channel estimation in CDMA and OFDM systems BER estimation in optical communication systems
1-D and 2-D Filter Design Techniques Design of two and multi-dimensional FIR filters using transformations and L2 techniques FIR and IIR polynomial predictive filters
Off Line Detection of Changes, Robust Detection and Estimation of Signals Detection and diagnosis of changes in physical structures Local techniques for detecting changes Robust detection and filtering of signals in dependent noise
Collaborations Bilkent University (2010 - Today), Department of Industrial Engineering, Ankara, Turkey. Collabora-tion with Prof. S. Dayanik on Bayesian sequential changepoint detection.
The City University of New York (2010 - Today), Hunter College, Department of Computer Science, New York, NY, USA. Collaboration with Prof. I. Stamos on Signal processing methods for discovering regularities in 2D and 3D geometry.
Columbia University (2009 - Today), Department of Electrical Engineering, New York, NY, USA. Col-laboration with Prof. X. Wang on Application of event-triggered sampling to DSP and Stochastic Con-trol.
Conversion Sound LLC (2008 - Today), Park Ridge, IL, USA. Collaboration with Dr. S. Basseas on Sig-nal processing for hearing aids.
Georgia Institute of Technology (2008 - 2010), School of Industrial and Systems Engineering, Atlanta, GA, USA. Collaboration with Prof. Y. Mei on Sequential change detection.
University of Southern California (2008 - Today), Department of Mathematics, Los Angeles, CA, USA. Collaboration with Dr. A. Tartakovsky on Sequential change detection.
Cambridge University (2008 - 2009), Department of Engineering, Cambridge, UK. Collaboration with Dr. M. Rabi on Event-triggered sampling.
Columbia University (2007 - 2010), Department of Statistics, New York, NY, USA. Collaboration with G. Fellouris on Sequential change detection.
University of Thessaly (2004 - Today), Department of Electrical & Computer Engineering, Volos, Greece. Collaboration with Prof. V. Verykios on Statistical techniques for databases.
Princeton University (1998 - 1999), Department of Electrical Engineering, Princeton, NJ, USA. Col-laboration with Prof. H.V. Poor on Multiuser communications.
George V. Moustakides: Curriculum Vitae
6
Membership in Societies Senior Member of IEEE (1997) Member of the Institute of Mathematical Statistics
R&D Projects George V. Moustakides has participated in the following R&D projects:
Early warning systems for natural disasters: application to epidemic outbreak detection (2011 - 2012, Leader). Department of Electrical and Computer Engineering, University of Patras, Greece. Financed by the Greek General Secretariat for Research and Technology. Bilateral collaboration program with the Department of Industrial Engineering, Bilkent University, Ankara, Turkey.
Adaptive signal processing algorithms for digital hearing aids (2008 - Today, Leader). Department of Electrical and Computer Engineering, University of Patras, Greece. Financed by Conversion Sound LLC, USA.
Robust rapid change-point detection in multi-sensor data fusion and behavior research (2008 - 2010, co-PI), Georgia Institute of Technology, School of Industrial and Systems Engineering, Atlanta, GA, USA. Financed by AFOSR.
BER estimation in optical communication systems (2002 - 2003, Leader). Institut National de Recher-che en Informatique et en Automatique (INRIA), Rennes, France. Financed by ALCATEL-France.
Adaptive techniques for wireless multiple-access communications (1998 - 1999), Department of Com-puter Engineering and Informatics, University of Patras, Greece. In collaboration with the Electrical Engineering departments of Princeton University and University of Pennsylvania, USA. NATO Scientific Exchange Program: Collaborative Research Grant.
Development and study of adaptive estimation algorithms for telecommunication applications (1995 - 1997, Leader). Department of Computer Engineering and Informatics, University of Patras, Greece. Financed by the Greek General Secretariat for Research and Technology.
Automatic finite element model generation of objects using image processing techniques (1992 - 1995, Leader). Computer Technology Institute, Patras, Greece. In collaboration with Agricultural Uni-versity of Athens, Greece, University of Leuven, Belgium, University of Swansea, Great Britain and University of Ilmenau, Germany. Financed by the EU Programme: Human Capital and Mobility.
Detection of visually evoked cortical potentials (1991 - 1992, Leader). Department of Computer Engi-neering and Informatics, University of Patras, Greece. Bilateral program with University of Ilmenau, Germany. Financed by the Greek and German General Secretariat for Research and Technology.
Development of a PC based visual evoked potentials station for noninvasive medical diagnosis (1991 - 1992, Leader). Department of Computer Engineering and Informatics, University of Patras, Greece. Financed by the Greek General Secretariat for Research and Technology.
Fast estimation algorithms for echo cancellation in communication channels (1989 - 1990), Depart-ment of Computer Engineering and Informatics, University of Patras, Greece. Financed by the Greek General Secretariat for Research and Technology.
Development of a DSP based bio-impedance monitoring station (1989 - 1990, Leader). Computer Technology Institute, Patras, Greece. Bilateral program with University of Ilmenau, Germany. Fi-nanced by the Greek and German General Secretariat for Research and Technology.
Signal processing techniques for detecting and localizing fatigues in off-shore platforms (1983 - 1986), Institut National de Research en Informatique et en Automatique (INRIA), France. Financed by Elf-Aquitaine.
Reviewer Prof. Moustakides has served as referee for the following journals and organizations: Mathematics - Statistics: Annals of Statistics; Automatica; Biometrika; Communications in Statistics - Theory and Methods; Journal of the Bernoulli Society for Mathematical Statistics and Probability;
George V. Moustakides: Curriculum Vitae
7
Mathematics of Operations Research; Sequential Analysis; Journal of Statistical Planning and Infer-ence; SIAM Journal on Control and Optimization.
Engineering - IEEE: Communication Letters; Journal of Selected Areas in Communications; Signal Processing Letters; Transactions on Circuits and Systems I & II; Transactions on Communications; Transactions on Information Theory; Transactions on Signal Processing; Transactions on Systems Man and Cybernetics.
Engineering - Other: International Journal on Adaptive Control and Signal Processing; Journal of Sound and Vibration; Kuwait Journal of Science and Engineering; Wireless Communications and Mo-bile Computing; Signal Processing (Elsevier).
Organizations/Publishers: Greek General Secretariat for Research and Technology; Israel Science Foundation; National Science Foundation, USA; Mathematical Reviews (American Mathematical Society); Région Champagne Ardenne, France; Wiley Publishing Company (book reviewer).
Conference/Workshop Organization Prof. Moustakides has participated in the organization of the following Conferences and Workshops: International Workshop on Applied Probability, IWAP 2010, 5-8 July, Universidad Carlos III of Madrid, Colmenarejo Campus, Madrid, Spain: Co-organizer with I. Nikiforov and A. Tartakovsky of the invited session "Sequential Detection & Estimation I,II,III,IV".
International Workshop on Sequential Methodologies, IWSM 2009, 15-17 June, Université de Tech-nologie de Troyes, Troyes, France: Steering committee, Program committee (Chair), Local organiza-tion committee, Co-organizer with A. Tartakovsky of the invited session "Sequential Testing and Op-timal Stopping I,II,III" and with I. Nikiforov of the invited session " Sequential change-point detection and isolation".
International Workshop on Sequential Methodologies, IWSM 2007, 22-25 July, Auburn University, Auburn, Alabama, USA: Steering committee.
European Signal Processing Conference, EUSIPCO 1998, 8-11 September, Rhode, Greece: Organizing committee (Tutorials).
Invited Talks Rate change detection in Poisson processes, application to epidemic surveillance (Jan. 2011), De-partment of Statistics and Applied Probability, University of California, Santa Barbara, USA.
Joint detection and estimation, application to MIMO radar (Sept. 2010), Department of Electrical En-gineering, Bilkent University, Ankara, Turkey.
Optimum GLR tests (Jan. 2009), Probability & Statistics seminar, Department of Mathematics, Univer-sity of Southern California (USC), Los Angeles, CA, USA.
Finite sample size optimality of GLR tests (Sept. 2008), Electrical Engineering department, Columbia University, New York, NY, USA.
Finite sample size optimality of GLR tests (Aug. 2008), Statistics seminar, School of Industrial and Systems Engineering, Georgia Institute of Technology (GA Tech), Atlanta, GA, USA.
Asynchronous random sampling for decentralized detection (Feb. 2008), Applied Math seminar, De-partment of Mathematics, University of Southern California (USC), Los Angeles, CA, USA.
Change time models and performance criteria for the problem of change detection (Feb. 2008), Prob-ability & Statistics seminar, Department of Mathematics, University of Southern California (USC), Los Angeles, CA, USA.
Decentralized sequential hypothesis testing and change detection (Jan. 2008), Laboratoire de Modéli-sation et de Sûreté de Systèmes, Université de Technologie de Troyes, Troyes, France.
Sequential techniques for hypothesis testing and change detection (Oct. 2007), School of Electrical Engineering, The Royal Institute of Technology (KTH), Stockholm, Sweden.
George V. Moustakides: Curriculum Vitae
8
Sequential detection of changes, mini-course of nine lectures, (May-June 2007), Department of Sta-tistics, Columbia University, New York, NY, USA.
The Poisson disorder problem (Feb. 2006), Department of Operations Research and Financial Engi-neering, Princeton University, Princeton, NJ, USA.
Performance evaluation of CUSUM tests (March 2003), Department of Statistics, Columbia University, New York, NY, USA.
Optimum CUSUM tests for detecting changes in continuous time processes (March 2003), 11-th An-nual Applied Probability Day, The Center for Applied Probability, Columbia University, New York, NY, USA (only six speakers are invited to this annual event).
Optimum sequential procedures for detecting changes in processes (Dec. 2002), Université du Maine, Faculté des Sciences, Laboratoire de Statistique et Processus, Le Mans, France.
Adaptive algorithms for blind separation of dependent sources (Jan. 2002), Department of Mathemat-ics, Université Joseph Fourier - Grenoble I, Grenoble, France.
Optimum adaptive algorithms for blind source separation (April 2001), Institut d'informatique, Univer-sité de Neuchâtel, Neuchâtel, Switzerland.
Decision directed algorithms for multiuser detection (Nov. 2000), Institut de Recherche en Infor-matique et en Automatique (INRIA - IRISA), Rennes, France.
Adaptive algorithms for blind source separation (July 2000), Signal Processing Lab., Department of Electrical Engineering, University of Pennsylvania (UPENN), Philadelphia, PA, USA.
Optimum adaptive signal processing algorithms (June 1999), Laboratoire de Modélisation et de Sûreté de Systèmes, Université de Technologie de Troyes, Troyes, France.
New developments in sequential analysis (March 1998), Department of Statistics, Hebrew University of Jerusalem, Jerusalem, Israel.
List of Publications Books/Book Chapters [B2] G.V. Moustakides, Basic Techniques in Digital Signal Processing (in Greek), Editions Tziola, Greece, Oct.
2003. [B1] G.V. Moustakides Constrained adaptive linear multiuser detection schemes, chapter in the book: Signal
Processing for Wireless Communications Systems, H.V. Poor and L. Tong (eds), Springer, March 2002, (same as [J34]).
Journals [J52] G. Fellouris and G.V. Moustakides, Decentralized sequential hypothesis testing using asynchronous com-
munication, IEEE Transactions on Information Theory. (accepted for publication, to appear). [J51] G.V. Moustakides, A.S. Polunchenko and A.G. Tartakovsky, A numerical approach to performance analysis
of quickest change-point detection procedures, Statistica Sinica, vol. 21, no. 2, April 2011. [J50] G.V. Moustakides and A.G. Tartakovsky, A note on "The optimal stopping time for detecting changes in
discrete time Markov processes" by Han and Tsung, Sequential Analysis, vol. 29, no. 4, pp. 483-486, Oct. 2010.
[J49] A.G. Tartakovsky and G.V. Moustakides, State-of-the-art in Bayesian changepoint detection, Sequential Analysis, special issue on changepoint detection in honor of Dr. Shiryaev's 75th birthday, vol. 29, no. 2, pp. 125-145, April 2010.
[J48] A. Tajer, G.H. Jajamovich, X. Wang and G.V. Moustakides, Optimal joint target detection and parameter estimation by MIMO radar, IEEE Journal of Selected Topics in Signal Processing, vol. 4, no. 1, pp. 127-145, Feb. 2010.
[J47] G.V. Moustakides and V.S. Verykios, Optimal stopping: a record-linkage approach, ACM Journal of Data and Information Quality, special issue on Data Quality in Databases, vol. 1, no. 2, pp. 9:1-9:34, Sept. 2009.
[J46] G.V. Moustakides, A.S. Polunchenko and A.G. Tartakovsky, Numerical comparison of CUSUM and Shiryayev-Roberts procedures, Communications in Statistics, Theory and Methods, special issue on: Re-cent advances in theory and applications of Statistics, vol. 38, no. 16 & 17, pp. 3225-3239, 2009.
George V. Moustakides: Curriculum Vitae
9
[J45] S. Radosavac, G.V. Moustakides, J.S. Baras and J. Koutsopoulos, An analytic framework for modeling and detecting access layer misbehavior in wireless networks, ACM Transactions on Information and System Security, vol. 11, no. 4, pp. 19:1-19:28, July 2008.
[J44] G.V. Moustakides and V.S. Verykios, A max-min approach for hiding frequent itemsets, Data and Knowl-edge Engineering Journal, Elsevier, invited paper, special issue on Data Hiding, vol. 65, no. 1, pp. 75-89, April 2008.
[J43] X. Doukopoulos and G.V. Moustakides, Fast and stable subspace tracking, IEEE Transactions on Signal Processing, vol. 56, no. 4, pp. 1452-1465, April 2008.
[J42] G.V. Moustakides, Sequential change detection revisited, Annals of Statistics, vol. 36, no. 2, pp. 787-807, April 2008.
[J41] S. Radosavac, A. Cardenas, J.S. Baras, G.V. Moustakides, Detecting IEEE 802.11 MAC layer misbehavior in ad hoc networks: Robust strategies against individual and colluding attackers, Journal of Computer Secu-rity, special issue on Security of Ad Hoc and Sensor Networks, vol. 15, no. 1, pp. 103-128, Jan. 2007.
[J40] X. Doukopoulos and G.V. Moustakides, Blind adaptive channel estimation in OFDM systems, IEEE Transac-tions on Wireless Communications, vol. 5, no. 7, pp. 1716-1725, July 2006.
[J39] O. Hadjiliadis and G.V. Moustakides, Optimal and asymptotically optimal CUSUM rules for change point detection in the Brownian Motion model with multiple alternatives, Teoriya Veroyatnostei i ee Prime-neniya, vol. 50, no. 1, pp. 131-144, 2005 (Russian edition) also in SIAM Theory of Probability and its Ap-plications, vol. 50, no. 1, pp. 75-85, Jan. 2006 (English edition).
[J38] X.G. Doukopoulos and G.V. Moustakides, Adaptive power techniques for blind channel estimation in CDMA systems, IEEE Transactions on Signal Processing, vol. 53, no. 3, pp. 1110-1120, March 2005.
[J37] G.V. Moustakides, Optimality of the CUSUM procedure in continuous time, Annals of Statistics, vol. 32, no. 1, pp. 302-315, Feb. 2004.
[J36] V.S. Verykios, G.V. Moustakides and M.G. Elfeky, A Baysian decision model for cost optimal record match-ing, The Very Large Data Bases Journal, vol. 12, no. 1, pp. 28-40, May 2003.
[J35] E.Z. Psarakis and G.V. Moustakides, A robust initialization scheme for the Remez exchange algorithm, IEEE Signal Processing Letters, vol. 10, no. 1, pp. 1-3, Jan. 2003.
[J34] G.V. Moustakides, Constrained adaptive linear multiuser detection schemes, invited paper, special issue on multiuser detection, Journal of VLSI Signal Processing, vol. 30, no 1-3, pp. 293-309, Jan.-March 2002.
[J33] G.V. Moustakides, H.V. Poor, On the relative error probabilities of linear multiuser detectors, correspon-dence, IEEE Transactions on Information Theory, vol. 47, no. 1, pp. 450-456, Jan. 2001.
[J32] G.V. Moustakides, D. Briassoulis, E.Z. Psarakis, E. Dimas, 3D image acquisition and NURBS based geome-try modeling of natural objects, Advances in Engineering Software, vol. 31, no. 12, pp. 955-969, Dec. 2000.
[J31] G.V. Moustakides, Extension of Wald's first lemma to Markov processes, Journal of Applied Probability, vol. 36, no. 1, pp. 48-59, March 1999.
[J30] G.V. Moustakides, Locally optimum adaptive signal processing algorithms, IEEE Transactions on Signal Processing, vol. SP-46, no. 12, pp. 3315-3325, Dec. 1998.
[J29] G.V. Moustakides, Exponential convergence of products of random matrices, application to adaptive algo-rithms, International Journal of Adaptive Control and Signal Processing, vol. 12, no. 7, pp. 579-597, Nov. 1998.
[J28] G.V. Moustakides, Quickest detection of abrupt changes for a class of random processes, Correspondence in the IEEE Transactions on Information Theory, vol. IT-44, no. 5, pp. 1965-1968, Sept. 1998.
[J27] A. Liavas, G.V. Moustakides, E.Z. Psarakis, G. Henning, P. Husar, A new method for detecting visual evoked potentials, IEEE Transactions on Biomedical Engineering, vol. BE-45, no. 2, pp. 242-248, Feb. 1998.
[J26] G.V. Moustakides, Study of the transient phase of the constant forgetting factor RLS, IEEE Transactions on Signal Processing, vol. SP-45, no. 10, pp. 2468-2476, Oct. 1997.
[J25] E.Z. Psarakis, G.V. Moustakides, An L2 based method for the design of one dimensional zero phase FIR digital filters, IEEE Transactions on Circuits and Systems-I, vol. CASI-44, no. 7, pp. 591-601, July 1997.
[J24] P.P. Mavridis, G.V. Moustakides, Simplified Newton type adaptive estimation algorithms, IEEE Transac-tions on Signal Processing, vol. SP-44, no. 8, pp. 1932-1940, Aug. 1996.
[J23] G.V. Moustakides, E.Z. Psarakis, Design of N-dimensional hyperquadrantally symmetric FIR filters using the McClellan transform, Transaction Brief in IEEE Transactions on Circuits and Systems-II, vol. CASII-42, no. 8, pp. 547-550, Aug. 1995.
George V. Moustakides: Curriculum Vitae
10
[J22] S. Theodoridis, G.V. Moustakides, K. Berberidis, A fast Newton multichannel algorithm for decision feed-back equalization, Correspondence in IEEE Transactions on Signal Processing, vol. SP-43, no. 1, pp. 327-331, Jan. 1995.
[J21] G.V. Moustakides, K. Berberidis, New efficient LS and SVD based techniques for high resolution frequency estimation, IEEE Transactions on Signal Processing, vol. SP-43, no. 1, pp. 85-94, Jan. 1995.
[J20] E.Z. Psarakis, G.V. Moustakides, Design of two dimensional zero phase FIR filters via the generalized McClellan transform, IEEE Transactions on Circuits and Systems, vol. CAS-38, no. 11, pp. 1355-1363, Nov. 1991.
[J19] G.V. Moustakides, S. Theodoridis, Fast Newton transversal filters, a new class of adaptive estimation algo-rithms, IEEE Transactions on Acoustic, Speech and Signal Processing, vol. ASSP-39, no. 10, pp. 2184-2193, Oct. 1991.
[J18] G.V. Moustakides, Correcting the instability due to finite precision of the fast Kalman identification algo-rithms, Signal Processing, vol. 18, no. 1, pp. 33-42, Sept. 1989.
[J17] J-L. Botto, G.V. Moustakides, Stabilizing the fast Kalman algorithms, IEEE Transactions on Acoustic, Speech and Signal Processing, vol. ASSP-37, no. 9, pp. 1342-1348, Sept. 1989.
[J16] A. Rougée, A. Benveniste, M. Basseville, G.V. Moustakides, Optimum robust detection of changes in the AR part of multivariate ARMA process, Correspondence in the IEEE Transactions on Automatic Control, vol. AC-32, no. 12, pp. 1116-1120, Dec. 1987.
[J15] M. Basseville, A. Benveniste, G.V. Moustakides, A. Rougée, Optimal sensor location for detecting changes in dynamical behavior, IEEE Transactions on Automatic Control, vol. AC-32, no. 12, pp. 1067-1075, Dec. 1987.
[J14] M. Basseville, A. Benveniste, G.V. Moustakides, A.Rougée, Detection and diagnosis of changes in the ei-genstructure of nonstationary multivariable systems, Automatica, vol. 23, no. 4, pp. 479-489, July 1987.
[J13] A. Benveniste, M. Basseville, G.V. Moustakides, The asymptotic local approach for change detection and model validation, IEEE Transactions on Automatic Control, vol. AC-32, no. 7, pp. 583-592, July 1987.
[J12] G.V. Moustakides, J.B. Thomas, Robust detection of signals in dependent noise, IEEE Transactions on Information Theory, vol. IT-33, no. 1, pp. 11-15, Jan. 1987.
[J11] G.V. Moustakides, Optimal stopping times for detecting changes in distributions, Annals of Statistics, vol. 14, no. 4, pp. 1379-1387, Dec. 1986.
[J10] M. Basseville, A. Benveniste, G.V. Moustakides, Detection and diagnosis of abrupt changes in modal char-acteristics of nonstationary digital signals, Correspondence in the IEEE Transactions on Information The-ory, vol. IT-32, no. 3, pp. 412-417, May 1986.
[J9] G.V. Moustakides, J.B. Thomas, Optimum detection of weak signals with minimal knowledge of depend-ency, IEEE Transactions on Information Theory, vol. IT-32, no. 1, pp. 97-102, Jan. 1986.
[J8] G.V. Moustakides, A. Benveniste, Detecting changes in the AR parameters of a nonstationary ARMA proc-ess, Stochastics, vol. 16, pp. 137-155, 1986.
[J7] G.V. Moustakides, Robust detection of signals: a large deviations approach, IEEE Transactions on Infor-mation Theory, vol. IT-31, no. 6, pp. 822- 825, Nov. 1985.
[J6] G.V. Moustakides, S.A. Kassam, Min-max equalization for random signals, IEEE Transactions on Communications, vol. COM-33, no. 8, pp. 820-825, Aug. 1985.
[J5] M. Basseville, A. Benveniste, G.V Moustakides, The local method applied to the robust detection of changes in the poles of a pole-zero system, Lecture Notes in Control and Information Sciences, vol. LNCIS-77, pp. 259-274, Springer, Berlin, 1985. (Book chapter).
[J4] G.V. Moustakides, J.B. Thomas, Min-max detection of weak signals in ϕ-mixing noise, IEEE Transactions on Information Theory, vol. IT-30, no. 3, pp. 529-537, May 1984.
[J3] G.V. Moustakides, S.A. Kassam, Robust Wiener filters for random signals in correlated noise, Correspon-dence in the IEEE Transactions on Information Theory, vol. IT-29, no. 4, pp. 614-619, July 1983.
[J2] S.A. Kassam, G.V. Moustakides, J. Shin, Robust detection of known signals in asymmetric noise, IEEE Transactions on Information Theory, vol. IT-28, no. 1, pp. 84-91, Jan. 1982.
[J1] G.V. Moustakides, S.D. Bedrosian, Finding the graph with the maximum number of spanning trees, Jour-nal of the Franklin Institute, vol. 310, no. 6, pp. 343-348, Dec. 1980.
Conferences/Workshops [C55] G. Fellouris, G.V. Moustakides and Y. Mei, Epidemic detection using CUSUM, Proceedings of the 5th Inter-
national Workshop on Applied Probability, IWAP'2010, Madrid, Spain, July 2010. [C54] A. Tajer, G.H. Jajamovich, X. Wang and G.V. Moustakides, Finite-sample optimal joint target detection and
parameter estimation by MIMO radars, Proceedings of the 2009 Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, USA, Nov. 2009.
George V. Moustakides: Curriculum Vitae
11
[C53] A. Tajer, G. H. Jajamovich, X. Wang, and G. V. Moustakides, "Optimal target detection with unknown pa-rameters by MIMO radar", Proceedings of the 2009 IEEE Military Communications Conference, MILCOM'2009, Boston, MA, USA, Oct. 2009.
[C52] G. Fellouris and G.V. Moustakides, Decentralized sequential hypothesis testing, Joint Statistical Meeting, JSM'2009, Washington DC, USA, Aug. 2009.
[C51] G.V. Moustakides, Change-time models and performance measures for sequential change detection, Pro-ceedings of the 2nd International Workshop on Sequential Methodologies, IWSM'2009, Troyes, France, 2009.
[C50] G. Fellouris and G.V. Moustakides, Decentralized sequential hypothesis testing in discrete time, Proceed-ings of the 2nd International Workshop on Sequential Methodologies, IWSM'2009, Troyes, France, 2009.
[C49] A.G. Tartakovsky, A.S. Polunchenko and G.V. Moustakides, Design and comparison of Shiryaev-Roberts and CUSUM-type change-point detection procedures, Proceedings of the 2nd International Workshop on Sequential Methodologies, IWSM'2009, Troyes, France, 2009.
[C48] G. Fellouris and G.V. Moustakides, Asymptotically optimum tests for decentralized change detection, Pro-ceedings 4th International Workshop on Applied Probability, IWAP'2008, Compiègne, France, July 2008.
[C47] G. Fellouris and G.V. Moustakides, Asymptotically optimum tests for decentralized sequential testing in continuous time, Proceedings 11th IEEE International Conference on Information Fusion, Fusion'2008, Co-logne, Germany, June-July 2008.
[C46] A.A. Cardenas, G.V. Moustakides and J.S. Baras, On the optimality of spread spectrum watermarking against Gaussian attacks, Proceedings IEEE International Conference on Image Processing, ICIP'2007, vol. IV, pp. 449-452, San Antonio, Texas, US, Sept. 2007.
[C45] G.V. Moustakides, Detecting changes that occur at observable random times, invited paper, 1st Interna-tional Workshop in Sequential Methodologies, IWSM'2007, Auburn, Alabama, US, July 2007.
[C44] A.A. Cardenas, G.V. Moustakides and J.S. Baras, Towards optimal design of data hiding algorithms against nonparametric adversary models, Proceedings 41st Conference on Information Sciences and Systems, CISS'2007, pp. 911-916, Baltimore, March 2007.
[C43] G.V. Moustakides and V. Verykios, A max-min approach for hiding frequent itemsets, Proceedings 6th International Conference on Data Mining Workshops, ICDM'2006, Workshop on Privacy Aspects of Data Mining, PADM'2006, pp. 502-506, Hong Kong, Dec. 2006.
[C42] M. Rabi, G.V. Moustakides and J.S. Baras, Multiple sampling for estimation on a finite horizon, Proceed-ings 45th IEEE Conference on Decision and Control, CDC'2006, San Diego, USA, Dec. 2006.
[C41] S. Radosavac, G.V. Moustakides, J.S. Baras, Impact of the optimal MAC layer attacks on the network layer, Proceedings 4th ACM Workshop on Security of Ad Hoc and Sensor Networks, SASN'2006, pp. 135-145, Alexandria, VA, USA, Oct. 2006.
[C40] G.V. Moustakides, Decentralized CUSUM change detection, Proceedings 9th IEEE International Conference on Information Fusion, Fusion'2006, Florence, Italy, July 2006.
[C39] M. Rabi, J.S. Baras and G.V. Moustakides, Efficient sampling for keeping track of an Ornstein-Uhlenbeck process, Proceedings 14th Mediterranean Conference on Control and Automation, Ancona, Italy, June 2006.
[C38] X. Doukopoulos and G.V. Moustakides, The fast data projection method for stable subspace tracking, Pro-ceedings 13th European Signal Processing Conference, EUSIPCO'2005, Antalya, Turkey, Sept. 2005.
[C37] O. Hadjiliadis and G.V. Moustakides, Optimal and asymptotically optimal CUSUM rules for changepoint detection in the Brownian Motion model with multiple alternatives, Proceedings Joint Statistical Meeting, JSM'2004, Quality Control section, Toronto, Canada, Aug. 2004.
[C36] X. Doukopoulos and G.V. Moustakides, Adaptive algorithms for blind channel estimation in OFDM systems, Proceedings IEEE International Conference on Communications, ICC'2004, vol. 4, pp. 2377-2381, Paris, June 2004.
[C35] V.S. Verykios and G.V. Moustakides, A generalized cost optimal decision model for record matching, Pro-ceedings Workshop on Information Quality in Information Systems, IQIS'2004, pp. 20-26, Paris, June 2004.
[C34] X. Doukopoulos and G.V. Moustakides, Power techniques for blind adaptive channel estimation in CDMA systems, Proceedings IEEE Global Communications Conference, GLOBECOM'2003, vol. 4, pp. 2330-2334, San Francisco, Dec. 2003.
[C33] X. Doukopoulos and G.V. Moustakides, Blind channel estimation for downlink CDMA systems, Proceedings IEEE International Conference on Communications, ICC'2003, vol. 4, pp. 2416-2420, Alaska, May 2003.
[C32] L. Noirié, F. Cerou, G.V. Moustakides, O. Audouin and P. Peloso, New transparent optical monitoring of the eye and BER using asynchronous under-sampling of the signal, Proceedings 28th European Confer-ence on Optical Communications, ECOC'2002, vol. 5, pp. 1-2, Copenhagen, Denmark, Sept. 2002.
George V. Moustakides: Curriculum Vitae
12
[C31] G.V. Moustakides, F. Cerou, O. Audouin and L Noirié, Eye diagram reconstruction using asynchronous imperfect sampling, application to BER estimation for fiber-optic communication systems, Proceedings 11th European Signal Processing Conference, EUSIPCO'2002, vol. III, pp. 375-378, Toulouse, France, Sept. 2002.
[C30] E. Psarakis and G.V. Moustakides, Closed form expressions for optimum FIR polynomial predictive filter-ing, Proceedings 11th European Signal Processing Conference, EUSIPCO'2002, vol. II, pp. 195-198, Tou-louse, France, Sept. 2002.
[C29] G.V. Moustakides, Performance of CUSUM tests for detecting changes in continuous time processes, Pro-ceedings IEEE International Symposium on Information Theory, IEEE ISIT'2002, pp. 186, Laussane, Swit-zerland, July 2002.
[C28] G.V. Moustakides, Optimum adaptive blind source separation algorithms, Proceedings IEEE International Conference on Acoustic Speech and Signal Processing, IEEE ICASSP'2002, vol. 2, pp. 1645-1648, Orlando, Florida, USA, May 2002.
[C27] G.V. Moustakides, Decision directed algorithms for multiuser detection, Proceedings IEEE International Symposium on Information Theory, IEEE ISIT'2001, pp. 8, Washington DC, USA, June 2001.
[C26] S.A. Kassam, Y. Zhang, G.V. Moustakides, Some results on a BSS algorithm under non-standard condi-tions, Proceedings 33rd Annual Conference on Information Sciences & Systems, pp. 385-390, Johns Hop-kins University, Baltimore, Maryland, March 1999.
[C25] G.V. Moustakides, H.V. Poor, On the relative error probabilities of linear multiuser detectors, Proceedings 36th Annual Allerton Conference on Communications Control and Computing, pp. 421-430, Sept. 1998.
[C24] G.V. Moustakides, Exponential convergence of adaptive algorithms, Proceedings IEEE International Sym-posium on Information Theory, ISIT'98, pp. 262, MIT, Boston, USA, Aug. 1998.
[C23] E. Dimas, E. Psarakis, D. Briassoulis, G.V. Moustakides, Three-dimensional acquisition and NURBS-based geometric modeling of natural objects, Proceedings 4th International Conference on Computational Struc-tures Technology, CST'98, Edinburgh, Aug. 1998, in Advances in Engineering Computational Technology, pp. 301-310, (ed B.H.V. Topping), Civil-Comp Press.
[C22] E.Z. Psarakis, G.V. Moustakides, Acceleration of the Remez exchange algorithm for the design of L∞ opti-mum FIR filters, Proceedings 13th International Conference on Digital Signal Processing, Santorini, vol. 2, pp. 1063-1066, Greece, July 1997.
[C21] E.Z. Psarakis, G.V. Moustakides, An L2 based method for the design of one dimensional FIR digital filters, Proceedings 3rd IEEE International Conference on Electronics, Circuits and Systems ICECS'1996, vol. 1, pp. 267-270, Rhodos, Greece, Oct. 1996.
[C20] G.V. Moustakides, Performance of the forgetting factor RLS during the transient phase, Proceedings IEEE Digital Signal Processing Workshop, pp. 370-373, Loen, Norway, Sept. 1996.
[C19] A. Liavas, G.V. Moustakides, E.Z. Psarakis, G. Henning, P. Husar, On the detection of steady state visually evoked potentials, Proceedings 18th Annual International Conference of the IEEE Engineering in Medicine and Biology, vol. 3, pp. 946-947, Netherlands, Sept. 1996.
[C18] S. Theodoridis, G.V. Moustakides, K. Berberidis, A fast adaptive algorithm for multichannel system identi-fication: application to DFE, Proceedings 7th European Signal Processing Conference, EUSIPCO'1994, pp. 728-731, Edimbourg, England, Sept. 1994.
[C17] G.V. Moustakides, Efficacy of adaptive signal processing algorithms, Proceedings IEEE International Sym-posium on Information Theory, IEEE ISIT'1994, pp. 125, June 1994.
[C16] G. Iwanowa, G. Henning, W. Müller, G.V. Moustakides, Automatic detection of visual evoked potentials - an urgent necessity for objective perimetric investigations, Proceedings 15th Annual International Confer-ence of the IEEE Engineering in Medicine and Biology, pp. 1387-1388, San Diego, Oct. 1993.
[C15] P.P. Mavridis, G.V. Moustakides, Analysis of discrete time server queues with bursty Markovian inputs, Proceedings International Conference on Advances in Communications and Control, Rhodes, Greece, June 1993.
[C14] G.V. Moustakides, K. Berberidis, New LS and SVD based methods for estimation of frequencies of complex sinusoids, Proceedings IEEE International Symposium on Circuits and Systems, ISCAS'1993, vol. 1, pp. 451-454, Chicago, Illinois, May 1993.
[C13] A. Brikou, G.V. Moustakides, A. Bezerianos, P. Papathanasopoulos, Adaptive identification of visual evoked potentials, application to multiparametric stimulation, Proceedings MEDICON'1992 Conference, vol. I, pp. 129-132, Capri, Italy, July 1992.
[C12] S. Theodoridis and G.V. Moustakides, A novel class of fast adaptive algorithms for multichannel filtering, Proceedings 5th European Signal Processing Conference, EUSIPCO'1990, Barcelona, Spain, Sept. 1990.
George V. Moustakides: Curriculum Vitae
13
[C11] A.P. Varvitsiotis, S. Theodoridis, G.V. Moustakides, A novel structure for adaptive LS FIR filtering based on QR decomposition, Proceedings International Conference on Acoustics, Speech and Signal Processing, ICASSP'1989, vol. 2, pp. 904-907, May 1989.
[C10] Benveniste, M. Basseville, G.V. Moustakides, Modeling and monitoring of changes in dynamical systems, Proceedings IEEE Conference on Decision and Control, IEEE CDC'1986, vol. 2, pp.776-782, Athens, Greece, Dec. 1986.
[C9] M. Basseville, A. Benveniste, G.V. Moustakides, A. Rougée, Optimal sensor location for detecting changes in dynamical behavior, Proceedings IEEE Conference on Decision and Control, IEEE CDC'1986, vol. 2, pp. 1058-1063, Athens, Greece, Dec. 1986.
[C8] M. Basseville, A. Benveniste, G.V. Moustakides, A. Rougée, Detection and diagnosis of changes in the eigenstructure of nonstationary multivariable systems, Proceedings 2nd IFAC Workshop on Adaptive Sys-tems in Control and Signal Processing, pp.7-12, Lund, Sweden, July 1986.
[C7] M. Basseville, A. Benveniste, G.V. Moustakides, A.Rougée, Detection of abrupt changes in the modal characteristics of nonstationary vector signals, Proceedings 7th International Symposium on the Mathe-matical Theory of Networks and Systems, pp. 537-547, Stockholm, Sweden, June 1985.
[C6] M. Basseville, A. Benveniste, G.V. Moustakides, A. Rougée, Detection and diagnosis of changes in the vibrating characteristics of a structure subject to nonstationary unknown excitation, Proceedings IEEE Symposium on Information Theory, ISIT'1985, Brighton, UK, June 1985.
[C5] M. Basseville, A. Benveniste, G.V. Moustakides, A. Rougée, Detection and diagnosis of changes in the AR part of an ARMA model with nonstationary unknown MA coefficients, Proceedings 4th Vilnius Conference on Probability theory and mathematical statistics, pp. 119-122, Vilnius, Lithuania, June 1985.
[C4] G.V. Moustakides, J.B. Thomas, Min-max detection of weak signals in stationary Markov processes, Pro-ceedings 20th Annual Allerton Conference on Communications Control and Computing, pp. 713-722, Mon-ticello, IL, Oct. 1982.
[C3] G.V. Moustakides, S.A. Kassam, Minimax robust equalization for random signals through uncertain chan-nels, Proceedings 20th Annual Allerton Conference on Communications Control and Computing, pp. 945-954, Monticello, IL, Oct. 1982.
[C2] S.A. Kassam, G.V. Moustakides and J.G. Shin, Robust detection of known signals in asymmetric noise, Proceedings 18th Annual Allerton Conference on Communications Control and Computing, Monticello, IL, Oct. 1980.
[C1] G.V. Moustakides, S.A. Kassam, Robust Wiener filters for correlated signal and noise, Proceedings Prince-ton Conference on Information Sciences and Systems, pp. 308-313, March 1980.
Discussion Papers [D1] A.G. Tartakovsky and G.V. Moustakides, Discussion on "Quickest Detection Problems: Fifty Years Later" by
Albert N. Shiryaev, Sequential Analysis, Sequential Analysis, vol. 29, no. 4, Oct. 2010.
Submitted for Publication [S1] M. Rabi, G.V. Moustakides and J.S. Baras, Adaptive sampling for linear state estimation, submitted to the
SIAM Journal on Control and Optimization. (April 2009, 2nd review).
Working Papers [W4] G.V. Moustakides, Adaptive blind source separation revisited, to be submitted to the IEEE Transactions on
Signal Processing. [W3] G.V. Moustakides, A. Tajer, G.H. Jajamovich X. Wang, Joint detection and estimation, application to MIMO
radar, to be submitted to the IEEE Transactions on Signal Processing. [W2] G. Fellouris and G.V. Moustakides, Decentralized sequential change detection using asynchronous com-
munication, to be submitted to the IEEE Transactions on Information Theory. [W1] G.V. Moustakides, Sequential rate-change detection in homogeneous Poisson processes, to be submitted
to the Annals of Statistics.
Editorials [E1] K. Berberidis, B. Champagne, G.V. Moustakides, H.V. Poor, P. Stoica, (Guest editors), Special Issue on:
Advances in subspace-based techniques for Signal Processing and Communications, EURASIP Journal on Applied Signal Processing, vol. 2007.
Patents [P1] INRIA: A. Benveniste, F. Cerou, G.V. Moustakides; ALCATEL: O. Audouin, M. Manzanedo, L. Noire, D.
Penninckx, Optical transmission system error rate measurement method and apparatus for carrying out this method, sponsored by Alcatel, France. European Publication Number: EP1311078, May 2003. Also: Method for measuring the error rate of an optical transmission system and apparatus for implementing the method. United States Patent Number: 6,744,496 B2, June 2004.
Curriculum Vitae of Yasutada Oohama
Name: Yasutada OohamaAddress: Department of Information Science and Intelligent Systems
University of Tokushima2-1 Minami Josanjima-Cho, Tokushima, 770-8506, Japan
Tel: +81-88-656-9446Fax: +81-88-624-0725Email: [email protected] of Birth: March 7, 1963
Education:Mar. 1987 B. Eng. degrees in Mathematical Engineering University of Tokyo, JapanMar. 1989 M. Eng. degrees in Mathematical Engineering University of Tokyo, JapanMar. 1992 D. Eng. degrees in Mathematical Engineering University of Tokyo, Japan
Experience:
April 1992 - Feb. 1995 Research Associate, Department of Computer Science andCommunication Engineering, Kyushu University, Japan
Mar. 1995 - Sept. 2006 Associate Professor, Department of Computer Science andCommunication Engineering, Kyushu University, Japan
Sept. 1996 - Mar. 1997 Visiting Scholar at the Information Systems Laboratory, Stan-ford University, Stanford CA
Oct. 2006 - Professor, Department of Information Science and IntelligentSystems, University of Tokushima, Japan
General Research Interests:
1. Basic Problems in Information Theory and Related Areas
• Shannon Theory
• Multi-user Information Theory
2. Nonlinear Theory and its Application to Information Science
• Random Number Generation
• Statistical Properties of Chaos Dynamical Systems
List of Publications
Journal Papers Published or Accepted for Publication
1. Yasutada Oohama, “Multiterminal Source Coding with Linked Encoders(in Japanese),” IEICE Trans-actions, Vol. J 75-A, No. 7, pp. 1193-1200, July 1992.
2. Yasutada Oohama, “On Multiterminial Zero Error Data Transmission with Linked Encoders(in Japanese),” IEICE Transactions, Vol. J 75-A, No. 7, pp. 1201-1206, July 1992.
3. Yasutada Oohama and Te Sun Han, “Universal Coding for the Slepian-Wolf Data Compression Systemand the Strong Converse Theorem,” IEEE Transactions on Information Theory, Vol. 40, No. 6, pp.1908-1919, Nov. 1994.
4. Yasutada Oohama, “Universal Coding for Correlated Sources with Linked Encoders,” IEEE Transac-tions on Information Theory, Vol. 42, No. 3, pp. 837-847, May 1996.
5. Yasutada Oohama, “Gaussian Multiterminal Source Coding,” IEEE Transactions on Information The-ory, Vol. 43, No. 6, pp. 1912-1923, Nov. 1997.
6. Yasutada Oohama, “The Rate-Distortion Function for the Quadratic Gaussian CEO Problem,” IEEETransactions on Information Theory, Vol. 44, No. 3, pp. 1057-1070, May 1998.
7. Yasutada Oohama and Tohru Kohda, “Statistical Properties of Chaotic Binary Sequences Generatedby One-dimensional Maps,” IEICE Transactions on Fundamentals, Vol. E 85-A, No. 9, pp. 1993-2002,Sept. 2002.
8. Yasutada Oohama, Mariko Suemitsu and Tohru Kohda, “Construction of a Piecewise Linear One-dimensional Map Generating an Arbitrary Prescribed Tree Source,” IEICE Transactions on Funda-mentals, Vol. E 86-A, No. 9, pp. 2251-2255, Sept. 2003.
9. Yasutada Oohama and Tohru Kohda, “Large Deviation for Chaotic Binary Sequences Generated byNonlinear Maps and Threshold Functions,” IEICE Transactions on Fundamentals, Vol. E 87-A, No.10, pp. 2555-2563, Oct. 2004.
10. Yasutada Oohama, “Rate-Distortion Theory for Gaussian Multiterminal Source Coding Systems withSeveral Side Informataions at the Decoder,” IEEE Transactions on Information Theory Vol. 51, No.7, pp. 2577-2593, July 2005.
11. Ken-ichi Iwata and Yasutada Oohama, “Information-Spectrum Characterization of Broadcast Channelwith General Source,” IEICE Transactions on Fundamentals, Vol. E 88-A, No. 10, pp. 2808-2818,Oct. 2005.
12. Ken-ichi Iwata and Yasutada Oohama,“Information-Spectrum Characterization of Multiple-AccessChannels with Correlated Sources,” IEICE Transactions on Fundamentals, Vol. E 88-A, pp. 3196-3201, No. 11, Nov. 2005.
13. Yasutada Oohama,“Intrinsic Randomness Problem in the Framework of Slepian-Wolf Separate CodingSystem,” IEICE Transactions on Fundamentals, Vol. E 90-A, pp.1406-1417, No.7, July 2007.
14. Yasutada Oohama,“Gaussian Zig-Zag Source Coding Problem,” IEICE Transactions on Fundamentals,Vol. E 93-A, No. 11, pp. 1889-1903, Nov. 2010.
15. Shun Watanabe and Yasutada Oohama, “Secret Key Agreement from Correlated Gaussian Sources byRate Limited Public Communication,” IEICE Transactions on Fundamentals, Vol. E 93-A, No. 11,pp. 1976-1983, Nov. 2010.
16. Yasutada Oohama, “Performance Analysis of the Interval Algorithm for Random Number GenerationBased on Number Systems,” IEEE Transactions on Information Theory, accepted.
Journal Papers under Review
1. Yasutada Oohama, “Converse Coding Theorems for Identification via Channels,” IEEE Transactionson Information Theory, submitted, June 2006.
2. Yasutada Oohama, “Distributed Source Coding of Correlated Gaussian Remote Sources,” IEEE Trans-actions on Information Theory, submitted, Sept. 2009.
3. Yasutada Oohama and Shun Watanabe, “Relay Channels with Confidential Messages,” IEEE Trans-actions on Information Theory, submitted, Jan. 2010.
4. Shun Watanabe and Yasutada Oohama, “Secret Key Agreement from Vector Gaussian Sources by RateLimited Public Communication,” IEEE Transactions on Information Forensics & Security, submitted,Sept. 2010.
Conference Papers
1. Te Sun Han and Yasutada Oohama, “Universal Coding for the Slepian-Wolf Data Compression and theStrong Converse Theorem,” Proceedings of the Fourth Joint Soviet-Swedish International Workshopon Information Theory, Gotland Sweden, pp. 359-364, Aug. 27 - Sept. 1, 1989.
2. Te Sun Han, Shun-ich Amari and Yasutada Oohama, “Multiterminal Zero-Rate Hypothesis Testing andEstimation and the Optimalities,” Proceedings of the 1990 International Symposium on InformationTheory and Its Applications, Hawai, USA, pp. 207-210, Nov. 27-30, 1990.
3. Yasutada Oohama and Tohru Kohda, “An Evaluation of Statistical Properties of Pseudo-RandomNumbers Generated by One-Dimensional Maps,” Proceedings of the 1993 International Symposiumon Nonlinear Theory and its Applications, pp. 971-974, Hawaii, USA, Dec. 5-10, 1993.
4. Yasutada Oohama, “Gaussian Multiterminal Source Coding,” Proceedings of the 1995 IEEE Interna-tional Symposium on Information Theory, Whistler, Canada, p. 261, Sept. 17-22, 1995.
5. Yasutada Oohama, “Korner-Marton’s Zig-zag Problem for Correlated Memoryless Gaussian Sources,”Proceedings of the 1997 IEEE International Symposium on Information Theory, Ulm, Germany, p.269, June 29-July 4, 1997.
6. Yasutada Oohama, Mariko Suemitsu and Tohru Kohda, ”Construction of a Nonlinear Map Gener-ating an Arbitrarily Prescribed Tree Source”, Proceedings of the 1998 International Symposium onNonlinear, Crans-Montana, Switzerland, pp. 615-618, Sept. 14-17, 1998.
7. Yasutada Oohama, “Multiterminal Source Coding for Correlated Memoryless Gaussian Sources withSeveral Side Informations at the Decoder,” Proceedings of the 1999 IEEE ITW, Kruger National Park,South Africa, p. 100, June 20-25, 1999.
8. Yasutada Oohama, “Random Number Approximation Problem for Discrete Memoryless Sources,”Proceedings of the 2000 IEEE International Symposium on Information Theory, Sorrento, Italy, p.455, June 25-30, 2000.
9. Yasutada Oohama, “Coding for Relay Channels with Confidential Messages,” Proceedings of the 2001IEEE Information Theory Workshop, Cairns, Australia, pp. 87-89, Sept. 2-7, 2001.
10. Yasutada Oohama, “Error Probability of Identification via Channels at Rates above Capacity,” Pro-ceedings of the 2002 IEEE International Symposium on Information Theory, Lausanne, Switzerland,p. 26, June 30-July 5, 2002.
11. Yasutada Oohama, “Average Error Probability of Identification via Channels at Rates above Identi-fication Capacity,” Proceedings of the 2002 International Symposium on Information Theory and ItsApplications, Xi’an, PRC, pp. 859-862, Oct. 7-11, 2002.
12. Yasutada Oohama, “Converse Coding Theorem for the Identification via Multiple Access Channels,”Proceedings of the 2002 IEEE Information Theory Workshop, Bangalore, India, pp. 155-158, Oct.20-25, 2002.
13. Yasutada Oohama, ”Converse Coding Theorem for the Identification via General Multiple AccessChannels,” Proceedings of the Third Asian-European Workshop on Information Theory , Kamogawa,Japan, pp. 39-42, June 25-27, 2003.
14. Yasutada Oohama, “Converse Coding Theorem for Identification via General Degraded BroadcastChannels,” Proceedings of the 2003 IEEE International Symposium on Information Theory, Yoko-hama, Japan, p. 226, June 29-July 4, 2003.
15. Yasutada Oohama, “Rate-Distortion Region for Doubly Symmetric Binary Sources with PartiallySeparated Encoders,” Proceedings of the 2004 International Symposium on Information Theory andIts Applications, Palma, Italy, pp. 266-268, Oct. 10-13, 2004.
16. Ken-ichi Iwata and Yasutada Oohama, “Information-Spectrum Characterization of Broadcast Chan-nels with General Sources,” Proceedings of the 2004 International Symposium on Information Theoryand Its Applications, Palma, Italy, pp. 1574-1579, Oct. 10-13, 2004.
17. Yasutada Oohama, “Separate Source Coding of Correlated Gaussian Remote Observations,” Proceed-ings of the 2005 Hawaii, IEICE and SITA Joint Conference on Information Theory, pp. 131-134, May2005.
18. Yasutada Oohama, “Explicit Expression of the Interval Algorithm for Random Number GenerationBased on Number Systems,” Proceedings of the 2005 IEEE Information Theory Workshop, Rotorua,New Zealand, pp. 157-161, Aug. 29-Sept. 1, 2005.
19. Yasutada Oohama, “Multiterminal Random Number Generation in the Framework of Separate CodingSystems,” Proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide,Australia, pp. 478-481, Sept. 4-9, 2005.
20. Yasutada Oohama, “Rate Distortion Region for Separate Coding of Correlated Gaussian RemoteObservations,” Proceedings of the 43rd Allerton Conference, Allerton, IL, pp. 2237-2246, Sept. 28-30,2005.
21. Yasutada Oohama, “Separate Source Coding of Correlated Gaussian Remote Sources,” Proceedingsof Information Theory & Applications Inaugural Workshop, UCSD, CA, Feb. 6-10, 2006.
22. Yasutada Oohama, “Gaussian Multiterminal Source Coding with Several Side Informations at theDecoder,” Proceedings of the 2006 IEEE International Symposium on Information Theory, Seattle,USA, pp. 1409–1413, July 9-14, 2006.
23. Ken-ichi Iwata and Yasutada Oohama, “Information-Spectrum Characterization of a Multi-terminalChannel with General Correlated Sources,” Proceedings of the International Symposium on Informa-tion Theory and Its Applications, Seoul, Korea, pp. 177–182, Oct. 29-Nov. 1, 2006.
24. Yasutada Oohama, “Source Coding of Correlated Gaussian Vector Sources with Several Side Infor-mations at the Decoder,” Proceedings of the International Symposium on Information Theory and ItsApplications, Seoul, Korea, pp. 183–188, Oct. 29-Nov. 1, 2006.
25. Yasutada Oohama, “Capacity Theorems for Relay Channels with Confidential Messages,” Proceedingsof the 2007 IEEE International Symposium on Information Theory, pp. 926–930, Nice, France, June24-29, 2007.
26. Yasutada Oohama, “Rate Distortion Region for Distributed Source Coding of Correlated GaussianRemote Sources,” Proceedings of the 2008 IEEE International Symposium on Information Theory,Toronto, pp. 41–45, Canada, July 6-11, 2008.
27. Yasutada Oohama, “Distributed Source Coding of Correlated Gaussian Observations,” Proceedingsof the 2008 International Symposium on Information Theory and its Applications, Auckland, NewZealand, pp. 1441–1446, Dec. 7-10, 2008.
28. Yasutada Oohama, “Distributed Source Coding System for Correlated Gaussian Observations,” Pro-ceedings of the IEEE Information Theory Workshop, Taormina, Sicily, pp.193–197, Oct. 11-16, 2009.
29. Yasutada Oohama, “Sum Rate Characterization for the Gaussian Many-Help-One Problem,” Proceed-ings of the IEEE Information Theory Workshop, Taormina, Sicily, pp.323–327, Oct. 11-16, 2009.
30. Yasutada Oohama, “Distributed Source Coding of Correlated Memoryless Gaussian Observations,”Proceedings of the 2010 IEEE International Symposium on Information Theory, Austin, USA, pp. 51–55, June 13-18, 2010.
31. Shun Watanabe and Yasutada Oohama, “Secret Key Agreement from Vector Gaussian Sources byRate Limited Public Communication,” Proceedings of the 2010 IEEE International Symposium onInformation Theory, pp. 2597–2601, Austin, USA, June 13-18, 2010.
32. Yasutada Oohama, “On the Rate Distortion Region of Gaussian Multiterminal Source Coding,” Pro-ceedings of the International Symposium on Information Theory and Its Applications, Taichung, Tai-wan, pp. 714–719, Oct. 17-20, 2010.
Invited Conference Paper
1. Yasutada Oohama, “Multiterminal Source Coding Problem with Several Side Informations at theDecoder,” Proceedings of the 2008 IEEE International Symposium on Information Theory, pp.687–691, Toronto, Canada, July 6-11, 2008.
Technical Reports
1. Yasutada Oohama, “Some Generalization of the Gaussian CEO Problem,” Technical Report of IEICE,IT2001-43, pp. 1-6, Nov. 2001.
2. Yasutada Oohama and Tohru Kohda, “Random Number Generation and Dynamical Systems – Statis-tical Properties of Binary Sequences Generated by One-dimensional Maps –,” Research Institute forMathematical Sciences Kokyuroku 1240, Kyoto University, pp. 204-215, Dec. 2001.
3. Yasutada Oohama, “Error Probability of Identification via Multiple Access Channels at Rates outsidethe Capacity Region,” Technical Report of IEICE, IT2002-40, pp. 1-6, Jan. 2003.
4. Yasutada Oohama, “The Capacity Region for Identification via General Degraded Broadcast Chan-nels,” Technical Report of IEICE, IT2002-41, pp. 7-12, Jan. 2003.