Pub Date : 2021-07-27DOI: 10.1109/NCC52529.2021.9530078
Shikha Baghel, S. Prasanna, P. Guha
Shouted speech detection is an essential preprocessing task in many conventional speech processing systems. Mostly, shouted speech has been studied in terms of the characterization of vocal tract and excitation source features. Previous works have also established the significance of voiced segments in shouted speech detection. This work posits that a significant emphasis is given to a portion of the voiced segments during shouted speech production. These emphasized voiced regions have significant energy. This work analyzes the effect of high-energy voiced segments on shouted speech detection. Moreover, fundamental frequency is a crucial characteristic of both shouted speech and speaker gender. Authors believe that gender has a significant effect on shouted speech detection. Therefore, the present work also studies the impact of gender on the current task. The classification between normal and shouted speech is performed using a DNN based classifier. A statistical significance test of the features extracted from high-energy voiced segments is also performed. The results support the claim that high-energy voiced segments carry highly discriminating information. Additionally, classification results of gender experiments show that gender has a notable effect on shouted speech detection.
{"title":"Effect of High-Energy Voiced Speech Segments and Speaker Gender on Shouted Speech Detection","authors":"Shikha Baghel, S. Prasanna, P. Guha","doi":"10.1109/NCC52529.2021.9530078","DOIUrl":"https://doi.org/10.1109/NCC52529.2021.9530078","url":null,"abstract":"Shouted speech detection is an essential preprocessing task in many conventional speech processing systems. Mostly, shouted speech has been studied in terms of the characterization of vocal tract and excitation source features. Previous works have also established the significance of voiced segments in shouted speech detection. This work posits that a significant emphasis is given to a portion of the voiced segments during shouted speech production. These emphasized voiced regions have significant energy. This work analyzes the effect of high-energy voiced segments on shouted speech detection. Moreover, fundamental frequency is a crucial characteristic of both shouted speech and speaker gender. Authors believe that gender has a significant effect on shouted speech detection. Therefore, the present work also studies the impact of gender on the current task. The classification between normal and shouted speech is performed using a DNN based classifier. A statistical significance test of the features extracted from high-energy voiced segments is also performed. The results support the claim that high-energy voiced segments carry highly discriminating information. Additionally, classification results of gender experiments show that gender has a notable effect on shouted speech detection.","PeriodicalId":414087,"journal":{"name":"2021 National Conference on Communications (NCC)","volume":"399 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133641899","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-27DOI: 10.1109/NCC52529.2021.9530109
Lalhruaizela Chhangte, Pramey Singh, D. Manjunath, N. Karamchandani
Fetching different parts of the same content (file) simultaneously through multiple network paths has been found to improve content delivery. There are several application layer programs that use this technique to improve the perceived performance at the end users. However, these applications use multiple sockets (multiple connections) at the transport layer, which has several disadvantages. Also, the existing transport layer protocols that allow content delivery over multiple network paths over a single transport layer connection (e.g., MPTCP) are limited to content delivery from a single source. With the availability of content across distributed content servers, there is a need for a transport layer protocol that provides the ability to deliver content from these distributed sources over a single transport layer connection. In this paper, we design and implement a multi-source transport control protocol (MSTCP) that can be used to deliver content from a distributed source to a client application over a single transport layer connection. A prototype implementation and preliminary performance measures showing the effectiveness of MSTCP are also presented.
{"title":"Multi-source TCP (MSTCP): A transport protocol for distributed content delivery","authors":"Lalhruaizela Chhangte, Pramey Singh, D. Manjunath, N. Karamchandani","doi":"10.1109/NCC52529.2021.9530109","DOIUrl":"https://doi.org/10.1109/NCC52529.2021.9530109","url":null,"abstract":"Fetching different parts of the same content (file) simultaneously through multiple network paths has been found to improve content delivery. There are several application layer programs that use this technique to improve the perceived performance at the end users. However, these applications use multiple sockets (multiple connections) at the transport layer, which has several disadvantages. Also, the existing transport layer protocols that allow content delivery over multiple network paths over a single transport layer connection (e.g., MPTCP) are limited to content delivery from a single source. With the availability of content across distributed content servers, there is a need for a transport layer protocol that provides the ability to deliver content from these distributed sources over a single transport layer connection. In this paper, we design and implement a multi-source transport control protocol (MSTCP) that can be used to deliver content from a distributed source to a client application over a single transport layer connection. A prototype implementation and preliminary performance measures showing the effectiveness of MSTCP are also presented.","PeriodicalId":414087,"journal":{"name":"2021 National Conference on Communications (NCC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134200328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-27DOI: 10.1109/NCC52529.2021.9530169
P. M., M. R., Abhinav Kumar, K. Kuchi
The gNodeB (gNB) in 5G-New Radio (5G-NR) is capable of beamforming and spatial multiplexing the users to achieve a multi-fold increase in the network capacity. With multiple active beams and the possibility of varying payload sizes, the resource allocation algorithm should optimally utilize the resources in time, frequency, and space. Otherwise, the multifold increase expected from the massive number of antennae will not be realized in practice. Further, in the 5G-NR downlink, each payload transmitted in the shared channel has an associated payload in the control channel. Thus, to have optimal resource utilization, the gNB should simultaneously consider the control and the shared channel payloads while allocating resources. Unlike the 4G-Long Term Evolution (4G-LTE), both control channel and shared channel support beamforming in 5G-NR. Hence, when the gNB uses the existing 4G-LTE algorithms for 5G-NR, they do not achieve the optimal resource allocation. Motivated by this, we propose a joint control and shared channel allocation for 5G-NR downlink that maximizes the sum-throughput while ensuring fairness in the allocation. We formulate this proposed resource allocation as an integer linear program. We also present low-complexity sub-optimal and approximation algorithms due to their practical usefulness. We then evaluate the proposed algorithms using system-level simulations and show that they significantly outperform the baseline algorithm.
{"title":"Downlink Resource Allocation for 5G-NR Massive MIMO Systems","authors":"P. M., M. R., Abhinav Kumar, K. Kuchi","doi":"10.1109/NCC52529.2021.9530169","DOIUrl":"https://doi.org/10.1109/NCC52529.2021.9530169","url":null,"abstract":"The gNodeB (gNB) in 5G-New Radio (5G-NR) is capable of beamforming and spatial multiplexing the users to achieve a multi-fold increase in the network capacity. With multiple active beams and the possibility of varying payload sizes, the resource allocation algorithm should optimally utilize the resources in time, frequency, and space. Otherwise, the multifold increase expected from the massive number of antennae will not be realized in practice. Further, in the 5G-NR downlink, each payload transmitted in the shared channel has an associated payload in the control channel. Thus, to have optimal resource utilization, the gNB should simultaneously consider the control and the shared channel payloads while allocating resources. Unlike the 4G-Long Term Evolution (4G-LTE), both control channel and shared channel support beamforming in 5G-NR. Hence, when the gNB uses the existing 4G-LTE algorithms for 5G-NR, they do not achieve the optimal resource allocation. Motivated by this, we propose a joint control and shared channel allocation for 5G-NR downlink that maximizes the sum-throughput while ensuring fairness in the allocation. We formulate this proposed resource allocation as an integer linear program. We also present low-complexity sub-optimal and approximation algorithms due to their practical usefulness. We then evaluate the proposed algorithms using system-level simulations and show that they significantly outperform the baseline algorithm.","PeriodicalId":414087,"journal":{"name":"2021 National Conference on Communications (NCC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134360498","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-27DOI: 10.1109/NCC52529.2021.9530039
S. Agarwal, Shubham Pandey
Ultra-reliable low-latency communication (URLLC), one of the key component of 5G, provides a set of features required to support mission-critical applications. Slotted ALOHA is one of the most popular mechanism to share a channel among multiple users. However, slotted ALOHA cannot meet high reliability requirements of URLLC when large number of users are present in the network. In this paper, we propose a preferential medium access control scheme to match the high reliability requirement of URLLC. It is ensured by dedicating every Kth slot exclusively for URLLC transmission. We analytically obtain the packet delay distribution and reliability of both the URLLC and regular packets. An optimization problem is framed to maximize the reliability of regular packets subject to meeting the URLLC reliability constraints. Extensive simulations indicate that our proposed $K$-preferential S-ALOHA protocol can meet the URLLC requirements even when the network traffic is high.
{"title":"K-Preferential Slotted ALOHA for Ultra Reliable Low Latency Communications","authors":"S. Agarwal, Shubham Pandey","doi":"10.1109/NCC52529.2021.9530039","DOIUrl":"https://doi.org/10.1109/NCC52529.2021.9530039","url":null,"abstract":"Ultra-reliable low-latency communication (URLLC), one of the key component of 5G, provides a set of features required to support mission-critical applications. Slotted ALOHA is one of the most popular mechanism to share a channel among multiple users. However, slotted ALOHA cannot meet high reliability requirements of URLLC when large number of users are present in the network. In this paper, we propose a preferential medium access control scheme to match the high reliability requirement of URLLC. It is ensured by dedicating every Kth slot exclusively for URLLC transmission. We analytically obtain the packet delay distribution and reliability of both the URLLC and regular packets. An optimization problem is framed to maximize the reliability of regular packets subject to meeting the URLLC reliability constraints. Extensive simulations indicate that our proposed $K$-preferential S-ALOHA protocol can meet the URLLC requirements even when the network traffic is high.","PeriodicalId":414087,"journal":{"name":"2021 National Conference on Communications (NCC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134550018","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-27DOI: 10.1109/NCC52529.2021.9530190
Anhad Bhati, S. R. Pillai, R. Vaze
An optimal control problem with heterogeneous servers to minimize the average age of information (AoI) is considered. Each server maintains a separate queue, and each packet arriving to the system is randomly routed to one of the servers. Assuming Poisson arrivals and exponentially distributed service times, we first derive an exact expression of the average AoI for two heterogeneous servers. Next, to solve for the optimal average AoI, a close approximation is derived, called the approximate AoI, this is shown to be useful for multi-server systems as well. We show that for the optimal approximate AoI, server utilization (ratio of arrival rate and service rate) for each server should be same as the optimal server utilization with a single server queue. For two identical servers, it is shown that the average AoI is approximately 5/8 times the average AoI of a single server. Furthermore, the average AoI is shown to decrease considerably with the addition of more servers to the system.
{"title":"On the Age of Information of a Queuing System with Heterogeneous Servers","authors":"Anhad Bhati, S. R. Pillai, R. Vaze","doi":"10.1109/NCC52529.2021.9530190","DOIUrl":"https://doi.org/10.1109/NCC52529.2021.9530190","url":null,"abstract":"An optimal control problem with heterogeneous servers to minimize the average age of information (AoI) is considered. Each server maintains a separate queue, and each packet arriving to the system is randomly routed to one of the servers. Assuming Poisson arrivals and exponentially distributed service times, we first derive an exact expression of the average AoI for two heterogeneous servers. Next, to solve for the optimal average AoI, a close approximation is derived, called the approximate AoI, this is shown to be useful for multi-server systems as well. We show that for the optimal approximate AoI, server utilization (ratio of arrival rate and service rate) for each server should be same as the optimal server utilization with a single server queue. For two identical servers, it is shown that the average AoI is approximately 5/8 times the average AoI of a single server. Furthermore, the average AoI is shown to decrease considerably with the addition of more servers to the system.","PeriodicalId":414087,"journal":{"name":"2021 National Conference on Communications (NCC)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132937604","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-27DOI: 10.1109/NCC52529.2021.9530140
Antony V. Mampilly, S. Bhashyam
We propose a new decode-and-forward (DF) protocol called Greedy Successive Relaying (GSR) protocol for the M-relay multicarrier diamond relay channel. We consider the diamond channel with half-duplex relays. The GSR protocol uses two states and the relays are partitioned into two sets, A and B. In the first state of the GSR protocol, the relays in A will receive messages from the source while the relays in B will transmit messages to the destination. In the second state, the role of the relays will be reversed i.e. the relays in A will be transmitting to the destination while the relays in B will be receiving from the source. The GSR protocol takes advantage of:(1) successive relaying to overcome the half-duplex limitation, and (2) greedy subcarrier allocation across relays to exploit the available diversity from all the relays. The proposed GSR protocol performs significantly better than the existing protocols. Furthermore, under a Rayleigh fading model, the gap from the cutset bound is also observed to be bounded at high power.
{"title":"Greedy Successive Relaying for the Multicarrier Diamond Relay Channel","authors":"Antony V. Mampilly, S. Bhashyam","doi":"10.1109/NCC52529.2021.9530140","DOIUrl":"https://doi.org/10.1109/NCC52529.2021.9530140","url":null,"abstract":"We propose a new decode-and-forward (DF) protocol called Greedy Successive Relaying (GSR) protocol for the M-relay multicarrier diamond relay channel. We consider the diamond channel with half-duplex relays. The GSR protocol uses two states and the relays are partitioned into two sets, A and B. In the first state of the GSR protocol, the relays in A will receive messages from the source while the relays in B will transmit messages to the destination. In the second state, the role of the relays will be reversed i.e. the relays in A will be transmitting to the destination while the relays in B will be receiving from the source. The GSR protocol takes advantage of:(1) successive relaying to overcome the half-duplex limitation, and (2) greedy subcarrier allocation across relays to exploit the available diversity from all the relays. The proposed GSR protocol performs significantly better than the existing protocols. Furthermore, under a Rayleigh fading model, the gap from the cutset bound is also observed to be bounded at high power.","PeriodicalId":414087,"journal":{"name":"2021 National Conference on Communications (NCC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133108019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-27DOI: 10.1109/NCC52529.2021.9530195
Brijesh Soni, Dhaval K. Patel, Sagar Kavaiya, M. Hasna, M. López-Benítez
In limited space scenarios, the antennas in the multiantenna cognitive radio (CR) system are closely spaced and often experience correlation among them. In this work, the secrecy performance of correlated multiantenna CR receiver over Nakagami-m fading channels with imperfect channel state information is studied and analyzed. We consider the underlay CR paradigm wherein Alice in the secondary network communicates with Bob while Eve tries to overhear the communication. We also consider that the antennas at Bob and Eve are closely spaced and thus uniformly correlated. To this extent, we derive the analytical expressions for the first and second order secrecy measures like secrecy outage probability, average secrecy outage rate & average secrecy outage duration, respectively for the CR receiver. Moreover, in order to gain insights at high SNR, asymptotic analysis of secrecy outage probability is derived, thus obtaining the secrecy diversity gain of order LD (i.e., the number of antennas at Bob). Monte Carlo simulations are carried out to validate the proposed analytical framework.
{"title":"On Physical Layer Security of Correlated Multiantenna Cognitive Radio Receivers","authors":"Brijesh Soni, Dhaval K. Patel, Sagar Kavaiya, M. Hasna, M. López-Benítez","doi":"10.1109/NCC52529.2021.9530195","DOIUrl":"https://doi.org/10.1109/NCC52529.2021.9530195","url":null,"abstract":"In limited space scenarios, the antennas in the multiantenna cognitive radio (CR) system are closely spaced and often experience correlation among them. In this work, the secrecy performance of correlated multiantenna CR receiver over Nakagami-m fading channels with imperfect channel state information is studied and analyzed. We consider the underlay CR paradigm wherein Alice in the secondary network communicates with Bob while Eve tries to overhear the communication. We also consider that the antennas at Bob and Eve are closely spaced and thus uniformly correlated. To this extent, we derive the analytical expressions for the first and second order secrecy measures like secrecy outage probability, average secrecy outage rate & average secrecy outage duration, respectively for the CR receiver. Moreover, in order to gain insights at high SNR, asymptotic analysis of secrecy outage probability is derived, thus obtaining the secrecy diversity gain of order LD (i.e., the number of antennas at Bob). Monte Carlo simulations are carried out to validate the proposed analytical framework.","PeriodicalId":414087,"journal":{"name":"2021 National Conference on Communications (NCC)","volume":"268 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116066115","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-27DOI: 10.1109/NCC52529.2021.9530187
Y. Vasavada, Naitik N Parekh, Aarushi Dhami, C. Prakash
This paper develops a blind single-user beamforming algorithm for partially-connected hybrid analog-digital (HAD) antenna arrays operating at millimeter wave (mmWave) frequencies. The proposed scheme is optimal and computationally efficient — it is shown to converge to the optimal eigenvector beamformer without requiring an explicit eigenvector decomposition (EVD) of the received signal's correlation matrix. The Direction of Arrival (DoA) is estimated using the Fast Fourier Transform (FFT) of the digitally-formed beam weight vector and it is used to continually update the analog beams formed by the subarrays of the large array in a tracking mode. The simulation of the proposed scheme shows the bit error probability and DoA estimation performance close to the theoretical limits.
{"title":"A Blind Iterative Hybrid Analog/Digital Beamformer for the Single User mmWave Reception using a Large Scale Antenna Array","authors":"Y. Vasavada, Naitik N Parekh, Aarushi Dhami, C. Prakash","doi":"10.1109/NCC52529.2021.9530187","DOIUrl":"https://doi.org/10.1109/NCC52529.2021.9530187","url":null,"abstract":"This paper develops a blind single-user beamforming algorithm for partially-connected hybrid analog-digital (HAD) antenna arrays operating at millimeter wave (mmWave) frequencies. The proposed scheme is optimal and computationally efficient — it is shown to converge to the optimal eigenvector beamformer without requiring an explicit eigenvector decomposition (EVD) of the received signal's correlation matrix. The Direction of Arrival (DoA) is estimated using the Fast Fourier Transform (FFT) of the digitally-formed beam weight vector and it is used to continually update the analog beams formed by the subarrays of the large array in a tracking mode. The simulation of the proposed scheme shows the bit error probability and DoA estimation performance close to the theoretical limits.","PeriodicalId":414087,"journal":{"name":"2021 National Conference on Communications (NCC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123910406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-27DOI: 10.1109/NCC52529.2021.9530106
Sapta Girish Neelam, P. R. Sahu
Orthogonal time frequency space modulation (OTFS), which is very robust to doubly-dispersive channels under high mobility is an emerging waveform for 5G cellular applications. In this paper, we first derive the input-output vectorized relation of OTFS system in the delay-Doppler domain in presence of IQ imbalance. Next, we study the effects of receive IQ imbalance on the performance of OTFS system. We also study the channel estimation and data detection of OTFS system in the presence of receiver IQ imbalance using pilot based transmission. We use a two level threshold based technique for 1. Pilot aided channel estimation and for 2. IQ imbalance parameter estimation. We compare the performance analysis of receiver IQ imbalanced OTFS with the estimated one and observe that the error flooring effect is removed.
{"title":"Channel Estimation and Data detection of OTFS system in the presence of Receiver IQ Imbalance","authors":"Sapta Girish Neelam, P. R. Sahu","doi":"10.1109/NCC52529.2021.9530106","DOIUrl":"https://doi.org/10.1109/NCC52529.2021.9530106","url":null,"abstract":"Orthogonal time frequency space modulation (OTFS), which is very robust to doubly-dispersive channels under high mobility is an emerging waveform for 5G cellular applications. In this paper, we first derive the input-output vectorized relation of OTFS system in the delay-Doppler domain in presence of IQ imbalance. Next, we study the effects of receive IQ imbalance on the performance of OTFS system. We also study the channel estimation and data detection of OTFS system in the presence of receiver IQ imbalance using pilot based transmission. We use a two level threshold based technique for 1. Pilot aided channel estimation and for 2. IQ imbalance parameter estimation. We compare the performance analysis of receiver IQ imbalanced OTFS with the estimated one and observe that the error flooring effect is removed.","PeriodicalId":414087,"journal":{"name":"2021 National Conference on Communications (NCC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127696838","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-27DOI: 10.1109/NCC52529.2021.9530101
Jayant Sharma, V. Lalitha
Trellis coded modulation (TCM) is a technique combining modulation with coding using trellises designed with heuristic techniques that maximize the minimum Euclidean distance of a codebook. We propose a neural networks based decoder for decoding TCM. We show experiments with our decoder that suggest the use of Convolutional Neural Network (CNN) with Recurrent Neural Network (RNN) can improve decoding performance and provide justification for the same. We show the generalization capability of the decoder by training it with small block length and testing for larger block length. We also test our decoder for its performance on noise model unseen in the training.
{"title":"Learning to Decode Trellis Coded Modulation","authors":"Jayant Sharma, V. Lalitha","doi":"10.1109/NCC52529.2021.9530101","DOIUrl":"https://doi.org/10.1109/NCC52529.2021.9530101","url":null,"abstract":"Trellis coded modulation (TCM) is a technique combining modulation with coding using trellises designed with heuristic techniques that maximize the minimum Euclidean distance of a codebook. We propose a neural networks based decoder for decoding TCM. We show experiments with our decoder that suggest the use of Convolutional Neural Network (CNN) with Recurrent Neural Network (RNN) can improve decoding performance and provide justification for the same. We show the generalization capability of the decoder by training it with small block length and testing for larger block length. We also test our decoder for its performance on noise model unseen in the training.","PeriodicalId":414087,"journal":{"name":"2021 National Conference on Communications (NCC)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126227786","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：