Home > Authors and editors

Sudhan Majhi

Indian Institute of Technology Patna India

Dr. Sudhan Majhi received the M.Tech. degree in computer science and data processing (CSDP) from Indian Institute of Technology (IIT) Kharagpur, India, in 2004, and the Ph.D. degree from Nanyang Technological University (NTU), Singapore, in 2008. He has post-doctoral experience with the University of Michigan Dearborn Dearborn, MI, USA, the Institute of Electronics and Telecommunications Rennes (IETR), France, and Nanyang Technological University, Singapore. He is currently an Associate Professor in the Department of Electrical Engineering, IIT Patna, Patna, India. He is also a fellow of Sir Visvesvaraya Young Faculty Research. His research interest includes signal processing for wireless communication which includes blind synchronization and parameter estimation, modulation classification, cooperative communications, physical layer security, cognitive radio, NOMA, mmWAVE, D2D, V2V, and M2M communication, sequence design and the coding technique, OFDM, MIMO, SC-FDMA, and MIMO-OFDM.

2chapters authored

Chapters authored

Orthogonal Pulse-Based Modulation Schemes for Time Hopping Ultra Wideband Radio Systems

By Sudhan Majhi and Youssef Nasser

Part of the book: Novel Applications of the UWB Technologies

A Direct Construction of Intergroup Complementary Code Set for CDMA

By Palash Sarkar and Sudhan Majhi

A collection of mutually orthogonal complementary codes (CCs) is said to be complete complementary codes (CCCs) where the number of CCs are equal to the number of constituent sequences in each CC. Intergroup complementary (IGC) code set is a collection of multiple disjoint code groups with the following correlation properties: (1) inside the zero-correlation zone (ZCZ), the aperiodic autocorrelation function (AACF) of any IGC code is zero for all nonzero time shifts; (2) the aperiodic cross-correlation function (ACCF), of two distinct IGC codes, is zero for all time shifts inside the ZCZ when they are taken from the same code groups; and (3) the ACCF, for two IGC codes from two different code groups, is zero everywhere. IGC code set has a larger set size than CCC, and both can be applicable in multicarrier code-division multiple access (CDMA). In this chapter, we present a direct construction of IGC code set by using second-order generalized Boolean functions (GBFs), and our IGC code set can support interference-free code-division multiplexing. We also relate our construction with a graph where the ZCZ width depends on the number of isolated vertices present in a graph after the deletion of some vertices. Here, the construction that we propose can generate IGC code set with more flexible parameters.

Part of the book: Coding Theory

Related collaborators

Wei Li

Fudan University , China

Runfeng Yang

R Simon Sherratt

University of Reading , United Kingdom

Youssef Nasser

American University of Beirut , Lebanon

Chen Yunfeng

Fudan University , China

Gao Ting

Fudan University , China

Zhou Feng

Fudan University , China

Chen Danfeng

Fudan University , China

Fu Haipeng

Fudan University , China

Cai Deyun

Fudan University , China