In this paper, we investigate Kolmogorov-Arnold network-based autoencoders (KAN-AEs) with symbolic regression (SR) for energy-efficient channel coding. By using SR, we convert KAN-AEs into symbolic expressions, which enables low-complexity implementation and improved energy efficiency at the radios. To further enhance the efficiency, we introduce a new non-linearity score term in the SR process to help select lower-complexity equations when possible. Through numerical simulations, we demonstrate that KAN-AEs achieve competitive BLER performance while improving energy efficiency when paired with SR. We score the energy efficiency of a KAN-AE implementation using the proposed non-linearity metric and compare it to a multi-layer perceptron-based autoencoder (MLP-AE). Our experiment shows that the KAN-AE paired with SR uses 1.38 times less energy than the MLP-AE, supporting that KAN-AEs are a promising choice for energy-efficient deep learning-based channel coding.

In this study, we introduce smooshed binary modulation on conjugate-reciprocal zeros (SBMOCZ) to mitigate timing offset (TO)-induced zero rotation in binary modulation on conjugate-reciprocal zeros (BMOCZ)-based orthogonal frequency division multiplexing (OFDM). In our approach, we modify Huffman BMOCZ with zero smooshing to create a structured gap in the zero constellation which rotates under a TO. By exploiting the auto-correlation properties of SBMOCZ, we develop a low-complexity rotation estimator at the receiver that can be implemented using a single discrete Fourier transform (DFT). We theoretically analyze the properties of SBMOCZ polynomials and derive closed-form expressions for the aperiodic auto-correlation function (AACF) and peak-to-average power ratio (PAPR). To learn the smooshed zero constellation parameters, we introduce two machine learning (ML)-based methods. The first uses a soft-output from the direct zero-testing (DiZeT) decoder with hinge loss, while the second jointly trains a neural network (NN)-based decoder robust to fading and the constellation parameters. Our numerical simulations demonstrate that SBMOCZ remains effective under TO impairments without relying on affine cyclically permutable codes (ACPCs) and improves bit error rate (BER) and block error rate (BLER) at no additional overhead.

In this work, we propose a zero constellation for binary modulation on conjugate-reciprocal zeros (BMOCZ), called jutted BMOCZ (J-BMOCZ), and study its application to non-coherent orthogonal frequency division multiplexing (OFDM). With J-BMOCZ, we introduce rotational asymmetry to the zero constellation for Huffman BMOCZ, which removes ambiguity at the receiver under a uniform rotation of the zeros. The asymmetry is controlled by the magnitude of “jutted” zeros and enables the receiver to estimate zero rotation using a simple cross-correlation. The proposed method, however, leads to a natural trade-off between asymmetry and zero stability. Accordingly, we introduce a reliability metric to measure the stability of a polynomial’s zeros under an additive perturbation of the coefficients, and we apply the metric to optimize the J-BMOCZ zero constellation parameters. We then combine the advantages of J-BMOCZ and Huffman BMOCZ to design a hybrid waveform for OFDM with BMOCZ (OFDM-BMOCZ). The pilot-free waveform enables blind synchronization/detection and has a fixed peak-to-average power ratio that is independent of the message. Finally, we assess the proposed scheme through simulation and demonstrate non-coherent OFDM-BMOCZ using low-cost software-defined radios.

In this work, we propose jutted binary modulation on conjugate-reciprocal zeros (J-BMOCZ) for non-coherent communication under a carrier frequency offset (CFO). By introducing asymmetry to the Huffman BMOCZ zero constellation, we exploit the identical aperiodic auto-correlation function of BMOCZ sequences to derive a Fourier-domain metric for CFO estimation. Unlike the existing methods for Huffman BMOCZ, which require a cyclically permutable code (CPC) for pilot-free CFO correction, J-BMOCZ enables the estimation of a CFO without the use of pilots or channel coding. Through numerical simulations in additive white Gaussian noise and fading channels, we show that the bit error rate (BER) loss of J-BMOCZ under a CFO is just 1 dB over Huffman BMOCZ without a CFO. Furthermore, the results show that coded J-BMOCZ achieves better BER performance than Huffman BMOCZ with a CPC.

In this work, we propose two methods to design zero constellations for binary modulation on conjugate-reciprocal zeros (BMOCZ). In the first approach, we treat constellation design as a multi-label binary classification problem and learn the zero locations for a direct zero-testing (DiZeT) decoder. In the second approach, we introduce a neural network (NN)-based decoder and jointly learn the decoder and zero constellation parameters. We show that the NN-based decoder can directly generalize to flat-fading channels, despite being trained under additive white Gaussian noise. Furthermore, the results of numerical simulations demonstrate that learned zero constellations outperform the canonical, Huffman BMOCZ constellation, with the proposed NN-based decoder achieving large performance gain at the expense of increased computational complexity.

In this study, we propose a new binary modulation on conjugate-reciprocal zeros (BMOCZ) zero constellation, which we call smooshed binary modulation on conjugate-reciprocal zeros (SBMOCZ), to address carrier frequency offset (CFO)induced zero rotation without depending on channel coding. In our approach, we modify the phase mapping of Huffman BMOCZ by shrinking the angle between adjacent zeros, except for the first and last, to introduce a gap in the zero constellation. By discerning the gap location in the received polynomial, the receiver can estimate and correct the phase rotation. We demonstrate the error rate performance of SBMOCZ relative to Huffman BMOCZ, showing that SBMOCZ addresses a CFO-induced rotation at the cost of a modest performance reduction compared to Huffman BMOCZ in the absence of a CFO. Finally, we compare SBMOCZ to Huffman BMOCZ using a cyclically permutable code (CPC), showing a 4 dB bit error rate (BER) improvement in a fading channel, while demonstrating comparable performance across other simulations.

In this study, we analyze the feasibility of distributed phase synchronization for coherent signal superposition, a fundamental enabler for paradigms like coherent over-the-air computation (OAC), distributed beamforming, and interference alignment, under mobility and hardware impairments. With the focus on coherent OAC, we introduce phase-coded pilots (PCPs), a strategy where the radios communicate with each other to eliminate the round-trip phase change in the uplink (UL) and downlink (DL) to align the phase of the received symbol at a desired angle. In this study, considering a carrier frequency offset (CFO)-resilient multi-user procedure, we derive the statistics of the phase deviations to assess how fast the phase coherency degrades. Our results show that residual CFO is a major factor determining the duration of phase coherency, in addition to the non-negligible effects of mobility and the number of nodes in the network. We also provide a proof-of-concept demonstration for coherent signal superposition by using off-the-shelf radios to demonstrate the feasibility of PCPs in practice.

In this study, we propose an orthogonal frequency division multiplexing (OFDM) based scheme to achieve interference-free backscatter communications (BC) in a symbiotic radio system. In this scheme, the backscatter device shifts the primary signal, i.e., the OFDM symbols transmitted from a base station, in the frequency domain to transmit its information. Symbiotically, the base station (BS) empties specific subcarriers within the band so that the received signals from the backscatter device and the primary signal are always orthogonal to each other. To address the channel estimation challenge for the signals arriving from the backscatter device, we consider a non-coherent detector for obtaining the information from the backscatter signal at the receiver. We derive the bit-error rate performance of the detector theoretically. Through the comprehensive simulations, we show that the proposed approach achieves a lower bit-error rate up to 10−4at 30 dB with BC by eliminating direct link interference.

In this study, we introduce a new over-the-air computation (OAC) technique based on modulation on conjugate-reciprocal zeros (MOCZ). In this approach, each transmitter encodes the votes into the zeros of a Huffman polynomial, and the polynomial coefficients are transmitted. While the encoded zeros are preserved under a convolution operation due to the multipath channel, the signal superposition for OAC destroys the zeros. By exploiting the fact that a polynomial does not contribute to the superposed polynomial evaluated at one of its zeros, we prove that the receiver can still compute the majority votes with a low-complexity direct zero-testing decoder without channel state information at the transmitters and receiver. We discuss two methods. While the first method achieves a higher computation rate, the second method uses a differential encoding strategy to eliminate the need for power-delay profile information at the receiver for the first method at the expense of halved computation rate. Finally, we demonstrate the performance of the proposed methods in a distributed median computation scenario.

In this paper, we propose a slot-based protocol that does not rely on global-time synchronization to achieve a self- healing mesh network. With the proposed protocol, each node synchronizes with its neighbors locally by adjusting its time to transmit based on the reception instant of a decoded beacon signal. Also, it determines its slots without any coordinator to avoid collisions. Finally, to communicate the messages over the mesh network, it identifies the forwarding nodes on the shortest path without knowing the entire communication graph. We show that the proposed protocol can effectively resolve collisions over time while enabling nodes to synchronize with each other in a distributed manner. We numerically analyze the performance of the proposed protocol for different configurations under a realistic channel model considering asymmetrical links. We also implement the proposed method in practice with Long-Range (LoRa) devices. We demonstrate that the nodes adapt themselves to changes in the network and deliver a message from a sensing node to a reference node via multi-hop routing.

In this study, we propose a digital over-the-air computation (OAC) scheme for achieving continuous-valued (analog) aggregation for federated edge learning (FEEL). We show that the average of a set of real-valued parameters can be calculated approximately by using the average of the corresponding numerals, where the numerals are obtained based on a balanced number system. By exploiting this key property, the proposed scheme encodes the local stochastic gradients into a set of numerals. Next, it determines the positions of the activated orthogonal frequency division multiplexing (OFDM) subcarriers by using the values of the numerals. To eliminate the need for precise sample-level time synchronization, channel estimation overhead, and channel inversion, the proposed scheme also uses a non-coherent receiver at the edge server (ES) and does not utilize a pre-equalization at the edge devices (EDs). We theoretically analyze the MSE performance of the proposed scheme and the convergence rate for a non-convex loss function. To improve the test accuracy of FEEL with the proposed scheme, we introduce the concept of adaptive absolute maximum (AAM). Our numerical results show that when the proposed scheme is used with AAM for FEEL, the test accuracy can reach up to 98% for heterogeneous data distribution.

In this study, we propose a new approach to compute the majority vote (MV) function based on modulation on conjugate-reciprocal zeros (MOCZ) and introduce three different methods. In these methods, each transmitter maps the votes to the zeros of a Huffman polynomial, and the corresponding polynomial coefficients are transmitted. The receiver evaluates the polynomial constructed by the elements of the superposed sequence at conjugate-reciprocal zero pairs and detects the MV with a direct zero-testing (DiZeT) decoder. With differential and index-based encoders, we eliminate the need for power-delay information at the receiver while improving the computation error rate (CER) performance. The proposed methods do not use instantaneous channel state information at the transmitters and receiver. Thus, they provide robustness against phase and time synchronization errors. We theoretically analyze the CERs of the proposed methods. Finally, we demonstrate their efficacy in a distributed median computation scenario.

In this study, we propose a non-coherent over-the-air computation scheme to calculate the majority vote (MV) reliably in fading channels. The proposed approach relies on modulating the amplitude of the elements of complementary sequences based on the sign of the parameters to be aggregated. Since it does not use channel state information at the nodes, it is compatible with time-varying channels. To demonstrate the efficacy of our method, we employ it in a scenario where an unmanned aerial vehicle is guided by distributed sensors, relying on the MV computed using our proposed scheme. We show that the proposed scheme notably reduces the computation error rate with a longer sequence length in fading channels while maintaining the peak-to-mean-envelope power ratio of the transmitted orthogonal frequency division multiplexing signals to be less than or equal to 3 dB.

In this paper, we study distributed training by majority vote with the sign stochastic gradient descent (signSGD) along with over-the-air computation (OAC) under local differential privacy constraints. In our approach, the users first clip the local stochastic gradients and inject a certain amount of noise as a privacy enhancement strategy. Subsequently, they activate the indices of OFDM subcarriers based on the signs of the perturbed local stochastic gradients to realize a frequency-shift-keying-based majority vote computation at the parameter server. We evaluate the privacy benefits of the proposed approach and characterize the per-user privacy leakage theoretically. Our results show that the proposed technique improves the privacy guarantees and limits the leakage to a scaling factor of$\mathcal{O}(1/\sqrt{K})$, where$K$is the number of users, thanks to the superposition property of the wireless channel. With numerical experiments, we show that the proposed non-coherent aggregation is superior to quadrature-phase-shift-keying-based coherent aggregation, namely, one-bit digital aggregation (OBDA), in learning accuracy under time synchronization errors when the same privacy enhancement strategy is introduced to both methods.

In this study, we propose an over-the-air computation (OAC) scheme to calculate the majority vote (MV) for federated edge learning (FEEL). With the proposed approach, edge devices (EDs) transmit the signs of local stochastic gradients, i.e., votes, by activating one of two orthogonal resources. The MVs at the edge server (ES) are obtained with non-coherent detectors by exploiting the accumulations on the resources. Hence, the proposed scheme eliminates the need for channel state information (CSI) at the EDs and ES. In this study, we analyze various gradient-encoding strategies through the weight functions and waveform configurations over orthogonal frequency division multiplexing (OFDM). We show that specific weight functions that enable absentee EDs (i.e., hard-coded participation with absentees (HPA)) or weighted votes (i.e., soft-coded participation (SP)) can substantially reduce the probability of detecting the incorrect MV. By taking path loss, power control, cell size, and fading channel into account, we prove the convergence of the distributed learning for a non-convex function for HPA. Through simulations, we show that the proposed scheme with HPA and SP can provide high test accuracy even when the time-synchronization and the power control are not ideal under heterogeneous data distribution scenarios.

In this paper, we propose a framework where over-the-air computation (OAC) occurs in both uplink (UL) and downlink (DL), sequentially, in a multi-cell environment to address the latency and the scalability issues of federated edge learning (FEEL). To eliminate the channel state information (CSI) at the edge devices (EDs) and edge servers (ESs) and relax the time-synchronization requirement for the OAC, we use a non-coherent computation scheme, i.e., frequency-shift keying (FSK)-based majority vote (MV) (FSK-MV). With the proposed framework, multiple ESs function as the aggregation nodes in the UL and each ES determines the MVs independently. After the ESs broadcast the detected MVs, the EDs determine the sign of the gradient through another OAC in the DL. Hence, inter-cell interference is exploited for the OAC. In this study, we prove the convergence of the non-convex optimization problem for the FEEL with the proposed OAC framework. We also numerically evaluate the efficacy of the proposed method by comparing the test accuracy in both multi-cell and single-cell scenarios for both homogeneous and heterogeneous data distributions.

In this study, we propose circularly-shifted chirp (CSC)-based majority vote (MV) (CSC-MV), a power-efficient over-the-air computation (OAC) scheme, to achieve long-range federated edge learning (FEEL). The proposed approach maps the votes (i.e., the sign of the local gradients) from the edge devices (EDs) to the linear CSCs constructed with a discrete Fourier transform-spread orthogonal frequency division multiplexing (DFT-s-OFDM) transmitter. At the edge server (ES), the MV is calculated with an energy detector. We compare our proposed scheme with one-bit broadband digital aggregation (OBDA) and show that the output-power back-off (OBO) requirement of the transmitters with an adjacent-channel-leakage ratio (ACLR) constraint for CSC-MV is lower than the one with OBDA. For example, with an ACLR constraint of −22 dB, CSC-MV can have an OBO requirement of 6-7 dB less than the one with OBDA. When the power amplifier (PA) non-linearity is considered, we demonstrate that CSC-MV outperforms OBDA in terms of test accuracy for both homogeneous and heterogeneous data distributions, without using channel state information (CSI) at the ES and EDs.

In this study, we propose an over-the-air computation (AirComp) scheme for federated edge learning (FEEL) without channel state information (CSI) at the edge devices (EDs) or the edge server (ES). The proposed scheme relies on non-coherent communication techniques for achieving distributed training by majority vote (MV). In this work, the votes, i.e., the signs of the local gradients, from the EDs are represented with the pulse-position modulation (PPM) symbols constructed with discrete Fourier transform (DFT)-spread orthogonal frequency division multiplexing (OFDM) (DFT-s-OFDM). By taking the delay spread and time-synchronization errors into account, the MV at the ES is obtained with an energy detector. Hence, the proposed scheme does not require CSI at the EDs and ES. We also prove the convergence of the distributed training when the MV is obtained with the proposed scheme under fading channel. Through simulations, we show that the proposed scheme provides a high test accuracy in fading channel while reducing the peak-to-mean envelope power ratio (PMEPR).

In this study, we propose index modulation (IM) with circularly-shifted chirps (CSCs) (CSC-IM) for dual-function radar and communication (DFRC) systems. The proposed scheme encodes the information bits with the CSC indices and the phase-shift keying (PSK) symbols. It allows the receiver to exploit the frequency selectivity naturally in fading channels by combining IM and wideband CSCs. It also leverages the fact that a CSC is a constant-envelope signal to achieve a controllable peak-to-mean envelope power ratio (PMEPR). For radar functionality, CSC-IM maintains the good autocorrelation (AC) properties of a chirp by ensuring that the transmitted CSCs are separated apart sufficiently in the time domain through index separation (IS). We investigate the impact of IS on spectral efficiency (SE) and obtain the corresponding mapping functions. For theoretical results, we derive the union bound (UB) of the block error rate (BLER) for arbitrary chirps and the Cramer-Rao lower bounds (CRLBs) for the range and reflection coefficients for the matched filter (MF)-based estimation. We also prove that complementary sequences (CSs) can be constructed through CSCs by linearly combining the Fourier series of CSCs. Finally, through comprehensive comparisons, we demonstrate the efficacy of the proposed scheme for DFRC scenarios.

In this study, we propose a wideband index modulation (IM) based on circularly -shifted chirps. To derive the proposed method, we first prove that a Golay complementary pair (GCP) can be constructed by linearly combining the Fourier series of chirps. We show that Fresnel integrals and/or Bessel functions, arising from sinusoidal and linear chirps, respectively, can lead to GCPs. We then exploit discrete Fourier transform-spread orthogonal frequency division multiplexing (DFT-s-OFDM) to obtain a low-complexity transmitter and receiver. We also discuss its generalization for achieving a trade-off between peak-to-mean envelope power ratio (PMEPR) and spectral efficiency (SE). Through comprehensive simulations, we compare the proposed scheme with DFT-s-OFDM with IM, orthogonal frequency division multiplexing (OFDM) with IM and complementary sequences (CSs) from Reed-Muller (RM) code. Our numerical results show that the proposed method limits the PMEPR while exploiting the frequency selectivity in fading channels without an auxiliary method.

In this study, we propose a flexible construction of complementary sequences (CSs) that can contain zero-valued elements. To derive the construction, we use Boolean functions to represent a polynomial generated with a recursion. By applying this representation to recursive CS constructions, we show the impact of construction parameters such as sign, amplitude, phase rotation used in the recursion on the elements of the synthesized CS. As a result, we extend Davis and Jedwab’s CS construction by obtaining independent functions for the amplitude and phase of each element of the CS, and the seed sequence positions in the CS. The proposed construction shows that a set of distinct CSs compatible with non-contiguous resource allocations for orthogonal frequency-division multiplexing (OFDM) and various constellations can be synthesized systematically. It also leads to a low peak-to-mean-envelope-power ratio (PMEPR) multiple accessing scheme in the uplink and a low-complexity recursive decoder. We demonstrate the performance of the proposed encoder and decoder through comprehensive simulations.

In this study, we propose a differentiable layer for OFDM-based autoencoders (OFDM-AEs) to avoid high instantaneous power without regularizing the cost function used during the training. The proposed approach relies on the manipulation of the parameters of a set of functions that yield complementary sequences (CSs) through a deep neural network (DNN). We guarantee the peak-to-average-power ratio (PAPR) of each OFDM-AE symbol to be less than or equal to 3 dB. We also show how to normalize the mean power by using the functions in addition to PAPR. The introduced layer admits auxiliary parameters that allow one to control the amplitude and phase deviations in the frequency domain. Numerical results show that DNNs at the transmitter and receiver can achieve reliable communications under this protection layer at the expense of complexity.

In this paper, two modulation schemes based on complementary sequences (CSs) are proposed for uplink control channels in unlicensed bands. These schemes address high peak-to-average-power ratio (PAPR) under non-contiguous resource allocation in the frequency domain and reduce the maximum PAPR to 3 dB. The first scheme allows the users to transmit a small amount of uplink control information (UCI) such as acknowledgment signals and does not introduce a trade-off between PAPR and co-channel interference (CCI). The second scheme, which enables up to 21 UCI bits for a single user or 11 UCI bits for three users in an interlace, is based on a new theorem introduced in this paper. This theorem leads distinct CSs compatible with a wide variety of resource allocations while capturing the inherent relationship between CSs and Reed-Muller (RM) codes, which makes CSs more useful for practical systems. The numerical results show that the proposed schemes maintain the low-PAPR benefits without increasing the error rate for non-contiguous resource allocations in the frequency domain.

The peak-to-average-power ratio (PAPR) of the frequency domain multiplexed wake-up signals (WUSs) specified in IEEE P802.11ba can be very large and difficult to manage since it depends on the number and allocation of the active channels, and the data rate on each channel. To address this issue, we propose a transmission scheme based on complementary sequences (CSs) for multiple WUSs multiplexed in the frequency domain. We discuss how to construct CSs compatible with the framework of IEEE P802.11ba by exploiting a recursive Golay complementary pair (GCP) construction to reduce the instantaneous power fluctuations in time. We compare the proposed scheme with the other options under a non-linear power amplifier (PA) distortion. Numerical results show that the proposed scheme can lower the PAPR of the transmitted signal in frequency division multiple access (FDMA) scenarios more than 3 dB and yields a superior error rate performance under severe PA distortion.

In this study, we propose two schemes for uplink control channels based on non-contiguous complementary sequences (CSs) where the peak-to-average-power ratio (PAPR) of the resulting orthogonal frequency division multiplexing (OFDM) signal is always less than or equal to 3 dB. To obtain the proposed schemes, we extend Golay's concatenation and interleaving methods by considering extra upsampling and shifting parameters. The proposed schemes enable a flexible non-contiguous resource allocation in frequency, e.g., an arbitrary number of null symbols between the occupied resource blocks (RBs). The first scheme separates the PAPR minimization and the inter-cell interference minimization problems. While the former is solved by spreading the sequences in a Golay complementary pair (GCP) with the sequences in another GCP, the latter is managed by designing a set of GCPs with low cross-correlation. The second scheme generates reference symbols (RSs) and data symbols on each RB as parts of an encoded CS. Therefore, it enables coherent detection at the receiver side. The numerical results show that the proposed schemes offer significantly improved PAPR and cubic metric (CM) results in case of non-contiguous resource allocation as compared to the sequences defined in 3GPP New Radio (NR) and Zadoff-Chu (ZC) sequences.

In this study, we propose an approach to constructing on-off keying (OOK) symbols for wake- up radios (WURs) by using sequences in the frequency domain. The proposed method enables orthogonal multiplexing of wake-up signals (WUSs) and orthogonal frequency division multiplexing (OFDM) waveforms. We optimize the sequences with a tractable algorithm by considering the reliability of WUSs in fading channels. The proposed algorithm relies on an alternating minimization technique, i.e. cyclic algorithm-new (CAN), which was originally proposed for obtaining a unimodular sequence with good aperiodic correlation properties. In this study, we extend CAN to generate OOK waveforms with Manchester coding. We demonstrate the performance of four optimized sequences and compare with state-of-the-art approaches. We show that the proposed scheme improves the wake-up radio receiver (WURx) performance by controlling the energy distribution in frequency domain while removing the interference-floor at the OFDM receiver.

In this study, we compare the single-carrier (SC) waveform adopted in IEEE 802.11ad and unique word discrete Fourier transform spread orthogonal frequency division multiplexing (UW DFT-s-OFDM) waveform. We provide equivalent representations of up-sampling and down-sampling operations of the SC waveform by using discrete Fourier transform (DFT) and inverse DFT to enable explicit comparison of these two similar waveforms. By using this representation, we discuss why the IEEE 802.11ad SC waveform can cause suboptimal performance in multipath channel and discuss how to improve it with UW DFT-s-OFDM. With comprehensive link-level simulations, we show that replacing the 802.11ad SC waveform with UW DFT-spread OFDM can result in 1 dB gain in peak throughput without affecting the IEEE 802.11ad packet structure. We also evaluate the cross links where the transmitter is UW-DFT-s- OFDM and the receiver is traditional SC-FDE or vice versa. We demonstrate that UW DFT-s-OFDM receiver can decode an IEEE 802.11ad SC waveform with a slight SNR loss while IEEE 802.11ad SC receiver can decode a UW DFT-spread OFDM waveform with an interference floor.

Visible light communications (VLCs) are a promising technology to address the spectrum crunch problem in radio frequency networks. A major advantage of VLC networks is that they can use the existing lighting infrastructure in indoor environments, which may have large number of LEDs for illumination. While LEDs used for lighting typically have limited bandwidth, presence of many LEDs can be exploited for indoor VLC networks, to serve each user by multiple LEDs for improving link quality and throughput. In this paper, LEDs are grouped and assigned to the users based on received signal strength from each LED, for which different solutions are proposed to achieve maximum throughput, proportional fairness, and quality of service. Additionally, power optimization of LEDs for a given assignment is investigated, and the Jacobian and Hessian matrices of the corresponding optimization problem are derived. Moreover, for multi-element receivers with LED grouping at the transmitter, an improved optimal combining method is proposed. This method suppresses interference caused by simultaneous data transfer of LEDs and improves the overall signal-to-interference-plus-noise-ratio by 2-5 dB. Lastly, an efficient calculation of channel response is presented to simulate multipath VLC channel with low computational complexity.

The fifth generation (5G) wireless standard will support several new use cases and 10 to 100 times the performance of fourth generation (4G) systems. Because of the diverse applications for 5G, flexible solutions which can address conflicting requirements will be needed. In this paper, we propose a solution which enables the use of discrete Fourier transform spread orthogonal frequency division multiplexing (DFT-s-OFDM) and OFDM, which address different requirements, using a common low-complexity reference symbol (RS) design. In this solution, the DFT-s-OFDM symbol contains RSs in the frequency domain that may be shared by a subsequent OFDM symbol. The proposed scheme is generated by puncturing the output of a DFT-spread block and replacing the punctured samples with RSs in frequency. We prove that puncturing the interleaved samples at the output of the DFT-spread operation equivalently introduces a periodic interference to the data symbols at the input of the DFT-spread operation. We show that the interference due to the puncturing can be removed with a low-complexity receiver by exploiting the zeros inserted to certain locations before the DFT-spread block at the transmitter. Simulation results support that the proposed scheme removes the error floor caused by the puncturing and achieves lower peak-to- average-power ratio than OFDM.

In this paper, we consider a system of small cells assuming full duplex (FD) capable base stations (BSs) and half duplex (HD) user equipment (UEs). We investigate a mixed duplexing cellular system composed of FD and HD cells, when BSs are using directional transmissions. A stochastic geometry based model of the proposed system is used to derive the coverage and area spectral efficiency (ASE) of both BSs and UEs. The effect of FD cells on the performance of the mixed system is presented under different degree of directionality at the BSs. We show that enabling directional transmissions at the BSs yields significant ASE and coverage gain in both downlink and uplink. With directional transmissions, the ASE increases rapidly with the number of FD cells while the drop in the coverage rate due to FD operations reduces significantly.

Orthogonal frequency division multiplexing (OFDM) inherently suffers from two major drawbacks: high out-of-band (OOB) power leakage and high peak-to-average power ratio (PAPR). This paper proposes a novel approach called suppressing alignment for the joint reduction of the OOB power leakage and PAPR. The proposed approach exploits the temporal degrees of freedom provided by the cyclic prefix (CP), a necessary redundancy in OFDM systems, to generate a suppressing signal, that when added to the OFDM symbol, results in marked reduction in both the OOB power leakage and PAPR. Additionally, and in order to not cause any interference to the information data carried by the OFDM symbol, the proposed approach utilizes the wireless channel to perfectly align the suppressing signal with the CP duration at the OFDM receiver. Essentially, maintaining a bit error rate (BER) performance similar to legacy OFDM without requiring any change in the receiver structure.

In this work, we introduce a novel approach, called suppressing alignment, to reduce the out-of-band (OOB) interference of orthogonal frequency division multiplexing (OFDM) systems. Suppressing alignment exploits the unavoidable redundancy provided by the cyclic prefix (CP) and the wireless communications channel to generate an OOB interference suppressing signal at the OFDM transmitter. However, after passing through the wireless channel, the suppressing signal is aligned with the CP duration at the OFDM receiver, essentially causing no interference to the data portion of the OFDM symbol. The proposed approach reduces the OOB interference by tens of decibels and does not require any change in the receiver structure of legacy OFDM.

In this study, we investigate angle-of-arrival (AOA) and received signal strength (RSS) based localization methods for visible light communication (VLC) systems. We show that while AOA-based localization allows the receiver to locate itself via a least squares estimator by exploiting the directionality of light-emitting diodes (LEDs), RSS-based approach takes Lambertian pattern of LEDs into account and better deals with further improving the localization accuracy via a nonlinear least squares (NLS) estimator. In order to reduce the complexity of the NLS estimator, we develop an analytical learning rule based on the Newton-Raphson method and use the result of AOA-based localization as an initial point for the learning rule. As a benchmark, we also derive generic analytical expressions of the Cramer-Rao lower bound (CRLB) for RSS-based localization.

In this paper, we introduce a windowing technique, which provides optimal time-frequency containment and maximal adjacent channel interference (ACI) rejection for orthogonal frequency-division multiplexing (OFDM)-based systems. Instead of using a single pulse shape function for all subcarriers, multiple functions are considered in order to maximize the time-frequency containment of the OFDM waveform. The main strategy is to concentrate the spectrum of windowing functions into a given bandwidth while achieving maximum suppression in the out-of-band region. This is achieved by employing prolate-based windowing functions which give optimal spectral concentration for time-limited pulse shapes. The windowing functions are designed per-subcarrier basis in order to exploit available concentration band for each subcarrier. In addition, the proposed concept is considered for the receive filtering in the presence of ACI. It is shown that the optimal spectral concentration property also maximizes ACI rejection for OFDM receivers.

In an uncoordinated network, the link-level performance of a wireless receiver might degrade significantly due to the interference from other transmitters that share the same spectrum. As a solution, in this study, the concept of partially overlapping tones (POT) is introduced. In POT, interference energy observed at a victim receiver is mitigated by partially overlapping the individual subcarriers via an intentional carrier frequency offset between the links. It is argued that the self-interference arising due to the use of POT can be more easily addressed than the dominant other-user interference, potentially yielding higher spectral efficiencies with POT. Using a spatial Poisson point process based framework, a tractable bit error rate analysis is provided to demonstrate potential benefits emerging from POT in system-level scenarios.

In a wireless communication medium, the transmitted signal reaches to the receiver antenna after passing through multipath channel. The difference in path delays and mobility cause the transmitted signal spread both in time and frequency, resulting in inter-symbol (or adjacent block) and inter-carrier (or adjacent channel) interference, respectively. The pulse shaping and matching filters used in the transceivers also impact the level of dispersion in both time and frequency. In this study, the composite effects of wireless medium and the used filters are investigated on the equalization of multicarrier systems. For this purpose, considering a symbol-spaced tap model for the equalization, the number of effective taps in both time and frequency domains is obtained via Akaike information criterion (AIC) for different signal-to-noise ratios (SNRs). Subsequently, a method which characterizes the equalization complexity of the receiver as a function of the transmit pulse shape, communication medium, the receive filter response, and SNR is proposed.

In this paper, we propose a multi-user aware frame structure for doubly dispersive channels in order to increase both spectral efficiency and frequency spread immunity of orthogonal frequency division multiple accessing (OFDMA) based systems. Unlike the conventional OFDMA based system where the fixed cyclic prefix duration and subcarrier spacing are utilized within the frame structure considering the worst case communication channel, in the proposed approach, multiple cyclic prefix durations and subcarrier spacings are employed. In order to build the proposed frame structure, the statistics of the mobility and the range of the users are mapped to inter-carrier-interference and maximum excess delay to obtain multiple subcarrier spacings and cyclic prefix durations. As a result, better frequency spread immunity and spectral efficiency are achieved by exploiting the doubly dispersive channel characteristics of the users.

The recently proposed edge windowing technique provides a new degree of freedom between spectral efficient sidelobe suppression and controllable inter-symbol-interference (ISI) for orthogonal frequency division multiplexing (OFDM) based systems. By combining the introduced degree of freedom of edge windowing and the dependency of the channel dispersive characteristics to the distance between transmitter and receiver, ISI can be eliminated. Therefore, scheduling strategies becomes critically important for edge windowing in multiple accessing environment. In this paper, edge windowing technique is investigated along with different scheduling strategies; random scheduling, ranging based scheduling, and root mean square (RMS) delay spread based scheduling. Considering these scheduling strategies with the channel and edge windowing parameters, the performance metrics of sidelobe suppression, average error vector magnitude (EVM) on each subcarrier, and the worst case statistical characteristics of EVM are evaluated.

In a typical macrocell network, all macrocell mobile stations (mMSs) are synchronized to the macrocell base station (mBS) during the uplink. The mMSs that are closer to the mBS transmit their signals at a later time instant so that signals of all the all mMSs arrive at the mBS at the same time. However, signals of the mMSs reach at the femtocell base stations (fBSs) with different delays, which may cause interference problems for femtocell users. For orthogonal frequency division multiple access (OFDMA) based networks, interference due to delays larger than the cyclic prefix of the desired signal will appear as inter-carrier interference (ICI) and inter-symbol-interference (ISI). In this paper, statistics of the ICI power received from the mMSs at the fBSs is derived considering different locations of the fBSs in the macrocell network. The concept of zero-ICI region is introduced and its implications for coexisting macrocell/femtocell networks are presented. Theoretical findings are verified via simulation results.