Professor Frank R. Kschischang

Canada Research Chair in Communication Algorithms

Preprints and Publications

These works are organized by topic; organization by year is also available. Some papers appear in more than one category. (Copyright notice.)

Topics:

Network Coding, Factor Graphs, Low-Density Parity-Check Codes, Codes Defined on Graphs and Iterative Decoding, Incremental Redundancy Schemes, Decoder Hardware Implementations, Optical Communication, Wireless Communication, Powerline Communication, Coding Theory, Trellis Structure of Block Codes, Information Theory, Coded Modulation, Communication Networks, Course Notes

Network Coding

Journal Papers

D. Silva, F. R. Kschischang, and R. Koetter, A Rank-Metric Approach to Error Control in Random Network Coding, submitted to IEEE Transactions on Information Theory, November, 2007. (PDF)
R. Koetter and F. R. Kschischang, Coding for Errors and Erasures in Random Network Coding, submitted to IEEE Transactions on Information Theory, March, 2007. (PDF)

Conference Papers

D. Wang, D. Silva and F. R. Kschischang, Constricting the Adversary: A Broadcast Transformation for Network Coding, Proc. 45th Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, Sept. 2007. (PDF)
D. Silva, F. R. Kschischang and R. Koetter, A Rank-Metric Approach to Error Control in Random Network Coding, 2007 IEEE Information Theory Workshop, Bergen, Norway, July 2007.
R. Koetter and F. R. Kschischang, Coding for Errors and Erasures in Random Network Coding, Proc. 2007 IEEE International Symposium on Information Theory, Nice, France, June 2007. (PDF)
D. Silva and F. R. Kschischang, Using Rank-Metric Codes for Error Correction in Random Network Coding, Proc. 2007 IEEE International Symposium on Information Theory, Nice, France, June 2007.
D. Silva and F. R. Kschischang, Rank-Metric Codes for Priority Encoding Transmission with Network Coding, 10th Canadian Workshop on Information Theory, Edmonton, Alberta, pp. 81-84, June 2007.
W.W.Y. Cheung and F. R. Kschischang, Cooperative Content Distribution using Information Droplets, Proc. 23rd Biennial Symposium on Communications, Kingston, Ontario, pp. 149-152, May-June, 2006.

Back to Top

Factor Graphs

Journal Papers

H.-A. Loeliger, J. Dauwels, J. Hu, S. Korl, L. Ping and F. R. Kschischang, The Factor Graph Approach to Model-Based Signal Processing, Proceedings of the IEEE, vol. 95, pp. 1295-1322, June 2007.
Y. Mao and F. R. Kschischang, On Factor Graphs and the Fourier Transform, IEEE Transactions on Information Theory, vol. 51, pp. 1635-1649, May 2005. (PDF)
Y. Mao, F. R. Kschischang, B.-C. Li, and S. Pasupathy, A Factor Graph Approach to Link Loss Monitoring in Wireless Sensor Networks, IEEE Journal of Selected Areas in Communications, vol. 23, pp. 820-829, Apr. 2005. (PDF)
F. R. Kschischang, B. J. Frey and H.-A. Loeliger, Factor Graphs and the Sum-Product Algorithm IEEE Transactions on Information Theory, vol. 47, pp. 498-519, February 2001. (PDF)
A. H. Banihashemi and F. R. Kschischang, Tanner Graphs for Group Block Codes and Lattices: Construction and Complexity, IEEE Transactions on Information Theory, vol. 47, pp. 822-834, February 2001. (PDF)

Conference Papers

J. Hu, J. Dauwels, H.-A. Loeliger and F. R. Kschischang, A General Computation Rule for Lossy Summaries/Messages with Examples from Equalization, Proc. 44th Allerton Conf. on Commun., Control and Computing, Sept. 2006.
Y. Mao and F. R. Kschischang, On the Extrinsic Information and Graph-based APP Decoding for Memoryless Channels, Proc. 22nd Biennial Symposium on Communications, Kingston, Ontario, May, 2004.
Y. Mao and F. R. Kschischang, Codes on Graphs: State-Syndrome Realizations, Proc. 2003 Canadian Workshop on Information Theory, Waterloo, Ontario, Canada, May 2003.
Y. Mao and F. R. Kschischang, Duality in Factor Graphs, Proc. 40th Annual Allerton Conf. on Commun., Control, and Computing, Monticello, IL, USA, Oct. 2002.
Y. Mao and F. R. Kschischang, Convolutional Factor Graphs and Applications, Proc. 21st Biennial Symp. on Commun., Kingston, Ontario, Canada, June 2002.
Y. Mao and F. R. Kschischang, On Factor Graphs and the Fourier Transform, Proc. 2001 IEEE Int. Symp. in Information Theory, Washington, DC, USA, June 2001.
F. R. Kschischang, Factor Graphs, IMA Workshop on Codes, Graphical Models, and Iterative Decoding, Minneapolis, MN, Aug. 1999.
A. Banihashemi, and F. R. Kschischang, Abelian Group Block Code and Lattice Tanner Graphs, Proc. 6th Canadian Workshop on Information Theory, Kingston, Ontario, pp. 36-39, June 1999.
F. R. Kschischang, Factor Graphs and the Sum-Product Algorithm, Mathematical Theory of Networks and Systems, MTNS'98, Padova, Italy, July 6-10, 1998.
F. R. Kschischang, Codes, Factor Graphs and Iterative Decoding, Proc. Winter 1998 IEEE Inform. Theory Workshop, San Diego, CA, pp. 3-4, Feb. 8-11, 1998.
A. H. Banihashemi, F. R. Kschischang, and P. G. Gulak, On Tanner Graphs of Lattices and Codes, Proc. 1998 Int. Symp. on Inform. Theory, p. 115, Aug., 1998.
F. R. Kschischang, Factor Graph Representations of Codes and Probability Distributions, Proc. 19th Bienn. Symp. Commun., Kingston, pp. 243-247, June, 1998.
B. J. Frey, F. R. Kschischang, H. A. Loeliger, and N. Wiberg, Factor Graphs and Algorithms, Proc. 35th Annual Allerton Conf. on Commun., Control and Computing, Monticello, IL, pp. 666-680, Sept. 29-Oct. 1, 1997.

Back to Top

Low-Density Parity-Check Codes

Journal Papers

B. Smith, M. Ardakani, W. Yu and F. R. Kschischang, Design of Low-Density Parity-Check Codes with Optimized Complexity-Rate Tradeoff, submitted to IEEE Transactions on Information Theory, Feb. 2007. (PDF)
A. W. Eckford, F. R. Kschischang and S. Pasupathy, A Partial Ordering of General Finite-State Markov Channels under LDPC Decoding, IEEE Transactions on Information Theory, vol. 53, pp. 2072-2087, June 2007. (PDF)
A. W. Eckford, F. R. Kschischang and S. Pasupathy, On Designing Good LDPC Codes for Markov Channels, IEEE Transactions on Information Theory, vol. 53, pp. 5-21, Jan. 2007. (PDF)
A. W. Eckford, F. R. Kschischang and S. Pasupathy, Analysis of Low-density Parity-check Codes for the Gilbert-Elliott Channel, IEEE Trans. on Information Theory, vol. 51, pp. 3872-3889, Nov. 2005. (PDF)
M. Ardakani and F. R. Kschischang, Properties of Optimum Binary Message-passing Decoders, IEEE Transactions on Information Theory, vol. 51, pp. 3658-3665, Oct. 2005. (PDF)
M. Ardakani, T. H. Chan and F. R. Kschischang, EXIT-chart Properties of the Highest-rate LDPC Code with Desired Convergence Behavior, IEEE Commun. Letters, vol. 9, pp. 52-54, Jan. 2005. (PDF)
M. Ardakani and F. R. Kschischang, A More Accurate One-dimensional Analysis and Design of Irregular LDPC Codes, IEEE Transactions on Communications, vol. 52, pp. 2106-2114, December, 2004. (PDF)
V. Sorokine, F. R. Kschischang, and S. Pasupathy, Gallager Codes for CDMA Applications I: Generalizations, Constructions and Performance Bounds, IEEE Transactions on Communications, vol. 48, pp. 1660-1668, October 2000. (PDF)
V. Sorokine, F. R. Kschischang, and S. Pasupathy, Gallager Codes for CDMA Applications II: Implementations, Complexity and System Capacity, IEEE Transactions on Communications, vol. 48, pp. 1818-1828, Nov. 2000. (PDF)

Book Chapter

F. R. Kschischang and M. Ardakani, Designing Patterns for Easy Recognition: Information Transmission with Low-Density Parity-Check Codes, in New Directions in Statistical Signal Processing (S. Haykin, et al., eds), MIT Press, 2005.

Conference Papers

B. Smith, F. R. Kschischang, and W. Yu, Low-Density Parity-Check Codes for Discretized Min-Sum Decoding, Proc. 23rd Biennial Symposium on Communications, Kingston, Ontario, pp. 14-17, May-June, 2006.
W. Yu, M. Ardakani, B. Smith and F. R. Kschischang, Complexity-Optimized Low-Density Parity-Check Codes, Proc. 43rd Annual Allerton Conf. on Commun., Control and Computing, Monticello, IL, October 2005.
W. Yu, M. Ardakani, B. Smith and F. R. Kschischang, Complexity-Optimized Low-Density Parity-Check Codes for Gallager Decoding Algorithm B, Proc. IEEE Int. Symposium on Information Theory, Sept. 2005.
G.-C. Zhu, W. Yu and F. R. Kschischang, Finite Geometry Low-Density Parity-Check Codes for Channels with Stuck-at Defects, Proc. 2005 Canadian Workshop on Information Theory, June 2005.
M. Ardakani, F. R. Kschischang and W. Yu, Low-density Parity-check Coding for Impulse Noise Correction on Power-line Channels, Proc. 2005 Int. Symp. on Power Line Communications and its Applns, pp. 90-94, April 2005.
A. W. Eckford, F. R. Kschischang and S. Pasupathy, Designing Good LDPC Codes for Markov-Modulated Channels, Proc. 2004 IEEE Int. Symp. on Inform. Theory, Chicago, IL, June, 2004.
A. W. Eckford and F. R. Kschischang, Low-Density Parity-Check Codes for the Gilbert-Elliott Channel, Proc. 41st Annual Allerton Conf. on Commun., Control and Computing, Monticello, IL, October 2003.
M. Ardakani, T. H. Chan, and F. R. Kschischang, Properties of EXIT Charts for One-dimensional LDPC Decoding Schemes, Proc. 2003 Canadian Workshop on Information Theory, Waterloo, Ontario, Canada, May 2003.
A. W. Eckford, F. R. Kschischang, and S. Pasupathy, Designing Very Good Low-Density Parity-Check Codes for the Gilbert-Elliott Channel, Proc. 2003 Canadian Workshop on Information Theory, Waterloo, Ontario, Canada, May 2003.
A. W. Eckford, F. R. Kschischang, and S. Pasupathy, Characterizing the Gilbert-Elliott Parameter Space under LDPC Decoding, Proc. 40th Annual Allerton Conf. on Commun., Control, and Computing, Monticello, IL, USA, Oct. 2002.
A. W. Eckford, F. R. Kschischang, and S. Pasupathy, Analysis of LDPC Codes in Channels with Memory, Proc. 21st Biennial Symp. on Commun., Kingston, Ontario, Canada, June 2002.
J. Castura and F. R. Kschischang, Performance-Complexity Considerations for Practical LDPC Decoding, Proc. 20th Biennial Symp. Commun.,, Kingston, Ontario, Canada, May 28-31, 2000.
A. M. Chan and F. R. Kschischang, A Simple Taboo-Based Soft-Decision Decoding Algorithm for Expander Codes, IEEE Commun. Letters, vol. 2, pp. 183-185, July 1998. (PDF)
V. Sorokine, F. R. Kschischang, and S. Pasupathy, Gallager Codes for CDMA Applications: Generalizations, Constructions and Performance, Proc. Summer 1998 IEEE Inform. Theory Workshop, Killarney, Ireland, pp. 8-9, June, 1998.
V. Sorokine, F. R. Kschischang, and S. Pasupathy, Innovative Coding Scheme for Spread-Spectrum Communications, Proc. IEEE Int. Symp. on Personal, Indoor and Mobile Radio Comm., Boston, MA, Sept 8-11, 1998.
V. Sorokine, F. R. Kschischang, and S. Pasupathy, Applications of Gallager Codes in Wireless CDMA, Proc. 5th Canadian Workshop on Inform. Theory, Toronto, Ontario, pp. 17-20, June 1997.

Back to Top

Codes Defined on Graphs and Iterative Decoding

Journal Papers

M. Ardakani and F. R. Kschischang, Gear-shift Decoding, IEEE Transactions on Communications, vol. 54, pp. 1235-1242, July 2006. (PDF)
F. R. Kschischang, Codes Defined on Graphs, IEEE Communications Magazine, vol. 41, pp. 118-125, Aug. 2003. (PDF)
B. J. Frey, R. Koetter, G. D. Forney, Jr., F. R. Kschischang, R. J. McEliece, and D. A. Spielman, Introduction to the Special Issue on Codes Graphs and Iterative Algorithms, IEEE Transactions on Information Theory, vol. 47, pp. 493-497, February 2001. (PDF)
G. D. Forney, Jr., F. R. Kschischang, B. Marcus, and S. Tuncel, Iterative Decoding of Tail-Biting Trellises, in Codes, Systems, and Graphical Models (B. Marcus, J. Rosenthal, eds.), IMA Volumes in Mathematics and its Applications, vol. 123, pp. 239-264, Springer Verlag, 2000.
G. D. Forney, Jr., R. Koetter, F. R. Kschischang, and A. Reznik, On the effective weights of pseudocodewords for codes defined on graphs with cycles, in Codes, Systems, and Graphical Models (B. Marcus, J. Rosenthal, eds.), IMA Volumes in Mathematics and its Applications, vol. 123, pp. 101-112, Springer Verlag, 2000.
F. R. Kschischang and B. J. Frey, Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models, IEEE Journal of Selected Areas in Communications, vol. 16, Special Issue on Concatenated Coding Techniques and Iterative Decoding, pp. 219-230, Feb. 1998. (PDF)
B. J. Frey and F. R. Kschischang, Early Detection and Trellis Splicing: Reduced-Complexity Soft Iterative Decoding, IEEE Journal of Selected Areas in Communications vol. 16, Special Issue on Concatenated Coding Techniques and Iterative Decoding, pp. 153-159, Feb. 1998. (PDF)

Conference Papers

M. Ardakani and F. R. Kschischang, Gear-shift Decoding for Algorithms with Varying Complexity, Proc. IEEE Int. Conf. Commun., vol. 1, pp. 500-504, May 2005.
M. Ardakani and F. R. Kschischang, Gear-Shift Decoding, Proc. 21st Biennial Symp. on Commun., Kingston, Ontario, Canada, June 2002.
F. R. Kschischang, S. A. Miri, and S. Foo, Convolutional Codes on Trees and Cayley Graphs, Proc. 39th Annual Allerton Conf. on Commun., Control and Computing, Monticello, IL, USA, October 2001.
S. A. Miri and F. R. Kschischang, Convolutional Codes on Trees and Cayley Graphs, Proc. 7th Canadian Workshop on Inform. Theory, Vancouver, B.C., Canada, pp. 122-125, June 2001.
P. P. Sauvé and F. R. Kschischang, Decoding Turbo Codes by Multibit Probability Propagation, Proc. 19th Bienn. Symp. Commun., Kingston, pp. 89-93, June, 1998.
B. J. Frey and F. R. Kschischang, Alternative Message Passing Schedules for Turbo-Decoding, Proc. IEEE Int. Symp. on Inform. Theory, Ulm, Germany, June 1997.
B. J. Frey and F. R. Kschischang, Probability Propagation and Iterative Decoding, Proc. 34th Annual Allerton Conf. on Commun., Control, and Computing, Monticello, Ill, Oct. 1-4, 1996.
B. J. Frey, F. R. Kschischang, and P. G. Gulak, Speeding up Turbo-decoding by Trellis Splicing, Workshop on Turbo Codes, Lund, Sweden, Aug. 1996.

Back to Top

Incremental Redundancy Schemes

Journal Papers

M. Good and F. R. Kschischang, Incremental Redundancy by Check Splitting, submitted to IEEE Transactions on Communications, March 2007. (PDF)
S. C. Draper, B. J. Frey and F. R. Kschischang, Rateless Coding for Non-Ergodic Channels with Decoder Channel State Information, submitted to IEEE Transactions on Information Theory, 2006. (PDF)

Conference Papers

M. Good and F. R. Kschischang, Incremental Redundancy via Check Splitting, Proc. 23rd Biennial Symposium on Communications, Kingston, Ontario, pp. 55-58, May-June, 2006.
S. C. Draper, B. J. Frey and F. R. Kschischang, Efficient Variable Length Channel Coding for Unknown DMCs, Proc. 2004 IEEE Int. Symp. on Inform. Theory, Chicago, IL, p. 379, June, 2004.
R. Mantha and F. R. Kschischang, A Capacity-Approaching Hybrid ARQ Scheme using Turbo Codes, Proc. Globecom '99, Rio de Janeiro, Brazil, Dec. 1999.
R. Mantha and F. R. Kschischang, Hybrid ARQ Schemes using Turbo Codes and Low Density Parity Check Codes, Proc. 6th Canadian Workshop on Information Theory, Kingston, Ontario, pp. 25-28, June 1999.

Patent

R. Mantha and F. R. Kschischang, Hybrid Automatic Repeat Request System and Method, US Patent No. 7,000,174, issued 14 Feb., 2006.

Back to Top

Decoder Hardware Implementations

Journal Papers

A. Darabiha, A. Chan Carusone and F. R. Kschischang, Power reduction techniques for LDPC decoders, to be submitted to IEEE Journal of Solid State Circuits, Nov. 2007. (PDF)
A. Darabiha, A. Chan Carusone and F. R. Kschischang, Block-Interlaced LDPC Decoders with Reduced Interconnect Complexity, submitted to IEEE Transactions on Circuits and Systems II, Jan. 2007. (PDF)
W. J. Gross, F. R. Kschischang and P. G. Gulak, Architecture and Implementation of an Interpolation Processor for Soft-Decision Reed-Solomon Decoding, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, pp. 309-318, March 2007.
W. J. Gross, F. R. Kschischang, R. Koetter and P. G. Gulak, Applications of Algebraic Soft-Decision Decoding of Reed-Solomon Codes, IEEE Transactions on Communications, vol. 54, pp. 1224-1234, July 2006. (PDF)
W. J. Gross, F. R. Kschischang, R. Koetter, and P. G. Gulak, Towards a VLSI Architecture for Interpolation-based Soft-Decision Reed-Solomon Decoders, Journal of VSLI Signal Processing, vol. 39, pp. 93-111, Jan/Feb., 2005.

Conference Papers

A. Darabiha, A. Chan Carusone and F. R. Kschischang, A 3.3-Gbps Bit-Serial Block-Interlaced Min-Sum LDPC Decoder in 0.13μm CMOS, 2007 IEEE Custom Integrated Circuits Conference, San Jose, CA, Sept. 16-19, 2007. (PDF)
A. Darabiha, A. Chan Carusone and F. R. Kschischang, A bit-serial Approximate Min-Sum LDPC Decoder and FPGA Implementation, Proc. 2006 IEEE Int. Symp. Circuits and Systems, 4 pp., May 2006.
A. Darabiha, A. Chan Carusone and F. R. Kschischang, Multi-Gbit/sec Low Density Parity Check Decoders with Reduced Interconnect Complexity, IEEE Int. Symp. Circuits and Systems, pp. 5194-5197, May 2005.
W. J. Gross, F. R. Kschischang and P. G. Gulak, An FPGA Interpolation Processor for Soft-Decision Reed-Solomon Decoding, Proc. 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'04), Napa, CA, pp. 310-311, April, 2004.
W. J. Gross, F. R. Kschischang, R. Koetter and P. G. Gulak, A VLSI Architecture for Interpolation in Soft-Decision List Decoding of Reed-Solomon Codes, Proc. 2003 IEEE Workshop on Signal Processing Systems, San Diego, CA, USA, October 2003.
W. J. Gross, F. R. Kschischang, R. Koetter, and P. G. Gulak, Simulation Results for Algebraic Soft-Decision Decoding of Reed-Solomon Codes, Proc. 21st Biennial Symp. on Commun.,, Kingston, Ontario, Canada, June 2002.
T. Esmailian, F. R. Kschischang, and P. G. Gulak, A 32-point Multiplier-Free Approximate FFT, Proc. 21st Biennial Symp. on Commun., Kingston, Ontario, Canada, June 2002.
E. Boutillon, J. Castura, and F. R. Kschischang, Decoder-First Code Design, Proc. 2nd International Symposium on Turbo Codes and Applications, Brest, France, pp. 459-462, Sept. 2000.

Back to Top

Optical Communication

Journal Papers

V. Pechenkin and F. R. Kschischang, Pseudolinear Optical System Reach Enhancement via Runlength-Limited Coding, submitted to IEEE Journal of Selected Areas in Communications, Optical Communications and Networking Series, November 2007. (PDF)
V. Pechenkin and F. R. Kschischang, Constrained Coding for Quasi-Linear Optical Data Transmission Systems, IEEE/OSA Journal of Lightwave Technology, vol. 24, pp. 4895-4902, Dec. 2006. (PDF)
S. Hranilovic and F. R. Kschischang, A Pixelated MIMO Wireless Optical Communication System, IEEE Journal of Selected Topics in Quantum Electronics, vol. 12, pp. 859-874, July-Aug. 2006.
V. Pechenkin and F. R. Kschischang, Higher Bit Rates for Dispersion-Managed Soliton Communication Systems via Constrained Coding, IEEE/OSA Journal of Lightwave Techn., vol. 24, pp. 1149-1158, Mar. 2006. (PDF)
T. H. Chan, S. Hranilovic and F. R. Kschischang, Capacity-achieving Probability Measure for Conditionally Gaussian Channels with Bounded Inputs, IEEE Transactions on Information Theory, vol. 51, pp. 2073-2088, Jun. 2005. (PDF)
S. Hranilovic and F. R. Kschischang, Capacity Bounds for Power- and Band-Limited Optical Intensity Channels Corrupted by Gaussian Noise,'' IEEE Transactions on Information Theory, vol. 50, pp. 784-795, May, 2004. (PDF)
S. Hranilovic and F. R. Kschischang, Optical Intensity-Modulated Directed Detection Channels: Signal Space and Lattice Codes, IEEE Transactions on Information Theory, vol. 49, pp. 1385-1399, June 2003. (PDF)

Conference Papers

V. Pechenkin and F. R. Kschischang, Constrained Coding for WDM Systems", Proc. European Conf. Optical Communication, Cannes, France, Sep. 2006, paper Th2.6.4. (PDF)
V. Pechenkin and F. R. Kschischang, Ghost Pulse Suppression in Quasi-Linear Optical Data Transmission Systems via Constrained Coding, Proc. 23rd Biennial Symposium on Communications, Kingston, Ontario, pp. 88-91, May-June, 2006. (PDF)
V. Pechenkin and F. R. Kschischang, Higher Bit Rates for Quasi-Linear Optical Data Transmission Systems via Constrained Coding, Proc. 2006 Optical Fiber Communications Conference, Anaheim, CA, March 2006, Paper JThB7. (PDF)
S. Hranilovic and F. R. Kschischang, Short-range Wireless Optical Communication Using Pixelated Transmitters and Imaging Receivers, Proc. 2004 IEEE Int. Conf. Commun., Paris, France, vol. 2, pp. 891-895, June, 2004.
S. Hranilovic and F. R. Kschischang, Short-range Wireless Optical Communication Using Pixelated Transmitters and Imaging Receivers, Proc. 2004 IEEE Int. Conf. Commun., Paris, France, vol. 2, pp. 891-895, June, 2004.
T. H. Chan and F. R. Kschischang, On the Discreteness of the Capacity-achieving Probability Measure of Signal-Dependent Gaussian Channels, Proc. 22nd Biennial Symposium on Communications, Kingston, Ontario, May, 2004.
V. Pechenkin and F. R. Kschischang, A New Coding Scheme for Runlength-limited Channels, Proc. 22nd Biennial Symposium on Communications, Kingston, Ontario, May, 2004, pp. 130-132. (PDF)
S. Hranilovic and F. R. Kschischang, An Indoor Wireless Optical MIMO Channel Using Pixelated Arrays of Transmitters and Receivers, Proc. 22nd Biennial Symposium on Communications, Kingston, Ontario, May, 2004.
T. H. Chan and F. R. Kschischang, Capacity-Achieving Probability Measure of an Input-Bounded Optical Channel with Signal-Dependent Noise, Proc. 41st Annual Allerton Conf. in Commun., Control and Computing, Monticello, IL, October 2003.
S. Hranilovic and F. R. Kschischang, Signal Constellation Design for Optical-Intensity-Modulated Channels, Proc. 2001 IEEE Int. Symp. in Information Theory, Washington, DC, USA, June 2001.
S. Hranilovic and F. R. Kschischang, A Signal Space Model for Intensity-Modulated Channels, Proc. 20th Biennial Symp. Commun.,, Kingston, Ontario, Canada, May 28-31, 2000.

Back to Top

Wireless Communication

Journal Papers

A. P.-T. Lau and F. R. Kschischang, Feedback Quantization Strategies for Multiuser Diversity, IEEE Transactions on Information Theory, vol. 53, pp. 1386-1400, April 2007. (PDF)
A. Lau and F. R. Kschischang, A Sequential Soft-Decision Decoder for Reed-Solomon Codes Applied to Encoded PSK in Rayleigh Fading Channels, IEEE Transactions on Vehicular Technology, vol. 45, pp. 97-104, Feb. 1996.
M. Sajadieh, F. R. Kschischang, and A. Leon-Garcia, Analysis of a Dual-Rate Transmission Scheme for Gaussian Broadcast Channels, European Transactions on Telecommunications, vol. 11, pp. 161-172, March/April 2000.
M. Sajadieh, F. R. Kschischang, and A. Leon-Garcia, Modulation Assisted Unequal Error Protection over the Fading Channel, IEEE Transactions on Vehicular Technology, vol. 47, pp. 900-908, Aug. 1998.

Conference Papers

K. Su and F. R. Kschischang, Coset-based Lattice Detection for MIMO Systems, Proc. 2007 IEEE International Symposium on Information Theory, Nice, France, June 2007.
S. Sen, S. Pasupathy and F. R. Kschischang, Quantized Feedback Information for the SVD filtered MIMO-based FEC-coded DS-CDMA Multiuser Detection Receiver, Proc. 15th Annual Int. Conf. on Wireless Commun., Calgary, AB, Canada, July 2003.
S. Sen, S. Pasupathy, and F. R. Kschischang, A Precoded Singular Value Decomposition Multiuser Detection Receiver with Quantized Feedback Information for DS-CDMA Systems, Proc. 2003 Canadian Workshop on Information Theory, Waterloo, Ontario, Canada, May 2003.
S. Sen, S. Pasupathy, and F. R. Kschischang, A Coordinated Singular Value Decomposition Approach to Multiuser Detection, Proc. 21st Biennial Symp. on Commun., Kingston, Ontario, Canada, June 2002.
M. Sajadieh, F. R. Kschischang, and A. Leon-Garcia, A Block Memory Model for Correlated Rayleigh Fading Channels, Proc. IEEE International Conference on Communications, ICC '96, Dallas, TX, June 23-27, 1996.
S. Abdulmajeed and F. R. Kschischang, Analysis of QAM Schemes in a CCI-Limited Environment, Proc. 18th Biennial Symposium on Commun., Kingston, June, 1996.
M. Sajadieh, F. R. Kschischang, and A. Leon-Garcia, Throughput Analysis of a Two-Level Transmission Scheme in a Rayleigh Fading Channel, Proc. 18th Biennial Symposium on Commun., Kingston, June, 1996.
M. Sajadieh, F. R. Kschischang, and A. Leon-Garcia, Analysis of Two-Layered Adaptive Transmission Systems, Proc. IEEE Vehicular Technology Conference, VTC '96, Apr. 28-May 1, 1996.
M. Sajadieh, F. R. Kschischang, and A. Leon-Garcia, Layered Transmission of Audio/Video Signals, Proc. SPIE Visual Communications and Image Processing, VCIP '96, Mar. 17-20, 1996.
M. Sajadieh, F. R. Kschischang and A. Leon-Garcia, Modulation Asymmetry / Code Complexity Tradeoff for Unequal Error Protection, 1995 Global Telecommunications Conference (GLOBECOM '95), Singapore, Nov. 13-17, 1995.
M. Sajadieh, F. R. Kschischang, and A. Leon-Garcia, Two Applications of Embedded Transmission, Proc. 3rd Iranian Conference on Electrical Engineering, Tehran, Iran, May 25-28, 1995.
A. Lau and F. R. Kschischang, Soft-Decision Decoding of Reed-Solomon-Encoded PSK in Fading Channels, Proc. 17th Biennial Symp. on Communications, Queen's University at Kingston, May 30-June 1, 1994.
M. Sajadieh, F. R. Kschischang and A. Leon-Garcia, Embedded Transmission in a Fading Environment: A Baseline Analysis, Proc. 17th Biennial Symp. on Communications, Queen's University at Kingston, May 30-June 1, 1994.

Back to Top

Powerline Communication

Journal Papers

M. Ardakani, F. R. Kschischang, and Wei Yu, Near-Capacity Coding for Discrete Multitone Systems with Impulse Noise, EURASIP Journal on Applied Signal Processing, Vol. 2006, Article ID 98738, pp. 1-10, 2006.
M. Ardakani, T. Esmailian and F. R. Kschischang, Near-capacity Coding in Multicarrier Modulation Systems, IEEE Transactions on Communications, vol. 52, pp. 1880-1889, November, 2004. (PDF)
T. Esmailian, F. R. Kschischang, and P. G. Gulak, In-building Power Lines as High-Speed Communication Channels: Channel Characterization and a Test-Channel Ensemble, International Journal of Communication Systems, vol. 16, pp. 381-400, June 2003.

Conference Papers

T. Esmailian, F. R. Kschischang, and P. G. Gulak, An In-building Power-Line Channel Simulator, Proc. 2002 Int. Symp. on Power-Line Commun., and its Applications, Athens, Greece, pp. 31-35, March 2002.
T. Esmailian, F. R. Kschischang, and P. G. Gulak, Radiation of High-Frequency Communication Signals over In-building Power Lines and Channel Capacity Distributions, Proc. 2002 Int. Symp. on Power-Line Commun., and its Applications, Athens, Greece, pp. 31-35, March 2002.
T. Esmailian, P. G. Gulak and F. R. Kschischang, A Discrete Multitone Powerline Communications System, Proc. IEEE Int. Conf. Acoust., Speech, Sign. Proc. (ICASSP), Istanbul, Turkey, June 5-9, 2000.
T. Esmailian, F. R. Kschischang, and P. G. Gulak, Simulation of a Discrete Multitone System over In-building Power Lines, Proc. 20th Biennial Symp. Commun.,, Kingston, Ontario, Canada, May 28-31, 2000.
T. Esmailian, F. R. Kschischang, and P. G. Gulak, Characteristics of In-building Power Lines at High Frequencies and their Channel Capacity, Proc. 4th Int. Symp. on Power-Line Commun. and its Applications, Limerick, Ireland, April 5-7, 2000.

Back to Top

Coding Theory, Trellis Structure of Block Codes

Encyclopedia Article

F. R. Kschischang, Product Codes, in Wiley Encyclopedia of Telecommunications (J. G. Proakis, ed.), 2003.

Journal Articles

V. Sorokine and F. R. Kschischang, A Sequential Decoder for Linear Block Codes with a Variable Bias-Term Metric, IEEE Trans. on Inform. Theory, vol. 44, pp. 410-416, Jan. 1998. (PDF)
F. R. Kschischang, The Trellis Structure of Maximal Fixed-Cost Codes, IEEE Transactions on Information Theory, vol. 42, (special issue on Codes and Complexity), pp. 1828-1838, Nov. 1996. (PDF)
A. Vardy and F. R. Kschischang, Proof of a Conjecture of McEliece Regarding the Expansion Index of the Minimal Trellis, IEEE Transactions on Information Theory, vol. 42, (special issue on Codes and Complexity), pp. 2027-2034, Nov. 1996. (PDF)
G. B. Horn and F. R. Kschischang, On the Intractability of Permuting a Block Code to Minimize Trellis Complexity, IEEE Transactions on Information Theory, vol. 42, (special issue on Codes and Complexity), pp. 2042-2048, Nov. 1996. (PDF)
R. C.-K. Lee and F. R. Kschischang, Non-minimal Trellises for Linear Block Codes, Information Theory and Applications II, Springer-Verlag Lecture Notes in Computer Science, 1996, 19 pages.
F. R. Kschischang and V. Sorokine, On the Trellis Structure of Block Codes, IEEE Transactions on Information Theory, vol. 41, pp. 1924-1937, Nov. 1995. (PDF)
V. Sorokine, F. R. Kschischang, and V. Durand, Trellis-Based Decoding of Binary Linear Block Codes, Lecture Notes in Computer Science, vol. 793, Springer-Verlag, pp. 270-286, 1994.
F. R. Kschischang and S. Pasupathy, Some Ternary and Quaternary Codes and Associated Sphere Packings, IEEE Transactions on Information Theory, vol. 38, no. 2, pp. 227-246, Mar. 1992. (PDF)

Conference Papers

F. R. Kschischang, Block Codes with Biproper Trellises, IEEE Int. Symp. on Information Theory and its Applications (ISITA '96), Victoria, B.C., Sept. 1996, pp. 696-699.
F. R. Kschischang, Rectangular Codes and Biproper Trellises, Proc. 18th Biennial Symposium on Commun., Kingston, June, 1996.
S. Zhang and F. R. Kschischang, Design of Good Linear Block Codes with Fixed State Complexity, Proc. 18th Biennial Symposium on Commun., Kingston, June, 1996.
F. R. Kschischang, The Trellis Structure of Maximal Fixed-Cost Codes, Proceedings of the 1995 IEEE International Symposium on Information Theory, Whistler, B.C., Sept. 17-22, 1995. (Abstract only.)
F. R. Kschischang and R. C.-K. Lee, Applications of Nonminimal Block Code Trellises, Proceedings 1995 Canadian Workshop on Information Theory, Ville du Lac Delage, Quebec, May 28-May 31, 1995, (abstract only).
F. R. Kschischang and G. B. Horn, A Heuristic for Ordering a Linear Block Code to Minimize Trellis State Complexity, Proc. 32nd Annual Allerton Conference on Communication, Control and Computing, pp. 75-84, Sept., 1994.
F. R. Kschischang and V. Sorokine, On the Trellis Structure of Block Codes, Proceeding of the 1994 IEEE International Symposium on Information Theory, Trondheim, Norway, June 1994. (Abstract only.)
F. R. Kschischang, The Combinatorics of Block Code Trellises, Proc. 17th Biennial Symp. on Communications, Queen's University at Kingston, May 30-June 1, 1994.
V. Sorokine and F. R. Kschischang, Trellis-Based Decoding of Binary Linear Block Codes, Proc. 1993 Canadian Workshop on Information Theory, Rockland, Ontario, May 30-June 2, 1993, p. 6. (Abstract only.)
F. R. Kschischang, Constructing Reed-Muller Codes from Reed-Solomon Codes over GF(q), Abstracts of the 1993 IEEE International Symposium on Information Theory, Jan. 17-22, 1993, p. 195. (Abstract only.)
F. R. Kschischang and S. Pasupathy, Some Structural Properties of Linear Block Codes Defined on Abelian Groups, Proc. 1989 Canadian Workshop on Information Theory,Sidney, B.C., May 28 - 31, 1989. (Abstract only.)

Back to Top

Information Theory

Journal Papers

S. C. Draper, B. J. Frey and F. R. Kschischang, Rateless Coding for Non-Ergodic Channels with Decoder Channel State Information, submitted to IEEE Transactions on Information Theory, 2006. (PDF)
A. P.-T. Lau and F. R. Kschischang, Feedback Quantization Strategies for Multiuser Diversity, IEEE Transactions on Information Theory, vol. 53, pp. 1386-1400, April 2007. (PDF)
T. H. Chan, S. Hranilovic and F. R. Kschischang, Capacity-achieving Probability Measure for Conditionally Gaussian Channels with Bounded Inputs, IEEE Transactions on Information Theory, vol. 51, pp. 2073-2088, Jun. 2005. (PDF)
S. Hranilovic and F. R. Kschischang, Capacity Bounds for Power- and Band-Limited Optical Intensity Channels Corrupted by Gaussian Noise,'' IEEE Transactions on Information Theory, vol. 50, pp. 784-795, May, 2004. (PDF)

Conference Papers

S. C. Draper, B. J. Frey and F. R. Kschischang, On Interacting Encoders and Decoders in Multiuser Settings, Proc. 2004 IEEE Int. Symp. on Inform. Theory, Chicago, IL, June, 2004.
T. H. Chan and F. R. Kschischang, On the Discreteness of the Capacity-achieving Probability Measure of Signal-Dependent Gaussian Channels, Proc. 22nd Biennial Symposium on Communications, Kingston, Ontario, May, 2004.
S. C. Draper, B. J. Frey and F. R. Kschischang, Interactive Decoding of a Broadcast Message, Proc. 41st Annual Allerton Conf. in Commun., Control and Computing, Monticello, IL, October 2003.
T. H. Chan and F. R. Kschischang, Capacity-Achieving Probability Measure of an Input-Bounded Optical Channel with Signal-Dependent Noise, Proc. 41st Annual Allerton Conf. in Commun., Control and Computing, Monticello, IL, October 2003.
T. H. Chan, S. Hranilovic and F. R. Kschischang, On the Discreteness of the Capacity-Achieving Measure of an Input-Bounded Vector Gaussian Channel, Proc. 2003 Canadian Workshop on Information Theory, Waterloo, Ontario, Canada, May 2003.
S. Hranilovic and F. R. Kschischang, Capacity Bounds for Power- and Band-Limited Wireless Infrared Channels Corrupted by Gaussian Noise, Proc. 40th Annual Allerton Conf. on Commun., Control, and Computing, Monticello, IL, USA, Oct. 2002.
S. Hranilovic and F. R. Kschischang, Upper and Lower Bounds on the Capacity of Optical Intensity Channels Corrupted by Gaussian Noise, Proc. 21st Biennial Symp. on Commun.,, Kingston, Ontario, Canada, June 2002.

Back to Top

Coded Modulation

Journal Papers

M. Ardakani, F. R. Kschischang, and Wei Yu, Near-Capacity Coding for Discrete Multitone Systems with Impulse Noise, EURASIP Journal on Applied Signal Processing, Vol. 2006, Article ID 98738, pp. 1-10, 2006.
M. Ardakani, T. Esmailian and F. R. Kschischang, Near-capacity Coding in Multicarrier Modulation Systems, IEEE Transactions on Communications, vol. 52, pp. 1880-1889, November, 2004. (PDF)
W.-M. Lee and F. R. Kschischang, Complexity/Performance Tradeoffs in Multistage Decoders, European Trans. on Telecommun., vol. 5, no. 6, pp. 665-679, Nov.-Dec., 1994.
F. R. Kschischang and S. Pasupathy, Optimal Shaping Properties of the Truncated Polydisc, IEEE Transactions on Information Theory, vol. 40, no. 3, pp. 892-903, May 1994. (PDF)
F. R. Kschischang and S. Pasupathy, Optimal Nonuniform Signaling for Gaussian Channels, IEEE Transactions on Information Theory, vol. 39, no. 3, pp. 913-929, May 1993. (PDF)
F. R. Kschischang and S. Pasupathy, Some Ternary and Quaternary Codes and Associated Sphere Packings, IEEE Transactions on Information Theory, vol. 38, no. 2, pp. 227-246, Mar. 1992. (PDF)
F. R. Kschischang and S. Pasupathy, Nonuniform Signaling in Coded Modulation, in Coded Modulation and Bandwidth-Efficient Transmission, E. Biglieri and M. Luise, eds., Elsevier Science Publishers B.V., New York, pp. 225-236, 1992.
F. R. Kschischang, P. G. de Buda, and S. Pasupathy, Block Coset Codes for M-ary Phase Shift Keying, IEEE Journal of Elected Areas in Communications, Special Issue on Bandwidth- and Power-Efficient Coded Modulation, vol. 7, pp. 900-913, Aug. 1989. (PDF)

Conference Papers

F. R. Kschischang, Huffman Codes for Shaping Gain, Proc. 16th Biennial Symp. Commun., Queen's University at Kingston, May 27-29, 1992, pp. 79-82.
F. R. Kschischang and S. Pasupathy, Coset Code Constructions of N-Dimensional Sphere Packings from 1- and 2- Dimensional Lattices, Proc. Pacific Rim Conf. on Computers, Communications, and Signal Processing,Victoria, B.C., June 1 - June 2, 1989.
F. R. Kschischang, P. G. de Buda, and S. Pasupathy, Block Encoding of M-ary Phase Shift Keying, Proc. 14th Biennial Symp. Commun.,Queen's University at Kingston, pp. A.1.9-A.1.12, May 29 - June 1, 1988.

Back to Top

Communication Networks

Journal Papers

Y. Mao, F. R. Kschischang, B.-C. Li, and S. Pasupathy, A Factor Graph Approach to Link Loss Monitoring in Wireless Sensor Networks, IEEE Journal of Selected Areas in Communications, vol. 23, pp. 820-829, Apr. 2005. (PDF)
F. R. Kschischang and M. Molle, The Helical Window Token Ring, IEEE Transactions on Information Theory, vol. 35, pp. 626-636, May 1989. (PDF)

Back to Top

Course Notes

F. R. Kschischang, The Hilbert Transform, Supplementary Notes for ECE 316, Communication Systems, University of Toronto, Department of Electrical and Computer Engineering, Oct. 2006. (PDF)
F. R. Kschischang, Complex Numbers and the Complex Exponential, Supplementary Notes for ECE 316, Communication Systems, University of Toronto, Department of Electrical and Computer Engineering, Sept. 2005. (PDF)

Back to Top

Copyright Notice

©1989-2007 IEEE, where published by the IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Some of this work has been submitted to the IEEE for possible publication. Copyright may be transferred with notice, after which this version may no longer be accessible.