Refereed Conference Papers
[1]
J. N. Laneman and G. E. Peterson, “Real-Time Learning of Aircraft Parameters Using Recursive Least-Squares to Train RBF Networks,” in Proc. Artificial Neural Networks in Engineering (ANNIE), St. Louis, MO, Nov. 1996.
[2]
J. N. Laneman and G. W. Wornell, “Robust Equalization for Spread-Response Precoding Systems,” in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing (ICASSP), Seattle, WA, May 1998, pp. 3513–3516.
[3]
J. N. Laneman and G. W. Wornell, “Energy-Efficient Antenna Sharing and Relaying for Wireless Networks,” in Proc. IEEE Wireless Comm. and Networking Conf. (WCNC), Chicago, IL, Sept. 2000, pp. 7–12.
[4]
J. N. Laneman, G. W. Wornell, and D. N. C. Tse, “An Efficient Protocol for Realizing Cooperative Diversity in Wireless Networks,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Washington, DC, June 2001, p. 294. doi: 10.1109/isit.2001.936157.
[5]
J. N. Laneman and G. W. Wornell, “Distributed Space-Time Coded Protocols for Exploiting Cooperative Diversity in Wireless Networks,” in Proc. IEEE Global Comm. Conf. (GLOBECOM), Taipei, Taiwan, Nov. 2002, pp. 77–81. doi: 10.1109/tit.2003.817829.
[6]
J. N. Laneman, E. Martinian, G. W. Wornell, J. G. Apostolopoulos, and S. J. Wee, “Comparing Application- and Physical-Layer Approaches to Diversity on Wireless Channels,” in Proc. IEEE Int. Commun. Conf. (ICC), May 2003, pp. 2678–2682. doi: 10.1109/icc.2003.1204450.
[7]
J. N. Laneman, “Limiting Analysis of Outage Probabilities for Diversity Schemes in Fading Channels,” in Proc. IEEE Global Comm. Conf. (GLOBECOM), San Francisco, CA, Dec. 2003, pp. 1242–1246. doi: 10.1109/glocom.2003.1258437.
[8]
J. N. Laneman and G. Kramer, “Window Decoding for the Multiaccess Channel with Generalized Feedback,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Chicago, IL, July 2004, p. 281. doi: 10.1109/isit.2004.1365316.
[9]
J. N. Laneman, E. Martinian, and G. W. Wornell, “Source-Channel Diversity Approaches for Multimedia Communication,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Chicago, IL, July 2004, p. 393. doi: 10.1109/isit.2004.1365430.
[10]
W. Zhang and J. N. Laneman, “Benefits of Correlated MIMO Schemes for Wideband Communication,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Chicago, IL, July 2004, p. 414. doi: 10.1109/isit.2004.1365454.
[11]
M. Sikora, J. N. Laneman, M. Haenggi, D. J. Costello Jr., and T. E. Fuja, “On the Optimum Number of Hops in Linear Ad Hoc Networks,” in Proc. IEEE Information Theory Workshop (ITW), San Antonio, TX, Oct. 2004, pp. 165–169.
[12]
D. Chen and J. N. Laneman, “Noncoherent Demodulation for Cooperative Diversity in Wireless Systems,” in Proc. IEEE Global Comm. Conf. (GLOBECOM), Dallas, TX, Nov. 2004, pp. 31–35. doi: 10.1109/glocom.2004.1377907.
[13]
J. N. Laneman, “Network Coding Gain of Cooperative Diversity,” in Proc. IEEE Military Comm. Conf. (MILCOM), Monterey, CA, Nov. 2004, pp. 106–112. doi: 10.1109/milcom.2004.1493254.
[14]
W. Zhang and J. N. Laneman, “Recursive Training with Unitary Modulation for Correlated Block-Fading MIMO Channels,” in Proc. IEEE Workshop on Sig. Proc. Adv. in Wireless Comm. (SPAWC), New York, NY, June 2005, pp. 746–750. doi: 10.1109/spawc.2005.1506239.
[15]
C. T. K. Ng, J. N. Laneman, and A. Goldsmith, “The Role of SNR in Achieving MIMO Rates in Cooperative Systems,” in Proc. IEEE Information Theory Workshop (ITW), Punta del Este, Uruguay, Mar. 2006, pp. 288–292. doi: 10.1109/itw.2006.1633831.
[16]
S. Kotagiri and J. N. Laneman, “Information Embedding in Degraded Broadcast Channels,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Seattle, WA, July 2006, pp. 494–498. doi: 10.1109/isit.2006.261764.
[17]
W. Zhang, S. Kotagiri, and J. N. Laneman, “Information Transmission over the Postal Channel with and without Feedback,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Seattle, WA, July 2006, pp. 2749–2753. doi: 10.1109/isit.2006.261562.
[18]
S. Kotagiri and J. N. Laneman, “Multiaccess Channels with State Information Known to One Encoder: A Case of Degraded Message Sets,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Nice, France, June 2007, pp. 1566–1570. doi: 10.1109/isit.2007.4557445.
[19]
W. Zhang, S. Kotagiri, and J. N. Laneman, “Writing on Dirty Paper with Resizing and its Application to Quasi-Static Fading Broadcast Channels,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Nice, France, June 2007, pp. 381–385. doi: 10.1109/isit.2007.4557255.
[20]
K. Azarian and J. N. Laneman, “Linear Space-Time Codes with Optimal Diversity-Multiplexing Tradeoff,” in Proc. IEEE Information Theory Workshop (ITW), Lake Tahoe, CA, Sept. 2007, pp. 483–486. doi: 10.1109/itw.2007.4313122.
[21]
W. Chang, S. Kotagiri, J. N. Laneman, S.-Y. Chung, and Y.-H. Lee, “Compress-Forward Relaying over Parallel Gaussian Channels,” in Proc. Comp. Adv. Mult-Sensor and Adaptive Processing, St. Thomas, US Virgin Islands, Dec. 2007, pp. 305–308. doi: 10.1109/camsap.2007.4498026.
[22]
B. P. Dunn and J. N. Laneman, “Rate-Delay Tradeoffs for Communicating a Bursty Source over an Erasure Channel with Feedback,” in Proc. Int. Zurich Seminar on Communications, Zürich, Switzerland, Mar. 2008, pp. 136–139. doi: 10.1109/izs.2008.4497294.
[23]
D. Chen and J. N. Laneman, “Joint Power and Bandwidth Allocation in Wireless Multihop Networks,” in Proc. IEEE Wireless Comm. and Networking Conf. (WCNC), Las Vegas, NV, Apr. 2008, pp. 990–995. doi: 10.1109/wcnc.2008.180.
[24]
A. Zaidi, S. Kotagiri, J. N. Laneman, and L. Vandendorpe, “Cooperative Relaying with State Available at the Relay Only,” in Proc. IEEE Information Theory Workshop (ITW), Porto, Portugal, May 2008, pp. 139–143.
[25]
B. P. Dunn, M. L. Dickens, and J. N. Laneman, “Design and Implementation of a Portable Software Radio,” in Proc. Int. Symp. Adv. Radio Tech. (ISART), Boulder, CO, June 2008. doi: 10.1109/mcom.2008.4597105.
[26]
B. P. Dunn and J. N. Laneman, “Basic Limits on Protocol Information in Slotted Communication Networks,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Toronto, Canada, July 2008, pp. 2302–2306. doi: 10.1109/isit.2008.4595401.
[27]
Ö. Oyman and J. N. Laneman, “Multihop Diversity in Wideband OFDM Systems: The Impact of Spatial Resuse and Frequency Selectivity,” in Proc. Int. Symp. Spread Spectrum Techniques and Applications (ISSSTA), Bologna, Italy, Aug. 2008, pp. 216–221.
[28]
M. L. Dickens, B. P. Dunn, and J. N. Laneman, “Portable Software Radios using Commodity Hardware and Open-Source Software,” in Proc. SDR, Washington, DC, Oct. 2008.
[29]
B. P. Dunn, M. Bloch, and J. N. Laneman, “Secure Bits through Queues,” in Proc. IEEE Information Theory Workshop (ITW), Volos, Greece, June 2009, pp. 37–41. doi: 10.1109/itwnit.2009.5158537.
[30]
I. Krikidis, J. N. Laneman, J. Thompson, and S. McLaughlin, “Stability Analysis for Cognitive Radio with Cooperative Enhancements,” in Proc. IEEE Information Theory Workshop (ITW), Volos, Greece, June 2009, pp. 286–290. doi: 10.1109/itwnit.2009.5158588.
[31]
H. Sneessens, L. Vandendorpe, and J. N. Laneman, “Adaptive CF Relaying in Fading Environments with or without Wyner-Ziv Coding,” in Proc. IEEE Int. Commun. Conf. (ICC), Dresden, Germany, June 2009, pp. 1–5. doi: 10.1109/icc.2009.5198699.
[32]
P. Rost, G. Fettweis, and J. N. Laneman, “Opportunities, Constraints, and Benefits of Relaying in the Presence of Interference,” in Proc. IEEE Int. Commun. Conf. (ICC), Dresden, Germany, June 2009, pp. 1–5. doi: 10.1109/icc.2009.5199274.
[33]
U. Kumar, J. N. Laneman, and V. Gupta, “Coding Schemes for Additive Noise Channels with Noisy Feedback,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Seoul, Korea, July 2009, pp. 1258–1262.
[34]
A. Zaidi, S. Kotagiri, and J. Nicholas Laneman, and L. Vandendorpe, “Multiaccess Channels with State Known to One Encoder: Another Case of Degraded Message Sets,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Seoul, Korea, July 2009, pp. 2376–2380. doi: 10.1109/isit.2009.5205986.
[35]
U. Kumar, J. N. Laneman, and V. Gupta, “Cooperative Communications with Feedback via Stochastic Approximation,” in Proc. IEEE Information Theory Workshop (ITW), Taormina, Sicily, Oct. 2009, pp. 411–415.
[36]
Z. Sun, I. Krikidis, J. N. Laneman, and J. Thompson, “Cognitive Radio Enhancements for Legacy Networks using Cooperative Diversity,” in Proc. IEEE Global Comm. Conf. (GLOBECOM), Honolulu, Hawaii, Dec. 2009, pp. 1–6. doi: 10.1109/glocom.2009.5425379.
[37]
N. Dodson, G. J. Bradford, and J. N. Laneman, “A High Performance Transceiver RF Front-end Implementation,” in Proc. SDR, Washington, DC, 2010.
[38]
M. L. Dickens, B. P. Dunn, and J. N. Laneman, “Thresholding for Optimal Data Processing in a Software Defined Radio Kernel,” in Proc. Karlsruhe Workshop on Software Radios (WSR), Karlsruhe, Germany, 2010.
[39]
G. J. Bradford and J. N. Laneman, “A Survey of Implementation Efforts and Experimental Design for Cooperative Communications,” in Proc. IEEE international conference on acoustics, speech, and signal processing (ICASSP), Dallas, TX, Mar. 2010, pp. 5602–5605. doi: 10.1109/icassp.2010.5495248.
[40]
Z. Sun, G. J. Bradford, and J. N. Laneman, “Sequence Detection Algorithms for Dynamic Spectrum Access Networks,” in Proc. IEEE Int. Symp. Dynamic Spectrum Access Networks (DySPAN), Singapore, Apr. 2010, pp. 1–9. doi: 10.1109/dyspan.2010.5457856.
[41]
U. Kumar, V. Gupta, and J. N. Laneman, “Sufficient Conditions for Stabilizability over Gaussian Relay and Cascade Channels,” in Proc. IEEE Conf. Decision and Control (CDC), Atlanta, GA, Dec. 2010, pp. 4765–4770. doi: 10.1109/cdc.2010.5717204.
[42]
M. L. Dickens and J. N. Laneman, “On the Use of an Algebraic Language for Waveform Definition,” in Proc. SDR WInnComm, Washington, DC, 2011. doi: 10.1007/s10470-012-9921-9.
[43]
M. L. Dickens, J. N. Laneman, and B. P. Dunn, “Seamless Dynamic Runtime Reconfiguration in a Software-Defined Radio,” in Proc. SDR WInnComm Europe, Brussels, Belgium, June 2011. doi: 10.1007/s11265-011-0645-3.
[44]
M. Khoshnevisan and J. N. Laneman, “Power Allocation in Wireless Systems Subject to Long-Term and Short-Term Power Constraints,” in Proc. IEEE Int. Commun. Conf. (ICC), Kyoto, Japan, June 2011, pp. 1–5. doi: 10.1109/icc.2011.5963208.
[45]
E. MolavianJazi and J. N. Laneman, “Source-Channel Coding Tradeoff in Multiple Antenna Multiple Access Channels,” in Proc. IEEE Int. Symp. Information Theory (ISIT), St. Petersburg, Russia, Aug. 2011, pp. 1688–1692. doi: 10.1109/isit.2011.6033833.
[46]
J. N. Laneman and B. P. Dunn, “Communications Overhead as the Cost of Constraints,” in Proc. IEEE Information Theory Workshop (ITW), Paraty, Brazil, Oct. 2011, pp. 365–369. doi: 10.1109/itw.2011.6089481.
[47]
U. Kumar, V. Gupta, and J. N. Laneman, “On Stability Across a Gaussian Product Channel,” in Proc. IEEE Conf. Decision and Control (CDC), Orlando, FL, Dec. 2011, pp. 3142–3147. doi: 10.1109/cdc.2011.6160955.
[48]
Z. Sun and J. N. Laneman, “Secondary Access Policy with Imperfect Sensing in Dynamic Spectrum Access Networks,” in Proc. IEEE Int. Commun. Conf. (ICC), Ottawa, Canada, June 2012, pp. 1752–1756. doi: 10.1109/icc.2012.6364519.
[49]
G. J. Bradford and J. N. Laneman, “Low Latency Relaying Schemes for Next-Generation Cellular Networks,” in Proc. IEEE Int. Commun. Conf. (ICC), Ottawa, Canada, June 2012, pp. 4294–4299. doi: 10.1109/icc.2012.6363890.
[50]
M. Khoshnevisan and J. N. Laneman, “Achievable Rates for Intermittent Communication,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Boston, MA, July 2012, pp. 1346–1350. doi: 10.1109/isit.2012.6283479.
[51]
E. MolavianJazi and J. N. Laneman, “Simpler Achievable Rate Regions for Multiaccess with Finite Blocklength,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Boston, MA, July 2012, pp. 36–40. doi: 10.1109/isit.2012.6284211.
[52]
G. J. Bradford and J. N. Laneman, “Error Exponents for Block Markov Superposition Encoding with Varying Decoding Latency,” in Proc. IEEE Information Theory Workshop (ITW), Lausanne, Switzerland, Sept. 2012, pp. 237–241. doi: 10.1109/itw.2012.6404666.
[53]
M. Khoshnevisan and J. N. Laneman, “Achievable Rates for Intermittent Multi-Access Communication,” in Proc. IEEE Information Theory Workshop (ITW), Seville, Spain, Sept. 2013.
[54]
Z. Sun and J. N. Laneman, “Sampling Schemes and Detection Algorithms for Wideband Spectrum Sensing,” in Proc. IEEE Int. Symp. Dynamic Spectrum Access Networks (DySPAN), McLean, VA, Apr. 2014, pp. 541–552. doi: 10.1109/tsp.2014.2332979.
[55]
E. MolavianJazi and J. N. Laneman, “On the Second-Order Cost of TDMA for Gaussian Multiple Access,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Honolulu, Hawaii, July 2014, pp. 266–270. doi: 10.1109/isit.2014.6874836.
[56]
E. MolavianJazi and J. N. Laneman, “Coded Modulation for Gaussian Channels: Dispersion- and Entropy-Limited Regimes,” in Proc. IEEE Wireless Comm. and Networking Conf. (WCNC), New Orleans, LA, Mar. 2015, pp. 528–533. doi: 10.1109/wcnc.2015.7127525.
[57]
M. Cai and J. N. Laneman, “An LTE-Based Wideband Distributed Spectrum Sharing Architecture,” in Proc. SDR WInnComm, Reston, VA, Mar. 2016.
[58]
M. Cai and J. N. Laneman, “Multichannel Immediate Multiple Access for Dedicated Short-Range Communications: IEEE 802.11p-Compatible Physical Layer,” in Proc. IEEE Vehicular Tech. Conf. (VTC), Montreal, Canada, Sept. 2016, pp. 1–5. doi: 10.1109/vtcfall.2016.7881099.
[59]
M. Cai et al., “Effect of Wideband Beam Squint on Codebook Design in Phased-Array Wireless Systems,” in Proc. IEEE Global Comm. Conf. (GLOBECOM), Washington, DC, Dec. 2016, pp. 1–6. doi: 10.1109/glocom.2016.7841766.
[60]
K. Gao et al., “Beampattern-Based Tracking for Millimeter Wave Communication Systems,” in Proc. IEEE Global Comm. Conf. (GLOBECOM), Washington, DC, Dec. 2016, pp. 1–6. doi: 10.1109/glocom.2016.7841625.
[61]
N. Kleber and J. N. Laneman, “Tracking of a Frequency-Hopping Interferer in an OFDM System,” in Proc. IEEE Wireless Comm. and Networking Conf. (WCNC), San Francisco, CA, Mar. 2017, pp. 1–6.
[62]
M. Cai, J. N. Laneman, and B. Hochwald, “Beamforming Codebook Compensation for Beam Squint with Channel Capacity Constraint,” in Proc. IEEE Int. Symp. Information Theory (ISIT), Aachen, Germany, July 2017, pp. 76–80. doi: 10.1109/isit.2017.8006493.
[63]
M. Cai, J. N. Laneman, and B. Hochwald, “Carrier Aggregation for Phased-Array Analog Beamforming with Beam Squint,” in Proc. IEEE Global Comm. Conf. (GLOBECOM), Signapore, Dec. 2017, pp. 1–7. doi: 10.1109/glocom.2017.8254862.
[64]
K. Gao, J. N. Laneman, and B. Hochwald, “Capacity of Multiple One-Bit Transceivers in a Rayleigh Environment,” in Proc. IEEE Wireless Comm. and Networking Conf. (WCNC), Barcelona, Spain, Apr. 2018, pp. 1–6. doi: 10.1109/wcnc.2018.8377302.
[65]
K. Gao, J. N. Laneman, N. Estes, J. Chisum, and B. Hochwald, “Channel Estimation with One-Bit Transceivers in a Rayleigh Environment,” in Proc. IEEE Global Comm. Conf. (GLOBECOM), Waikoloa, HI, Dec. 2019, pp. 1–6. doi: 10.1109/gcwkshps45667.2019.9024647.
[66]
G. Martinez et al., “An Open, Real-World Dataset of Cellular UAV Communication Properties,” in Proc. Int. Conf. On computer Communications and Networks (ICCCN), July 2021, pp. 1–6. doi: 10.1109/icccn52240.2021.9522344.
[67]
X. Meng, N. Estes, J. N. Laneman, J. Chisum, R. Bendlin, and B. M. Hochwald, “Spectral Efficiency with One-Bit Transmitters under Out-of-Band Power Constraints,” in Proc. IEEE Global Comm. Conf. (GLOBECOM), Rio de Janeiro, Brazil, Dec. 2022, pp. 1067–1072.
[68]
B. Lu and J. N. Laneman, “Spectrum Efficiency of Radar: A Novel Approach Based upon the Cramer-Rao Lower Bound,” in Proc. IEEE Int. Symp. Dynamic Spectrum Access Networks (DySPAN), London, UK, May 2025, pp. 1–8. doi: 10.1109/dyspan64764.2025.11115908.
[69]
B. Lu, C. Reinking, and J. N. Laneman, “Initial Evaluation of Retrieval-Augmented Generation Approaches in Spectrum Policy Research,” in Proc. IEEE Int. Symp. Dynamic Spectrum Access Networks (DySPAN), London, UK, May 2025, pp. 1–5.
[70]
O. Mujumdar, W. Zhang, and J. N. Laneman, “Achievable Rates for State-Dependent Discrete Memoryless Channels Under Coded Sensing,” in Proc. IEEE Information Theory Workshop (ITW), Sydney, Australia, Sept. 2025. doi: 10.1109/itw62417.2025.11240522.
[71]
N. Rainville et al., “The SpectrumX Mobile Experiment Platform,” in Proc. IEEE Radio and Wireless Week (RWW), Los Angeles, CA, Jan. 2026. doi: 10.1109/rws64705.2026.11408768.