ORCID Profile
0000-0002-5861-2873
Current Organisation
Monash University
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Research Topics
In Research Link Australia (RLA), "Research Topics" refer to ANZSRC FOR and SEO codes. These topics are either sourced from ANZSRC FOR and SEO codes listed in researchers' related grants or generated by a large language model (LLM) based on their publications.
Top 5 Research Topics
ANZSRC Field of Research (FoR)
Data Format | Coding and Information Theory | Wireless Communications | Communications Technologies |
ANZSRC Socio-Economic Objective (SEO)
Mobile Data Networks and Services | Network Infrastructure Equipment | Expanding Knowledge in the Information and Computing Sciences | Electronic Information Storage and Retrieval Services | Mobile Telephone Networks and Services | Communication Networks and Services not elsewhere classified | Management of Greenhouse Gas Emissions from Information and Communication Services
Related Links
Publications
Ambit-Process based Channel Model for Urban Microcellular Communication at 140 GHz
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-06-2023
DOI: 10.36227/TECHRXIV.22011110.V2
Abstract: The design and development of sub-Terahertz (THz) communication systems entail the need for new channel models that can precisely predict channel characteristics at such frequencies ( GHz) in outdoor and dynamic environments. This work proposes a novel hybrid-stochastic ultra-wideband channel model for sub-THz bands, developed within the framework of a class of spatio-temporal stochastic processes called ambit-process. The proposed model is capable of supporting bandwidths of upto 10 GHz. The spatio-temporal evolution of the ambit framework allows for a reasonably accurate and tractable characterization of the fading statistics and multipath propagation of a cellular channel with good spatial consistency. We leverage a recently proposed low-complexity ambit-process based channel simulation algorithm with necessary modifications to study key features of the outdoor sub-THz channel like associated diffused scattering, molecular absorption, spatio-temporal correlations, and consistency between the time-evolving delay and Doppler of the multipaths. Simulation results on path loss, delay spread, and channel correlation indicate that the ambit model accurately captures the typicalities of an urban microcellular sub-THz channel and agrees well with the measurement results reported in the literature.
Ambit-Process based Channel Model for Urban Microcellular Communication at 140 GHz
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-02-2023
DOI: 10.36227/TECHRXIV.22011110.V1
Abstract: The design and development of sub-Terahertz (THz) communication systems entail the need for new channel models that can precisely predict channel characteristics at such frequencies ( GHz) in outdoor and dynamic environments. This work proposes a novel hybrid-stochastic ultra-wideband channel model for sub-THz bands, developed within the framework of a class of spatio-temporal stochastic processes called ambit-process. The proposed model is capable of supporting bandwidths of upto 10 GHz. The spatio-temporal evolution of the ambit framework allows for a reasonably accurate and tractable characterization of the fading statistics and multipath propagation of a cellular channel with good spatial consistency. We leverage a recently proposed low-complexity ambit-process based channel simulation algorithm with necessary modifications to study key features of the outdoor sub-THz channel like associated diffused scattering, molecular absorption, spatio-temporal correlations, and consistency between the time-evolving delay and Doppler of the multipaths. Simulation results on path loss, delay spread, and channel correlation indicate that the ambit model accurately captures the typicalities of an urban microcellular sub-THz channel and agrees well with the measurement results reported in the literature.
Improved multiple folded successive cancellation decoder for polar codes
Publisher: IEEE
Date: 08-2014
Index Codes for the Gaussian Broadcast Channel Using Quadrature Amplitude Modulation
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2015
Line coding for differential vector signaling
Publisher: IEEE
Date: 02-2017
Signal space diversity
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-1998
DOI: 10.1109/18.681321
Optimal user pairing in downlink MU-MIMO with transmit precoding
Publisher: IEEE
Date: 04-2008
Algebraic number theory and code design for Rayleigh fading channels
Publisher: Now Publishers
Date: 2004
DOI: 10.1561/0100000003
Low Complexity MRC Detection for OTFS Receiver with Oversampling
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Performance of high-diversity multidimensional constellations
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-1998
DOI: 10.1109/18.681327
Line Codes Generated by Finite Coxeter Groups
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2019
On Fast-Decodable Space–Time Block Codes
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2009
Adaptive resource allocation for secure two-hop communication
Publisher: IEEE
Date: 04-2018
Optimal transmission strategy in full-duplex relay networks
Publisher: IEEE
Date: 11-2018
Robust Codes for 2×2 MIMO Block Fading Channels
Publisher: IEEE
Date: 06-2007
New algebraic constructions of rotated Zn-lattice constellations for the rayleigh fading channel
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2004
Multiple Folding for Successive Cancelation Decoding of Polar Codes
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2014
XY precoder for MIMO systems
Publisher: IEEE
Date: 11-2017
Modulation Diversity in Fading Channels with a Quantized Receiver
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2012
Harmonic analysis of binary functions
Publisher: IEEE
Date: 04-2015
Unitary-Precoded Single-Carrier Waveforms for High Mobility: Detection and Channel Estimation
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 28-01-2022
DOI: 10.36227/TECHRXIV.18865082
Abstract: This paper presents unitary-precoded single-carrier (USC) modulation as a family of waveforms based on multiplexing the information symbols on time domain unitary basis functions. The common property of these basis functions is that they span the entire time and frequency plane. / The recently proposed orthogonal time frequency space (OTFS) and orthogonal time sequency multiplexing (OTSM) based on discrete Fourier transform (DFT) and Walsh Hadamard transform (WHT), respectively, fall in the general framework of USC waveforms. In this work, we present channel estimation and detection methods that work for any USC waveform and numerically show that any choice of unitary precoding results in the same error performance. Lastly, we implement some USC systems and compare their performance with OFDM in a real-time indoor setting using an SDR platform. /
OTFS Performance on Static Multipath Channels
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2019
On Distance Statistics of First Arriving Multi-Paths in Indoor mm-Wave Communications
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2020
Sphere lower bound for rotated lattice constellations in fading channels
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2008
Artificial noise revisited: When Eve has more antennas than Alice
Publisher: IEEE
Date: 07-2014
Fast and Accurate Video PQoS Estimation over Wireless Networks
Publisher: Springer Science and Business Media LLC
Date: 29-04-2008
DOI: 10.1155/2008/548741
A universal lattice code decoder for fading channels
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-1999
DOI: 10.1109/18.771234
Spatial Modulation in Full-Duplex Relaying
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2016
Modulation and coding for the Gaussian collision channel
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2000
DOI: 10.1109/18.868475
Decoding probability in random linear network coding with packet losses
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2013
Orthogonal Time Sequency Multiplexing Modulation
Publisher: IEEE
Date: 29-03-2021
Practical Pulse-Shaping Waveforms for Reduced-Cyclic-Prefix OTFS
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2019
Computing the Voronoi Cell of a Lattice: The Diamond-Cutting Algorithm
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 1996
DOI: 10.1109/18.481786
Effective Diversity of OTFS Modulation
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2020
Golden space-time block coded modulation
Publisher: IEEE
Date: 05-2008
Wiretap channel with finite-rate feedback
Publisher: IEEE
Date: 04-2015
On the algebraic structure of the Silver code: A 2 × 2 perfect space-time block code
Publisher: IEEE
Date: 05-2008
Precoding by Pairing Subchannels to Increase MIMO Capacity With Discrete Input Alphabets
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2011
Polarization-Adjusted Convolutional (PAC) Codes: Sequential Decoding vs List Decoding
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2021
X-Codes: A Low Complexity Full-Rate High-Diversity Achieving Precoder for TDD MIMO Systems
Publisher: IEEE
Date: 05-2010
MIMO Precoding With X- and Y-Codes
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2011
Sensitivity improvement and carrier power reduction in direct-detection optical OFDM systems by subcarrier pairing
Publisher: The Optical Society
Date: 11-01-2012
DOI: 10.1364/OE.20.001635
Low Complexity Iterative Rake Decision Feedback Equalizer for Zero-Padded OTFS systems
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 21-01-2021
DOI: 10.36227/TECHRXIV.13246931.V2
Abstract: This paper presents a linear complexity iterative rake detector for the recently proposed orthogonal time frequency space (OTFS) modulation scheme. The basic idea is to extract and coherently combine the received multipath components of the transmitted symbols in the delay-Doppler grid using maximal ratio combining (MRC) to improve the SNR of the combined signal. We reformulate the OTFS input-output relation in simple vector form by placing guard null symbols or zero padding (ZP) in the delay-Doppler grid and exploiting the resulting circulant property of the blocks of the channel matrix. Using this vector input-output relation we propose a low complexity iterative decision feedback equalizer (DFE) based on MRC. The performance and complexity of the proposed detector favorably compares with the state of the art message passing detector. An alternative time domain MRC based detector is also proposed for even faster detection. We further propose a Gauss-Seidel based over-relaxation parameter in the rake detector to improve the performance and the convergence speed of the iterative detection. We also show how the MRC detector can be combined with outer error-correcting codes to operate as a turbo DFE scheme to further improve the error performance. / All results are compared with a baseline orthogonal frequency ision multiplexing (OFDM) scheme employing a single tap minimum mean square error (MMSE) equalizer. /
Low Complexity Iterative Rake Decision Feedback Equalizer for Zero-Padded OTFS systems
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 19-11-2020
DOI: 10.36227/TECHRXIV.13246931.V1
Abstract: This paper presents a linear complexity iterative rake detector for the recently proposed orthogonal time frequency space (OTFS) modulation scheme. The basic idea is to extract and coherently combine the received multipath components of the transmitted symbols in the delay-Doppler grid using maximal ratio combining (MRC) to improve the SNR of the combined signal. We reformulate the OTFS input-output relation in simple vector form by placing guard null symbols or zero padding (ZP) in the delay-Doppler grid and exploiting the resulting circulant property of the blocks of the channel matrix. Using this vector input-output relation we propose a low complexity iterative decision feedback equalizer (DFE) based on MRC. The performance and complexity of the proposed detector favorably compares with the state of the art message passing detector. An alternative time domain MRC based detector is also proposed for even faster detection. We further propose a Gauss-Seidel based over-relaxation parameter in the rake detector to improve the performance and the convergence speed of the iterative detection. We also show how the MRC detector can be combined with outer error-correcting codes to operate as a turbo DFE scheme to further improve the error performance. / All results are compared with a baseline orthogonal frequency ision multiplexing (OFDM) scheme employing a single tap minimum mean square error (MMSE) equalizer. /
How to Modify Polar Codes for List Decoding
Publisher: IEEE
Date: 07-2019
Repetition‐assisted decoding of polar codes
Publisher: Institution of Engineering and Technology (IET)
Date: 03-2019
DOI: 10.1049/EL.2018.6940
All-optical generation of DFT-S-OFDM superchannels using periodic sinc pulses
Publisher: The Optical Society
Date: 23-10-2014
DOI: 10.1364/OE.22.027026
Precoding with X-codes to increase capacity with discrete input alphabets
Publisher: IEEE
Date: 06-2010
OTFS Based Random Access Preamble Transmission for High Mobility Scenarios
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2020
X- and Y-Codes for MIMO precoding
Publisher: IEEE
Date: 06-2010
A word from the general and technical program co-chair
Publisher: IEEE
Date: 11-2014
Transmitter optimization and theoretical bounds for dispersion-limited optical fiber links
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2004
Optimal energy transfer in band-limited communication channels
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 1999
DOI: 10.1109/18.782126
Trellis coded modulation for informed receivers
Publisher: IEEE
Date: 05-2017
Representing group codes as permutation codes
Publisher: IEEE
Date: 1999
Capacity optimality of lattice codes in common message Gaussian broadcast channels with coded side information
Publisher: IEEE
Date: 06-2017
Algebraic lattice constellations: bounds on performance
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2006
List Viterbi Decoding of PAC Codes
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 15-01-2021
DOI: 10.36227/TECHRXIV.12619706
Abstract: Polarization-adjusted convolutional (PAC) codes are special concatenated codes in which we employ a one-to-one convolutional transform as a pre-coding step before the polar transform. In this scheme, the polar transform (as a mapper) and the successive cancellation process (as a demapper) present a synthetic vector channel to the convolutional transformation. The numerical results show that this concatenation improves the Hamming distance properties of polar codes. / In this work, we implement the parallel list Viterbi algorithm (LVA) and show how the error correction performance moves from the poor performance of the Viterbi algorithm (VA) to the superior performance of list decoding by changing the constraint length, list size, and the sorting strategy (local sorting and global sorting) in the LVA. Also, we analyze the latency of the local sorting of the paths in LVA relative to the global sorting in the list decoding and the trade-off between the sorting latency and the error correction performance. /
Subcarrier pairing for self-heterodyne OFDM
Publisher: IEEE
Date: 06-2013
A Novel Graph Expansion and a Decoding Algorithm for NB-LDPC Codes
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2020
Ambit-Process based Spatial-Wideband MIMO Channel Model for Sub-THz Urban Microcellular Communication
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-02-2023
DOI: 10.36227/TECHRXIV.21993275
Abstract: The design and development of sub-Terahertz (sub-THz) cellular systems entail the need for new channel models that can precisely predict channel characteristics beyond 100 GHz in outdoor and dynamic environments. This work proposes a novel multiple-input and multiple-output (MIMO) channel model for cellular communication, developed within the framework of a class of spatio temporal stochastic processes called ambit-process. The modeling methodology effectively captures the typicalities of sub-THz propagation like molecular absorption and scattering of the evolving multipaths while accounting for the propagation delay of electromagnetic waves across large array apertures deployed at the transmitter and the receiver. This allows for an accurate characterization of the spatial-wideband effect along with other relevant spatio-temporal attributes of the channel. Numerical simulations indicate a good level of agreement between the spectral efficiency and spatio-temporal correlation of the proposed model against a state-of-the-art stochastic Terahertz (THz) channel model and measurements reported in literature.
MIMO Self-Heterodyne OFDM
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2016
Flip-OFDM for Unipolar Communication Systems
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2012
Channel Modeling for Wireless Communications Using Ambit Processes
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2020
Low-complexity iterative detection for orthogonal time frequency space modulation
Publisher: IEEE
Date: 04-2018
How fading affects CDMA
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2001
DOI: 10.1109/49.914497
Orthogonal Time Sequency Multiplexing Modulation: Analysis and Low-Complexity Receiver Design
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2021
Layered Space-Time Index Coding
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2019
Analysis of Self-Het OFDM enhancements for 60GHz indoor RF channels
Publisher: IEEE
Date: 2013
Capacity of coded index modulation
Publisher: IEEE
Date: 06-2015
Integer-forcing MIMO linear receivers based on lattice reduction
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2013
Lattice Codes Achieve the Capacity of Common Message Gaussian Broadcast Channels With Coded Side Information
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2018
Polarization-adjusted Convolutional (PAC) Codes: Sequential Decoding vs List Decoding
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 19-01-2021
DOI: 10.36227/TECHRXIV.13580678.V1
Abstract: In the Shannon lecture at the 2019 International Symposium on Information Theory (ISIT), Arıkan proposed to employ a one-to-one convolutional transform as a pre-coding step before the polar transform. The resulting codes of this concatenation are called polarization-adjusted convolutional (PAC) codes. In this scheme, a pair of polar mapper and demapper as pre- and postprocessing devices are deployed around a memoryless channel, which provides polarized information to an outer decoder leading to improved error correction performance of the outer code. In this paper, the list decoding and sequential decoding (including Fano decoding and stack decoding) are first adapted for use to decode PAC codes. Then, to reduce the complexity of sequential decoding of PAC olar codes, we propose (i) an adaptive heuristic metric, (ii) tree search constraints for backtracking to avoid exploration of unlikely sub-paths, and (iii) tree search strategies consistent with the pattern of error occurrence in polar codes. These contribute to the reduction of the average decoding time complexity from 50% to 80%, trading with 0.05 to 0.3 dB degradation in error correction performance within FER=10^-3 range, respectively, relative to not applying the corresponding search strategies. Additionally, as an important ingredient in Fano decoding of PAC olar codes, an efficient computation method for the intermediate LLRs and partial sums is provided. This method is effective in backtracking and avoids storing the intermediate information or restarting the decoding process. Eventually, all three decoding algorithms are compared in terms of performance, complexity, and resource requirements.
Algebraic Coding for Fast Fading Channels
Publisher: Elsevier
Date: 2011
Decoding of NB-LDPC codes over Subfields
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-07-2020
DOI: 10.36227/TECHRXIV.12628718.V1
Abstract: In this paper, we present a novel method to expand a graph over a finite field into a larger one over one of / the original field’s subfields. This allows a number of different graph expansions for any given graph. / These expansions can be used in various applications, and we focus specifically on the case of decoding / NB-LDPC codes. Using the novel expanded graphs, it is possible to reduce decoding complexity of NB- / LDPC codes significantly with minimal performance losses. /
On the decay of the determinants of multiuser MIMO lattice codes
Publisher: IEEE
Date: 2010
Unitary-Precoded Single-Carrier Waveforms for High Mobility: Detection and Channel Estimation
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 28-01-2022
DOI: 10.36227/TECHRXIV.18865082.V1
Abstract: This paper presents unitary-precoded single-carrier (USC) modulation as a family of waveforms based on multiplexing the information symbols on time domain unitary basis functions. The common property of these basis functions is that they span the entire time and frequency plane. / The recently proposed orthogonal time frequency space (OTFS) and orthogonal time sequency multiplexing (OTSM) based on discrete Fourier transform (DFT) and Walsh Hadamard transform (WHT), respectively, fall in the general framework of USC waveforms. In this work, we present channel estimation and detection methods that work for any USC waveform and numerically show that any choice of unitary precoding results in the same error performance. Lastly, we implement some USC systems and compare their performance with OFDM in a real-time indoor setting using an SDR platform. /
High diversity lattices for fading channels
Publisher: IEEE
Date: 1995
Geometry based Stochastic Channel Modeling using Ambit Processes
Publisher: IEEE
Date: 05-2020
Integer space-time block codes for practical MIMO systems
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2013
Gaussian sampling based lattice decoding
Publisher: IEEE
Date: 07-2013
Practical encoders and decoders for euclidean codes from barnes-wall lattices
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2013
On the performance of golden space-time trellis coded modulation over MIMO block fading channels
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2009
Reconstruction of Multidimensional Signals From Irregular Noisy Samples
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2008
Performance of Linear Field Reconstruction Techniques With Noise and Uncertain Sensor Locations
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2008
Orthogonal Time Sequency Multiplexing Modulation: Analysis and Low-Complexity Receiver Design
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 14-06-2021
DOI: 10.36227/TECHRXIV.14404460
Abstract: This paper proposes orthogonal time sequency multiplexing (OTSM), a novel single carrier modulation scheme that places information symbols in the delay-sequency domain followed by a cascade of time- ision multiplexing (TDM) and Walsh-Hadamard sequence multiplexing. Thanks to the Walsh Hadamard transform (WHT), the modulation and demodulation do not require complex domain multiplications. For the proposed OTSM, we first derive the input-output relation in the delay-sequency domain and present a low complexity detection method taking advantage of zero-padding. We demonstrate via simulations that OTSM offers high performance gains over orthogonal frequency ision multiplexing (OFDM) and similar performance to orthogonal time frequency space (OTFS), but at lower complexity owing to WHT. Then we propose a low complexity time-domain channel estimation method. Finally, we show how to include an outer error control code and a turbo decoder to improve error performance of the coded system.
OTFS Modem SDR Implementation and Experimental Study of Receiver Impairment Effects
Publisher: IEEE
Date: 05-2019
Ray-tracing simulation of cross-road scenarios based on a stochastic model for vehicular traffic
Publisher: IEEE
Date: 09-2019
On Fast-Decodable Space-Time Block Codes
Publisher: IEEE
Date: 03-2008
Integer-forcing linear receivers: A design criterion for full-diversity STBCs
Publisher: IEEE
Date: 03-2017
Ambit-Process based Channel Model for Urban Microcellular Communication at 140 GHz
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-06-2023
DOI: 10.36227/TECHRXIV.22011110
Abstract: The design and development of sub-Terahertz (THz) communication systems entail the need for new channel models that can precisely predict channel characteristics at such frequencies ( GHz) in outdoor and dynamic environments. This work proposes a novel hybrid-stochastic ultra-wideband channel model for sub-THz bands, developed within the framework of a class of spatio-temporal stochastic processes called ambit-process. The proposed model is capable of supporting bandwidths of upto 10 GHz. The spatio-temporal evolution of the ambit framework allows for a reasonably accurate and tractable characterization of the fading statistics and multipath propagation of a cellular channel with good spatial consistency. We leverage a recently proposed low-complexity ambit-process based channel simulation algorithm with necessary modifications to study key features of the outdoor sub-THz channel like associated diffused scattering, molecular absorption, spatio-temporal correlations, and consistency between the time-evolving delay and Doppler of the multipaths. Simulation results on path loss, delay spread, and channel correlation indicate that the ambit model accurately captures the typicalities of an urban microcellular sub-THz channel and agrees well with the measurement results reported in the literature.
Construction of Barnes-Wall lattices from linear codes over rings
Publisher: IEEE
Date: 07-2012
Ambit-Process based Channel Model for Urban Microcellular Communication at 140 GHz
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
On complex LLL algorithm for integer forcing linear receivers
Publisher: IEEE
Date: 2013
Hardware implementation of a low-complexity detector for large MIMO
Publisher: IEEE
Date: 2009
Orthogonal Time Sequency Multiplexing Modulation: Analysis and Low-Complexity Receiver Design
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 14-04-2021
DOI: 10.36227/TECHRXIV.14404460.V1
Abstract: This paper proposes orthogonal time sequency multiplexing (OTSM), a novel single carrier modulation scheme that places information symbols in the delay-sequency domain followed by a cascade of time- ision multiplexing (TDM) and Walsh-Hadamard sequence multiplexing. Thanks to the Walsh Hadamard transform (WHT), the modulation and demodulation do not require complex domain multiplications. For the proposed OTSM, we first derive the input-output relation in the delay-sequency domain and present a low complexity detection method taking advantage of zero-padding. We demonstrate via simulations that OTSM offers high performance gains over orthogonal frequency ision multiplexing (OFDM) and similar performance to orthogonal time frequency space (OTFS), but at lower complexity owing to WHT. Then we propose a low complexity time-domain channel estimation method. Finally, we show how to include an outer error control code and a turbo decoder to improve error performance of the coded system.
Orthogonal Precoder for Integer-Forcing MIMO
Publisher: IEEE
Date: 07-2019
Adaptive polar coding with high order modulation for block fading channels
Publisher: IEEE
Date: 05-2017
Orthogonal Time Sequency Multiplexing Modulation: Analysis and Low-Complexity Receiver Design
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 14-06-2021
DOI: 10.36227/TECHRXIV.14404460.V2
Abstract: This paper proposes orthogonal time sequency multiplexing (OTSM), a novel single carrier modulation scheme that places information symbols in the delay-sequency domain followed by a cascade of time- ision multiplexing (TDM) and Walsh-Hadamard sequence multiplexing. Thanks to the Walsh Hadamard transform (WHT), the modulation and demodulation do not require complex domain multiplications. For the proposed OTSM, we first derive the input-output relation in the delay-sequency domain and present a low complexity detection method taking advantage of zero-padding. We demonstrate via simulations that OTSM offers high performance gains over orthogonal frequency ision multiplexing (OFDM) and similar performance to orthogonal time frequency space (OTFS), but at lower complexity owing to WHT. Then we propose a low complexity time-domain channel estimation method. Finally, we show how to include an outer error control code and a turbo decoder to improve error performance of the coded system.
Lattice Index Coding
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2015
Unshared Secret Key Cryptography: Finite constellation inputs and ideal secrecy outage
Publisher: IEEE
Date: 06-2015
Algebraic-phase scrambling sequences for code-spread code-division multiple-access
Publisher: IEEE
Date: 07-2008
Decoding of NB-LDPC codes over Subfields
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-07-2020
DOI: 10.36227/TECHRXIV.12628718
Abstract: In this paper, we present a novel method to expand a graph over a finite field into a larger one over one of / the original field’s subfields. This allows a number of different graph expansions for any given graph. / These expansions can be used in various applications, and we focus specifically on the case of decoding / NB-LDPC codes. Using the novel expanded graphs, it is possible to reduce decoding complexity of NB- / LDPC codes significantly with minimal performance losses. /
Embedded Delay-Doppler Channel Estimation for Orthogonal Time Frequency Space Modulation
Publisher: IEEE
Date: 08-2018
Decoding the golden code: a VLSI design
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2009
Efficient Decoding of Low Density Lattice Codes
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2019
A new multiple folded successive cancellation decoder for polar codes
Publisher: IEEE
Date: 11-2014
Lattice index coding for the broadcast channel
Publisher: IEEE
Date: 04-2015
Modulation diversity in fading channels with quantized receiver
Publisher: IEEE
Date: 07-2011
Optimal placement of wireless nodes for maximizing path lifetime
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2008
Cross-packing lattices for the Rician fading channel
Publisher: IEEE
Date: 04-2015
Representing group codes as permutation codes
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 1999
DOI: 10.1109/18.782174
The Golden code: A 2x2 full-rate space-time code with nonvanishing determinants
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2005
Quality of Field Reconstruction in Sensor Networks
Publisher: IEEE
Date: 2007
Towards a Distributed Caching Service at the WiFi Edge Using Wi-Cache
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2021
Adaptive Resource Allocation for Secure Two-Hop Relaying Communication
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2018
Iterative Decoding of Reed-Solomon Codes based on Non-binary Matrices
Publisher: IEEE
Date: 07-2019
On Index Coded Video Delivery at the WiFi Edge: Performance and System Design
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2022
On measures of information theoretic security
Publisher: IEEE
Date: 11-2014
Hybrid Non-Binary Repeated Polar Codes
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2022
Artificial Noise Revisited
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2015
Good Lattice Constellations for Both Rayleigh Fading and Gaussian Channels
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-1996
DOI: 10.1109/18.485720
Line-of-Sight $2 \times n_r$ MIMO With Random Antenna Orientations
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2017
Performance of rotated lattice constellations in fading channels
Publisher: IEEE
Date: 07-2006
Probability estimates for fading and wiretap channels from ideal class zeta functions
Publisher: American Institute of Mathematical Sciences (AIMS)
Date: 11-2015
Signal Reconstruction Errors in Jittered Sampling
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2009
Millimeter Wave Analog Beamforming With Low Resolution Phase Shifters for Multiuser Uplink
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2018
Signal Reconstruction in Multidimensional Sensor Fields
Publisher: IEEE
Date: 03-2008
Carrier independent localization techniques for GSM terminals
Publisher: IEEE
Date: 09-2008
Geometrically uniform differential vector signaling schemes
Publisher: IEEE
Date: 06-2017
On the robustness of algebraic STBCs to coefficient quantization
Publisher: IEEE
Date: 2012
Self-Heterodyne OFDM Transmission for Frequency Selective Channels
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2013
On data acquisition and field reconstruction in wireless sensor networks
Publisher: Kluwer Academic Publishers
Date: 2006
Decoding of binary separable Goppa codes using Berlekamp-Massey algorithm
Publisher: Institution of Engineering and Technology (IET)
Date: 1999
DOI: 10.1049/EL:19991190
High Rate Golden Space-Time Trellis Coded Modulation
Publisher: IEEE
Date: 2006
Polarization-adjusted Convolutional (PAC) Codes: Sequential Decoding vs List Decoding
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 19-01-2021
DOI: 10.36227/TECHRXIV.13580678
Abstract: In the Shannon lecture at the 2019 International Symposium on Information Theory (ISIT), Arıkan proposed to employ a one-to-one convolutional transform as a pre-coding step before the polar transform. The resulting codes of this concatenation are called polarization-adjusted convolutional (PAC) codes. In this scheme, a pair of polar mapper and demapper as pre- and postprocessing devices are deployed around a memoryless channel, which provides polarized information to an outer decoder leading to improved error correction performance of the outer code. In this paper, the list decoding and sequential decoding (including Fano decoding and stack decoding) are first adapted for use to decode PAC codes. Then, to reduce the complexity of sequential decoding of PAC olar codes, we propose (i) an adaptive heuristic metric, (ii) tree search constraints for backtracking to avoid exploration of unlikely sub-paths, and (iii) tree search strategies consistent with the pattern of error occurrence in polar codes. These contribute to the reduction of the average decoding time complexity from 50% to 80%, trading with 0.05 to 0.3 dB degradation in error correction performance within FER=10^-3 range, respectively, relative to not applying the corresponding search strategies. Additionally, as an important ingredient in Fano decoding of PAC olar codes, an efficient computation method for the intermediate LLRs and partial sums is provided. This method is effective in backtracking and avoids storing the intermediate information or restarting the decoding process. Eventually, all three decoding algorithms are compared in terms of performance, complexity, and resource requirements.
Self-coherent OFDM for wireless communications
Publisher: IEEE
Date: 06-2015
Unitary precoding for integer-forcing MIMO linear receivers
Publisher: IEEE
Date: 11-2014
Computing the Voronoi cell of a lattice: The diamond-cutting algorithm
Publisher: IEEE
Date: 1995
New algebraic constructions of rotated cubic lattice constellations for the Rayleigh fading channel
Publisher: IEEE
Date: 2003
Analog Beamforming With Low Resolution Phase Shifters
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2017
Compensation of Nonlinearities in High-Density Maginetic Recording Channels
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 1994
DOI: 10.1109/20.334299
Introduction to the issue on managing complexity in multiuser MIMO systems
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2009
On the detection of chipless RFID through signal space representation
Publisher: Springer Science and Business Media LLC
Date: 23-06-2013
Golden Space–Time Trellis Coded Modulation
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2007
Stepped List Decoding for Polar Codes
Publisher: IEEE
Date: 12-2018
Upper bound on the frame error probability of terminated trellis codes
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 1998
DOI: 10.1109/4234.658610
Coset Probability Based Majority-logic Decoding for Non-binary LDPC Codes
Publisher: IEEE
Date: 08-2019
Enabling VLSI processing blocks for MIMO-OFDM communications
Publisher: Hindawi Limited
Date: 24-03-2008
DOI: 10.1155/2008/351962
Abstract: Multi-input multi-output (MIMO) systems combined with orthogonal frequency- ision multiplexing (OFDM) gained a wide popularity in wireless applications due to the potential of providing increased channel capacity and robustness against multipath fading channels. However these advantages come at the cost of a very high processing complexity and the efficient implementation of MIMO-OFDM receivers is today a major research topic. In this paper, efficient architectures are proposed for the hardware implementation of the main building blocks of a MIMO-OFDM receiver. A sphere decoder architecture flexible to different modulation without any loss in BER performance is presented while the proposed matrix factorization implementation allows to achieve the highest throughput specified in the IEEE 802.11n standard. Finally a novel sphere decoder approach is presented, which allows for the realization of new golden space time trellis coded modulation (GST-TCM) scheme. Implementation cost and offered throughput are provided for the proposed architectures synthesized on a 0.13 CMOS standard cell technology or on advanced FPGA devices.
The ciphered autobiography of a 19(th) century Egyptologist
Publisher: Informa UK Limited
Date: 07-1998
Ambit-Process based Spatial-Wideband MIMO Channel Model for Sub-THz Urban Microcellular Communication
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Optimal Power Allocation Strategies in Two-Hop X-Duplex Relay Channel
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2018
A novel approach in the detection of chipless RFID
Publisher: IGI Global
Date: 2012
DOI: 10.4018/978-1-4666-1616-5.CH011
Abstract: This chapter presents a different perspective on the chipless RFID system where the chipless RFID detection problem is viewed in terms of a digital communication point of view. A novel mathematical model is presented, and a novel approach to detection is formulated based on the model. The chipless RFID tag frequency signatures are visualized as points in a signal space. Although data bits are stored in the tags using unconventional techniques, the proposed model enables the detection of these data bits through conventional robust detection methods. Through simulations it is shown that the proposed detection method has better performance compared to contemporary detection approaches.
Orthogonal Time Sequency Multiplexing Modulation
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 21-01-2021
DOI: 10.36227/TECHRXIV.13580201
Abstract: This paper proposes i orthogonal time sequency multiplexing /i (OTSM), a novel single carrier modulation scheme based on the well known Walsh-Hadamard transform (WHT) combined with row-column interleaving, and zero padding (ZP) between blocks in the time-domain. The information symbols in OTSM are multiplexed in the delay and sequency domain using a cascade of time- ision and Walsh-Hadamard (sequency) multiplexing. By using the WHT for transmission and reception, the modulation and demodulation steps do not require any complex multiplications. We then propose two low-complexity detectors: (i) a simpler non-iterative detector based on a single tap minimum mean square time-frequency domain equalizer and (ii) an iterative time-domain detector. We demonstrate, via numerical simulations, that the proposed modulation scheme offers high performance gains over orthogonal frequency ision multiplexing (OFDM) and exhibits the same performance of orthogonal time frequency space (OTFS) modulation, but with lower complexity. In proposing OTSM, along with simple detection schemes, we offer the lowest complexity solution to achieving reliable communication in high mobility wireless channels, as compared to the available schemes published so far in the literature.
Full diversity unitary precoded integer-forcing
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2015
On ℤ4- and ℤ9-linear lifts of the Golay codes
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 1999
DOI: 10.1109/18.796396
Low-Complexity Linear Diversity-Combining Detector for MIMO-OTFS
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2022
New error correcting codes for informed receivers
Publisher: IEEE
Date: 07-2016
A VLSI decoder for the Golden code
Publisher: IEEE
Date: 12-2006
List Viterbi Decoding of PAC Codes
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2021
Interference Cancellation and Iterative Detection for Orthogonal Time Frequency Space Modulation
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2018
RQ precoding for the cooperative broadcast channel
Publisher: IEEE
Date: 10-2009
Efficient Partial Rewind of Successive Cancellation-Based Decoders for Polar Codes
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2022
Improved List Decoding of Polar Codes by Shifted-pruning
Publisher: IEEE
Date: 08-2019
Low Complexity Precoding and Detection in Multi-User Massive MIMO OTFS Downlink
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2021
Diffraction of a plane wave by a strip grating
Publisher: Informa UK Limited
Date: 07-1990
The impact of quasi-equally spaced sensor layouts on field reconstruction
Publisher: IEEE
Date: 04-2007
Approximating the error probability for the independent Rayleigh fading channel
Publisher: IEEE
Date: 2005
Phase precoded compute-and-forward with partial feedback
Publisher: IEEE
Date: 06-2014
An efficient successive cancellation polar decoder based on new folding approaches
Publisher: IEEE
Date: 10-2017
Orthogonal Time Sequency Multiplexing Modulation
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 21-01-2021
DOI: 10.36227/TECHRXIV.13580201.V2
Abstract: This paper proposes i orthogonal time sequency multiplexing /i (OTSM), a novel single carrier modulation scheme based on the well known Walsh-Hadamard transform (WHT) combined with row-column interleaving, and zero padding (ZP) between blocks in the time-domain. The information symbols in OTSM are multiplexed in the delay and sequency domain using a cascade of time- ision and Walsh-Hadamard (sequency) multiplexing. By using the WHT for transmission and reception, the modulation and demodulation steps do not require any complex multiplications. We then propose two low-complexity detectors: (i) a simpler non-iterative detector based on a single tap minimum mean square time-frequency domain equalizer and (ii) an iterative time-domain detector. We demonstrate, via numerical simulations, that the proposed modulation scheme offers high performance gains over orthogonal frequency ision multiplexing (OFDM) and exhibits the same performance of orthogonal time frequency space (OTFS) modulation, but with lower complexity. In proposing OTSM, along with simple detection schemes, we offer the lowest complexity solution to achieving reliable communication in high mobility wireless channels, as compared to the available schemes published so far in the literature.
SC List-Flip Decoding of Polar Codes by Shifted Pruning: A General Approach
Publisher: MDPI AG
Date: 29-08-2022
DOI: 10.3390/E24091210
Abstract: In the successive cancellation (SC) list decoding, the tree pruning operation retains the L best paths with respect to a metric at every decoding step. However, the correct path might be among the L worst paths due to the imposed penalties. In this case, the correct path is pruned and the decoding process fails. shifted pruning (SP) scheme can recover the correct path by additional decoding attempts when decoding fails, in which the pruning window is shifted by κ≤L paths over certain bit positions. A special case of the shifted pruning scheme where κ=L is known as SCL-flip decoding, which was independently proposed in 2019. In this work, a new metric that performs better in particular for medium and long codes is proposed, and nested shift-pruning schemes are suggested for improving the average complexity.
Orthogonal Time Sequency Multiplexing Modulation
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 19-01-2021
DOI: 10.36227/TECHRXIV.13580201.V1
Abstract: This paper proposes i orthogonal time sequency multiplexing /i (OTSM), a novel single carrier modulation scheme based on the well known Walsh-Hadamard transform (WHT) combined with row-column interleaving, and zero padding (ZP) between blocks in the time-domain. The information symbols in OTSM are multiplexed in the delay and sequency domain using a cascade of time- ision and Walsh-Hadamard (sequency) multiplexing. By using the WHT for transmission and reception, the modulation and demodulation steps do not require any complex multiplications. We then propose two low-complexity detectors: (i) a simpler non-iterative detector based on a single tap minimum mean square time-frequency domain equalizer and (ii) an iterative time-domain detector. We demonstrate, via numerical simulations, that the proposed modulation scheme offers high performance gains over orthogonal frequency ision multiplexing (OFDM) and exhibits the same performance of orthogonal time frequency space (OTFS) modulation, but with lower complexity. In proposing OTSM, along with simple detection schemes, we offer the lowest complexity solution to achieving reliable communication in high mobility wireless channels, as compared to the available schemes published so far in the literature.
Asymptotic Analysis of Multidimensional Jittered Sampling
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2010
On the Formation of Min-weight Codewords of Polar/PAC Codes and Its Applications
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
X-Codes: A low complexity full-rate high-diversity achieving precoder for TDD MIMO systems
Publisher: IEEE
Date: 05-2010
Fast and Accurate PQoS Estimation over 802.11g Wireless Network
Publisher: IEEE
Date: 2008
DOI: 10.1109/ICC.2008.56
Unshared Secret Key Cryptography
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2014
A Space-Time Block Coded Multiuser MIMO Downlink Transmission Scheme
Publisher: IEEE
Date: 07-2006
Orthogonal time frequency space (OTFS) modulation based radar system
Publisher: IEEE
Date: 04-2019
Performance of wideband CDMA systems supporting multimedia traffic
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2001
DOI: 10.1109/4234.929603
Low Complexity Iterative Rake Decision Feedback Equalizer for Zero-Padded OTFS Systems
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2020
Polar Codes for Block Fading Channels
Publisher: IEEE
Date: 03-2017
Permutation modulation for fading channels
Publisher: IEEE
Date: 2003
The impact of quasi-equally spaced sensor layouts on field reconstruction
Publisher: ACM Press
Date: 2007
The Two-Modular Fourier Transform of Binary Functions
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2016
On quasi-equally spaced sampling in wireless sensor networks
Publisher: IEEE
Date: 09-2008
Full-rate integer space-time block codes for 2×2 MIMO channels
Publisher: IEEE
Date: 06-2013
The impact of quasi-equally spaced sensor topologies on signal reconstruction
Publisher: Association for Computing Machinery (ACM)
Date: 02-2010
Abstract: A wireless sensor network with randomly deployed nodes can be used to provide an irregular s ling of a physical field of interest. We assume that a sink node collects the data gathered by the sensors and uses a linear filter for the reconstruction of a bandlimited scalar field defined over a d -dimensional domain. Sensors' locations are assumed to be known at the sink node, up to a certain position error. We then take the mean square error (MSE) of the reconstructed field as performance metric, and evaluate the effect of both uniform and quasi-equally spaced sensor layouts on the quality of the reconstructed field. We define a parameter that provides a measure of the regularity of the sensors deployment, and, through asymptotic analysis, we derive the MSE in the case of different sensor spatial distributions. For two of them, an approximate closed form expression is obtained. We validate our analysis through numerical results, and we show that an excellent match exists between analysis and simulation even for a small number of sensors.
On ℤ4 - and ℤ9 -linear lifts of the Golay codes
Publisher: IEEE
Date: 1999
Algebraic multiuser space-time block codes for 2 × 2 MIMO
Publisher: IEEE
Date: 09-2008
Low Complexity Iterative Rake Decision Feedback Equalizer for Zero-Padded OTFS systems
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 21-01-2021
DOI: 10.36227/TECHRXIV.13246931
Abstract: This paper presents a linear complexity iterative rake detector for the recently proposed orthogonal time frequency space (OTFS) modulation scheme. The basic idea is to extract and coherently combine the received multipath components of the transmitted symbols in the delay-Doppler grid using maximal ratio combining (MRC) to improve the SNR of the combined signal. We reformulate the OTFS input-output relation in simple vector form by placing guard null symbols or zero padding (ZP) in the delay-Doppler grid and exploiting the resulting circulant property of the blocks of the channel matrix. Using this vector input-output relation we propose a low complexity iterative decision feedback equalizer (DFE) based on MRC. The performance and complexity of the proposed detector favorably compares with the state of the art message passing detector. An alternative time domain MRC based detector is also proposed for even faster detection. We further propose a Gauss-Seidel based over-relaxation parameter in the rake detector to improve the performance and the convergence speed of the iterative detection. We also show how the MRC detector can be combined with outer error-correcting codes to operate as a turbo DFE scheme to further improve the error performance. / All results are compared with a baseline orthogonal frequency ision multiplexing (OFDM) scheme employing a single tap minimum mean square error (MMSE) equalizer. /
Flip-OFDM for optical wireless communications
Publisher: IEEE
Date: 10-2011
Repair Schemes with Optimal I/O Costs for Full-Length Reed-Solomon Codes with Two Parities
Publisher: IEEE
Date: 11-2018
Algebraic Multiuser Space–Time Block Codes for a 2 $\times$ 2 MIMO
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2009
Steepest Gradient-Based Orthogonal Precoder for Integer-Forcing MIMO
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2020
Unshared secret key cryptography
Publisher: ETH Zurich
Date: 2014
Pulse shape optimization in dispersion-limited direct detection optical fiber links
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2003
Layered Space- Time Index Coding
Publisher: IEEE
Date: 06-2018
Decoding the golden space-time trellis coded modulation
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2008
Unshared secret key cryptography: Achieving Shannon's ideal secrecy and perfect secrecy
Publisher: IEEE
Date: 11-2014
Guaranteeing Positive Secrecy Capacity for MIMOME Wiretap Channels With Finite-Rate Feedback Using Artificial Noise
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2015
Algebraic multiuser space-frequency block codes
Publisher: IEEE
Date: 08-2008
Polar Coded Repetition
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2022
Folded tree maximum-likelihood decoder for Kronecker product-based codes
Publisher: IEEE
Date: 10-2013
Significance-Test Based Blind Detection for 5G
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2022
Turbo code at 0.03 dB from capacity limit
Publisher: IEEE
Date: 2002
Large Kernel Polar Codes With Efficient Window Decoding
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2020
Performance of component interleaved signal sets for fading channels
Publisher: Institution of Engineering and Technology (IET)
Date: 1996
DOI: 10.1049/EL:19960816
Practical Secrecy using Artificial Noise
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2013
Error control of line codes generated by finite coxeter groups
Publisher: IEEE
Date: 02-2018
Golden space-time block-coded modulation
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2009
On the I/O Costs in Repairing Short-Length Reed-Solomon Codes
Publisher: IEEE
Date: 07-2019
ALGEBRAIC DECODING OF THE TERNARY (11, 6, 5) GOLAY CODE
Publisher: Institution of Engineering and Technology (IET)
Date: 1992
DOI: 10.1049/EL:19921295
Perfect space-time block codes
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2006
Joint optimization scheme and sum constellation distribution for multi-user Gaussian multiple access channels with finite input constellations
Publisher: IEEE
Date: 2016
Signal space representation of chipless RFID tag frequency signatures
Publisher: IEEE
Date: 12-2011
Algebraic Multiuser Space-Frequency Block Codes
Publisher: IEEE
Date: 08-2008
Software defined radio implementation of a two-way relay network with digital network coding
Publisher: IEEE
Date: 02-2014
LDPC-Staircase Codes for Soft Decision Decoding
Publisher: IEEE
Date: 05-2020
Convolutional Tanner Structures for Non-Ergodic Wireless Channels
Publisher: IEEE
Date: 07-2008
New Space–Time Code Constructions for Two-User Multiple Access Channels
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2009
Applications of the Golden Code
Publisher: IEEE
Date: 2007
Implementation of a two-way relay network with compute-and-forward in GNU Radio
Publisher: Wiley
Date: 07-09-2016
DOI: 10.1002/ETT.2984
List Viterbi Decoding of PAC Codes
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-07-2020
DOI: 10.36227/TECHRXIV.12619706.V1
Abstract: Polarization-adjusted convolutional (PAC) codes are special concatenated codes in which we employ a one-to-one convolutional transform as a pre-coding step before the polar transform. In this scheme, the polar transform (as a mapper) and the successive cancellation process (as a demapper) present a synthetic vector channel to the convolutional transformation. The numerical results show that this concatenation improves the Hamming distance properties of polar codes. / In this work, we implement the parallel list Viterbi algorithm (LVA) and show how the error correction performance moves from the poor performance of the Viterbi algorithm (VA) to the superior performance of list decoding by changing the constraint length, list size, and the sorting strategy (local sorting and global sorting) in the LVA. Also, we analyze the latency of the local sorting of the paths in LVA relative to the global sorting in the list decoding and the trade-off between the sorting latency and the error correction performance. /
List Viterbi Decoding of PAC Codes
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 15-01-2021
DOI: 10.36227/TECHRXIV.12619706.V2
Abstract: Polarization-adjusted convolutional (PAC) codes are special concatenated codes in which we employ a one-to-one convolutional transform as a pre-coding step before the polar transform. In this scheme, the polar transform (as a mapper) and the successive cancellation process (as a demapper) present a synthetic vector channel to the convolutional transformation. The numerical results show that this concatenation improves the Hamming distance properties of polar codes. / In this work, we implement the parallel list Viterbi algorithm (LVA) and show how the error correction performance moves from the poor performance of the Viterbi algorithm (VA) to the superior performance of list decoding by changing the constraint length, list size, and the sorting strategy (local sorting and global sorting) in the LVA. Also, we analyze the latency of the local sorting of the paths in LVA relative to the global sorting in the list decoding and the trade-off between the sorting latency and the error correction performance. /
On the detection of frequency-spectra-based chipless RFID using UWB impulsed interrogation
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2012
CDMA with fading: Effective bandwidth and spreading-coding tradeoff
Publisher: IEEE
Date: 2000
Quantization of binary input DMC at optimal mutual information using constrained shortest path problem
Publisher: IEEE
Date: 04-2015
Efficient Algorithms for Systematic Polar Encoding
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2016
Folded successive cancelation decoding of polar codes
Publisher: IEEE
Date: 02-2014
On the capacity of the Gaussian mixture channel under average and peak power constraints
Publisher: IEEE
Date: 04-2015
Permutation Codes
Publisher: Wiley
Date: 15-04-2003
DOI: 10.1002/0471219282.EOT378
Abstract: Permutation codes are special spherical codes designed for the bandlimited Gaussian channel. A Variant I permutation code is the set of codewords obtained by taking all permutations of an initial vector in the n ‐dimensional Euclidean space. A Variant II permutation code is the set of codewords obtained by taking all permutations and sign changes of the components of an initial vector in the n ‐dimensional Euclidean space. These codes may be attractive because of their simple maximum likelihood decoding algorithm.
General I/O Relations and Low-Complexity Universal MRC Detection for All OTFS Variants
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Hardware implementation of a low-complexity detector for large mimo
Publisher: IEEE
Date: 05-2009
On parameter estimation of the envelope Gaussian mixture model
Publisher: IEEE
Date: 02-2014
Ambit-Process based Spatial-Wideband MIMO Channel Model for Sub-THz Urban Microcellular Communication
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-02-2023
DOI: 10.36227/TECHRXIV.21993275.V1
Abstract: The design and development of sub-Terahertz (sub-THz) cellular systems entail the need for new channel models that can precisely predict channel characteristics beyond 100 GHz in outdoor and dynamic environments. This work proposes a novel multiple-input and multiple-output (MIMO) channel model for cellular communication, developed within the framework of a class of spatio temporal stochastic processes called ambit-process. The modeling methodology effectively captures the typicalities of sub-THz propagation like molecular absorption and scattering of the evolving multipaths while accounting for the propagation delay of electromagnetic waves across large array apertures deployed at the transmitter and the receiver. This allows for an accurate characterization of the spatial-wideband effect along with other relevant spatio-temporal attributes of the channel. Numerical simulations indicate a good level of agreement between the spectral efficiency and spatio-temporal correlation of the proposed model against a state-of-the-art stochastic Terahertz (THz) channel model and measurements reported in literature.
Low Complexity Iterative Rake Detector for Orthogonal Time Frequency Space Modulation
Publisher: IEEE
Date: 05-2020
Related Organisations
Related Funding Activities
Discovery Projects - Grant ID: DP200100731
Start Date: 12-2020
End Date: 06-2024
Amount: $420,000.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP130100103
Start Date: 2013
End Date: 03-2017
Amount: $330,000.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP130100336
Start Date: 2013
End Date: 10-2016
Amount: $270,000.00
Funder: Australian Research Council
View Funded ActivityLinkage Projects - Grant ID: LP160100002
Start Date: 11-2016
End Date: 12-2018
Amount: $345,000.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP160101077
Start Date: 06-2016
End Date: 12-2019
Amount: $310,000.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP200100096
Start Date: 07-2020
End Date: 06-2024
Amount: $487,000.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP160100528
Start Date: 06-2016
End Date: 12-2019
Amount: $335,000.00
Funder: Australian Research Council
View Funded Activity