PUBLICATIONS

Selected Publications

  • “Memory-Efficient Decoder Architectures for Quasi-Cyclic LDPC Codes,” Y. Dai, Z. Yan, and N. Chen, IEEE Transactions on Circuits and Systems–I:regular papers, Vol. 55, No. 9, pp. 2898-2911, October 2008.
  • “Packing and Covering Properties of Rank Metric Codes,” M. Gadouleau and Z. Yan, IEEE Transactions on Information Theory, Vol. 54, No. 9, pp. 3873-3883, September 2008.
  • “Optimal Overlapped Message Passing Decoding of Quasi-Cyclic LDPC Codes,” Y. Dai, N. Chen, and Z. Yan, IEEE Transactions on VLSI Systems, Vol. 16, No. 5, pp. 564-578, May 2008.

Back to top

Refereed Journal Publications

  • “Composite Cyclotomic Fourier Transforms with Reduced Additive Complexity,” X. Wu, M. Wagh, N. Chen, Y. Wang, and Z. Yan, IEEE Transactions on Signal Processing, accepted and to appear, available on IEEExplore, DOI: 10.1109/TSP.2011.2106778
  •  “Rank Metric Decoder Architectures for Random Linear Network Coding with Error Control,” N. Chen, Z. Yan, M.Gadouleau, Y. Wang, and B. Suter, IEEE Transactions on VLSI Systems, accepted and to appear, available on IEEExplore, DOI: DOI: 10.1109/TVLSI.2010.2096239
  • “Efficient Ordering Schemes for High-Throughput MIMO Detectors,” X. Wu, Y. Dai, Y. Wang, and Z. Yan, Journal of Signal Processing Systems, accepted and to appear, available online, DOI: 10.1007/s11265-010-0486-5
  • “Efficient CAC CODEC Design Based on Numeral Systems,” X. Wu and Z. Yan, IEEE Transactions on VLSI Systems, accepted and to appear, available on IEEE Explore, DOI: 10.1109/TVLSI.2009.2038389
  • “Constant-Rank Codes and Their Connection to Constant-Dimension Codes,” M. Gadouleau and Z. Yan, IEEE Transactions on Information Theory, Vol. 56, No. 7, pp. 3207-3216, July 2010.
  • “Packing and Covering Properties of Subspace Codes for Error Control in Random Linear Network Coding,” M. Gadouleau and Z. Yan, IEEE Transactions on Information Theory, Vol. 56, No. 5, pp. 2097-2108, May 2010.
  • “Memory-Constrained Tree Search Detection and Novel Order Schemes,” Y. Dai and Z. Yan, IEEE Journal of Selected Topics in Signal Processing: Special Issue on Managing Complexity in Multiuser MIMO Systems, Vol. 3, No. 6, pp. 1026-2037, December 2009.
  • “Bounds on Covering Codes with the Rank Metric,” M. Gadouleau and Z. Yan, IEEE Communications Letters, Vol. 13, No. 9, pp. 691-693, September 2009.
  • “Reduced-Complexity Reed-Solomon Decoders Based on Cyclotomic FFTs,” N. Chen and Z. Yan, IEEE Signal Processing Letters, Vol. 16, No. 4, pp. 279-282, April 2009.
  • “Memory-Efficient and High-Throughput Decoding of Quasi-Cyclic LDPC Codes,” Y. Dai, Z. Yan, and N. Chen, IEEE Transactions on Communications, Vol. 57, No. 4, pp. 879-883, April 2009.
  • “Cyclotomic FFTs with Reduced Additive Complexities Based on a Novel Common Subexpression Elimination Algorithm,” N. Chen and Z. Yan, IEEE Transactions on Signal Processing, Vol. 57, No. 3, pp. 1010-1020, March 2009.
  • “Packing and Covering Properties of Rank Metric Codes,” M. Gadouleau and Z. Yan, IEEE Transactions on Information Theory, Vol. 54, No. 9, pp. 3873-3883, September 2008.
  • “Complexity Analysis of RS decoding over GF(2^m) Without Using Syndromes” N. Chen and Z. Yan, EURASIP Journal on Wireless Communications, Special Issue on Advances in Error Control Coding Techniques, Volume 2008, Article ID 843634.
  • “MacWilliams Identity for Rank Metric Codes,” M. Gadouleau and Z. Yan, EURASIP Journal on Wireless Communications, Special Issue on Advances in Error Control Coding Techniques, Volume 2008, Article ID 754021.
  • “Memory-Efficient Decoder Architectures for Quasi-Cyclic LDPC Codes,” Y. Dai, Z. Yan, and N. Chen, IEEE Transactions on Circuits and Systems–I:regular papers, Vol. 55, No. 9, pp. 2898-2911, October 2008.
  • “On the Decoder Error Probability of Bounded Rank-Distance Decoder for Maximum Rank Distance Codes,” M. Gadouleau and Z. Yan, IEEE Transactions on Information Theory, Vol. 54, No. 7, pp. 3202-3206, July 2008.
  • “Optimal Overlapped Message Passing Decoding of Quasi-Cyclic LDPC Codes,” Y. Dai, N. Chen, and Z. Yan, IEEE Transactions on VLSI Systems, Vol. 16, No. 5, pp. 564-578, May 2008.
  • “Fading-Resilient Multidimensional Space-Time Constellations,” D. Mihai Ionescu and Z. Yan, IEEE Transactions on Information Theory, Vol. 53, No. 9, pp. 3219-3225, September 2007.
  • “Hardware-Efficient Systolic Architectures for Inversion in GF(2m),” Z. Yan, D. V. Sarwate, and Z. Liu, IEE Proceedings on Information Security, Vol. 152, No. 1, pp. 31-45, October 2005.
  • “High-Speed Systolic Architectures for Finite Field Inversion,” Z. Yan, D. V. Sarwate, and Z. Liu, Integration: the VLSI Journal, Vol. 38, No. 3, pp. 383-398, January 2005. “Errata to ‘High-Speed Systolic Architectures for Finite Field Inversion’,” Z. Yan, D. V. Sarwate, and Z. Liu, Integration: the VLSI Journal, Vol. 39, No. 4, pp. 474-476, July 2006.
  • “Geometrical Uniformity of a Class of Space-Time Codes,” Z. Yan and D. Mihai Ionescu, IEEE Transactions on Information Theory, Vol. 50, No. 11, pp. 3343-3347, December 2004.
  • “New Systolic Architectures for Inversion and Division in GF(2m),” Z. Yan and D. V. Sarwate, IEEE Transactions on Computers, Vol. 52, No. 11, pp. 1515-1520, November 2003.
  • “Improved 8- and 16-state Space-Time Codes for 4PSK with Two Transmit Antennas,” D. M. Ionescu, K. K. Mukkavilli, Z. Yan, and J. Lillberg, IEEE Communications Letters, Vol. 5, No. 7, pp. 301-303, July 2001.

Back to top

Refereed Conference Publications

  • “Prime Factor Cyclotomic Fourier Transforms with Reduced Complexity over Finite Fields,” X. Wu, Z. Yan, N. Chen, and M. Wagh, Proceedings of SiPS 2010, pp. 450-455, October 2010.

  • “List Based Soft-Decision MIMO Detection by the MCTS Algorithm,” X. Wu, Y. Dai, and Z. Yan, Proceedings of ISCAS 2010, pp. 3537-3540, May 2010.

  • “Improving the Reliability of the K-Best Algorithm for MIMO Detection with Ordering,” X. Wu, Y. Dai, and Z. Yan, Proceedings of WOCC 2010, pp. 138-142, May 2010.

  • “On the Decoder Error Probability of Bounded Rank Distance Decoder for Rank Metric Codes,” M. Gadouleau and Z. Yan, Proceedings of IEEE ITW 2009, pp. 485-489, October 2009.

  • “Rank Metric Decoder Architectures for Noncoherent Error Control in Random Network Coding,” N. Chen, M. Gadouleau and Z. Yan, Proceedings of SiPS 2009, pp. 127-132, October 2009.

  • “CAC CODEC Designs Based on Numeral Systems,” X. Wu and Z. Yan, Proceedings of SiPS 2009, pp. 191-196, October 2009.

  • “Decoder Error Probability of Bounded Distance Decoder for Constant-Dimension Codes,” M. Gadouleau and Z. Yan, Proceedings of IEEE ISIT 2009, pp. 2226-2230, July 2009.

  • “Construction and Covering Properties of Constant-Dimension Codes,” M. Gadouleau and Z. Yan, Proceedings of IEEE ISIT 2009, pp. 2221-2225, July 2009.

  • “Packing and Covering Properties of Subspace Codes,” M. Gadouleau and Z. Yan, Proceedings of IEEE ISIT 2009, pp. 2867-2871, July 2009.

  • “Modified Euclidean Algorithms for Decoding Reed-Solomon Codes,” D. Sarwate and Z. Yan, Proceedings of IEEE ISIT 2009, pp. 1398-1402, July 2009.

  • “High-Performance Designs of AES Transformations,” N. Chen and Z. Yan, Proceedings of ISCAS 2009, pp. 2906-2909, May 2009.

  • “Efficient Ordering Schemes for Sphere Decoder,” Y. Dai and Z. Yan, Proceedings of SiPS 2008, pp. 146-151, October 2008.

  • “Two-Dimensional Crosstalk Avoidance Codes,” X. Wu, Z. Yan, and Y. Xie, Proceedings of SiPS 2008, pp. 106-111, October 2008.

  • “Constant-Rank Codes and Their Connection to Constant-Dimension Codes,” M. Gadouleau and Z. Yan, Proceedings of WiNC 2008, pp. 1-6, June 2008.

  • “Constant-Rank Codes,” M. Gadouleau and Z. Yan, Proceedings of 2008 ISIT, pp. 876-880, July 2008.

  • “Compact Designs of MixColumns and SubBytes Using a Novel Common Subexpression Elimination Algorithm,” N. Chen and Z. Yan, Proceedings of ISCAS 2008, pp. 1584-1587, May 2008.

  • “A Low-Complexity Soft Detector for Coded MIMO-OFDM Systems,” Y. Dai and Z. Yan, Proceedings of ISCAS 2008, pp. 312-315, May 2008.

  • “Memory-Constrained ML-Optimal Tree Search Detection,” Y. Dai and Z. Yan, Proceedings of CISS 2008, pp. 1037-1041, March 2008.

  • “Complexity of Decoding Gabidulin Codes,” M. Gadouleau and Z. Yan, Proceedings of CISS 2008, pp. 1081-1085, March 2008.

  • “Erasure Codes for Broadcasting Small Files over Erasure Channels with Low Bandwidth,” X. Wu, H. Wang, and Z. Yan, Proceedings of CISS 2008, pp. 556-561, March 2008.

  • “Covering Properties of Rank Metric Codes,” M. Gadouleau and Z. Yan, Proceedings of Globecom 2007, pp. 1446-1450, November 2007.

  • “Complexity Analysis of the Gao Algorithm,” N. Chen and Z. Yan, Proceedings of 2007 IEEE Workshop on Signal Processing Systems (SiPS’07), pp. 243-248, October 2007.

  • “Reduced-Complexity Cyclotomic FFT and Its Application to Reed-Solomon Decoding,” N. Chen and Z. Yan, Proceedings of 2007 IEEE Workshop on Signal Processing Systems (SiPS’07), pp. 657-662, October 2007.

  • “MacWilliams Identity for the Rank Metric,” M. Gadouleau and Z. Yan, Proceedings of 2007 ISIT, pp. 36-40, July 2007.

  • “Digit-Serial Systolic Architecture for Inversions over GF(2^m),” Z. Yan, Proceedings IEEE SiPS 2006, pp. 77-82, October 2006.

  • “Partly-Parallel Overlapped Sum-Product Decoder Architectures for Quasi-Cyclic LDPC Codes,” N. Chen, Y. Dai, and Z. Yan, Proceedings IEEE SiPS 2006, pp. 226-231, October 2006.

  • “Reduced-Complexity Pipelined Architectures for Finite Field Inversions,” Z. Yan and D. Sarwate, Proceedings IEEE SiPS 2006, pp. 56-61, October 2006.

  • “Decoder Error Probability of MRD codes for Criss-cross Errors,” M. Gadouleau and Z. Yan, Proceedings of IEEE ITW-Chengdu, pp. 264-268, October 2006.

  • “Security of the GPT-Type Cryptosystems,” M. Gadouleau and Z. Yan, Proceedings of 2006 Proceedings of ISIT, pp. 724-728, July 2006.

  • “Properties of Codes in the Rank Metric,” M. Gadouleau and Z. Yan, Proceedings of Globecom 2006, pp. 1-5, November 2006.

  • “Parallel Turbo-Sum-Product Decoder Architecture of Quasi-Cyclic LDPC,” Y. Dai, Z. Yan, and N. Chen, Proceedings of GLSVLSI 2006, pp. 762-767, Philadelphia, PA, May 2006.

  • “High-Throughput Turbo-Sum-Product Decoding of QC LDPC,” Y. Dai, Z. Yan, and N. Chen, Proceedings of CISS 2006, pp. 762-767, Princeton, NJ, March 2006.

  • “Optimal Overlapped Message Passing Decoding for Quasi-Cyclic Low-Density Parity-Check Codes,” Y. Dai and Z. Yan, Proceedings of Globecom 2005, St. Louis, MO, November/December, 2005.

  • “Coset-Based Quasi-Cyclic LDPC Codes for Optimal Overlapped Message Passing Decoding,” Y. Dai and Z. Yan, Proceedings of SiPS 2005, pp. 762-767, Athens, Greece, November 2005.

  • “A private-key cryptosystem based on the rank metric,” M. Gadouleau and Z. Yan, Proceedings of Algebraic Methods in Cryptography Workshop, Beijing China, July 2005.

  • “Area-Efficient Systolic Architectures for Inversions over GF(2m),” Z. Yan, D. V. Sarwate, and Z. Liu, Proceedings of 2005 ISCAS, pp. 5838-5841, Kobe Japan, May 2005.

  • “Optimal Distortion Parameter for the GPT Public-Key Cryptosystem,” M. Gadouleau and Z. Yan, Proceedings of 2005 IEEE Sarnoff Symposium, pp. 133-136, Princeton NJ, April 2005.

  • “On Bounding the Coding Gains of Space-Time Coset Codes,” Z. Yan and D. Mihai Ionescu, Proceedings of 2005 IEEE Sarnoff Symposium, pp. 164-167, Princeton NJ, April 2005.

  • “Area-Efficient Two-Dimensional Architectures for Finite Field Inversion and Division,” Z. Yan and D. V. Sarwate, Proceedings of 2005 Great Lakes Symposium on VLSI, pp. 116-121, Chicago IL, April 2005.

  • “Design of Universal Architectures of Reed-Solomon Decoders,” Z. Yan and D. V. Sarwate, Proceedings of 2004 Great Lakes Symposium on VLSI, Boston, MA, pp. 51-56, April 2004.

  • “High-Speed Systolic Architectures for Finite Field Inversion and Division,” Z. Yan and D. V. Sarwate, Proceedings of 2004 Great Lakes Symposium on VLSI, Boston, MA, pp. 462-465, April 2004.

  • “Geometrical Uniformity of A Class of Space-Time Coset Codes,” Z. Yan and D. Mihai Ionescu, Proceedings of 2003 International Symposium on Information Theory, p. 207, Yokohama, Japan, July 2003.

  • “A Class of Coset Space-Time Turbo Codes,” D. M. Ionescu, G. Ganesan, and Z. Yan, Proceedings of SCI 2002, Orlando, Florida, July 2002.

  • “Modified Euclidean Algorithm for Finite Field Inversions,” Z. Yan and D. V. Sarwate, Proceedings of 2002 International Symposium on Information Theory, p. 203, Lausanne, Switzerland, July 2002.

  • “Systolic Architectures for Finite Field Inversion and Division,” Z. Yan and D. V. Sarwate, Proceedings of 2002 International Symposium on Circuits and Systems, vol. 5, pp. 789-792, Scottsdale, Arizona, May 2002.

  • “Modified Euclidean Algorithms for Decoding of Reed-Solomon Codes,” Z. Yan and D. V. Sarwate, Proceedings of the 36th Conference on Information Sciences and Systems, Princeton, New Jersey, March 2002.

  • “Suboptimal Schemes for Noncoherent Parallel Acquisition of Spreading Sequences in DS/SS Systems,” Z. Yan and D. V. Sarwate, Proceedings of 2000 IEEE International Symposium on Information Theory, p. 132, Sorrento, Italy, June 2000.

  • “Simple Schemes for Noncoherent Parallel Acquisition of Spreading Sequences in DS/SS Systems,” Z. Yan and D. V. Sarwate, Proceedings of 33rd Conference on Information Sciences and Systems, Baltimore, Maryland, March 1999.

Back to top