Pub Date : 2018-02-01DOI: 10.1109/NCC.2018.8600097
Ganji Sreeram, R. Sinha
Lately, the problem of code-switching has gained a lot of attention and has emerged as an active area of research. In bilingual communities, the speakers commonly embed the words and phrases of a non-native language into the syntax of a native language in their day-to-day communications. The code-switching is a global phenomenon among multilingual communities, still very limited acoustic and linguistic resources are available as yet. For developing effective speech-based applications, the ability of the existing language technologies to deal with the code-switched data cannot be over emphasized. The code-switching is broadly classified into two modes: inter-sentential and intra-sentential code-switching. In this work, we have studied the intrasentential problem in the context of code-switching language modeling task. The salient contributions of this paper includes: (i) the creation of Hindi-English code-switching text corpus by crawling a few blogging sites educating about the usage of the Internet, and (ii) the exploration of the parts-of-speech features towards more effective modeling of Hindi-English code-switched data by the monolingual language models trained on native (Hindi) language data.
{"title":"Exploiting Parts-of-Speech for Improved Textual Modeling of Code-Switching Data","authors":"Ganji Sreeram, R. Sinha","doi":"10.1109/NCC.2018.8600097","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600097","url":null,"abstract":"Lately, the problem of code-switching has gained a lot of attention and has emerged as an active area of research. In bilingual communities, the speakers commonly embed the words and phrases of a non-native language into the syntax of a native language in their day-to-day communications. The code-switching is a global phenomenon among multilingual communities, still very limited acoustic and linguistic resources are available as yet. For developing effective speech-based applications, the ability of the existing language technologies to deal with the code-switched data cannot be over emphasized. The code-switching is broadly classified into two modes: inter-sentential and intra-sentential code-switching. In this work, we have studied the intrasentential problem in the context of code-switching language modeling task. The salient contributions of this paper includes: (i) the creation of Hindi-English code-switching text corpus by crawling a few blogging sites educating about the usage of the Internet, and (ii) the exploration of the parts-of-speech features towards more effective modeling of Hindi-English code-switched data by the monolingual language models trained on native (Hindi) language data.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134015630","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 : 2018-02-01DOI: 10.1109/NCC.2018.8600005
K. Gaurav, Sateeshkrishna Dhuli, Y. N. Singh
Network generation models try to mimic real world networks. Basic models of network generation like Random and Preferential Attachment result in networks without communities and having clustering coefficients less than that of real networks. We have proposed an alternative model to generate network having high clustering coefficient as well as community structure. We have included two new features in our model to achieve this. They are: $i$) to allow a person to make friends in iterations and ii) to make a particular fraction (say f) of links among friends of friends and rest among others. By preferring the connections among friends of friends, the clustering coefficient increases. By varying the fraction f, we can generate network with desired clustering coefficient. The proposed model has certain interesting properties. it generates community structure where number of communities and their interconnectedness can also be controlled by varying f. Finally, network size, and fraction $f$ are deciding the value of clustering coefficient of the network and responsible for having communities.
{"title":"Fraction of Connections Among Friends of Friends as a New Metric for Network Analysis","authors":"K. Gaurav, Sateeshkrishna Dhuli, Y. N. Singh","doi":"10.1109/NCC.2018.8600005","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600005","url":null,"abstract":"Network generation models try to mimic real world networks. Basic models of network generation like Random and Preferential Attachment result in networks without communities and having clustering coefficients less than that of real networks. We have proposed an alternative model to generate network having high clustering coefficient as well as community structure. We have included two new features in our model to achieve this. They are: $i$) to allow a person to make friends in iterations and ii) to make a particular fraction (say f) of links among friends of friends and rest among others. By preferring the connections among friends of friends, the clustering coefficient increases. By varying the fraction f, we can generate network with desired clustering coefficient. The proposed model has certain interesting properties. it generates community structure where number of communities and their interconnectedness can also be controlled by varying f. Finally, network size, and fraction $f$ are deciding the value of clustering coefficient of the network and responsible for having communities.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134165620","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 : 2018-02-01DOI: 10.1109/NCC.2018.8600236
Kshitiza Singh, A. Dixit, V. Jain
For supporting the upcoming applications like interactive gaming, 3D-TV, etc., a high data rate needs to be provided to the wireless mobile users. To facilitate these requirements, and to keep the mobility of the users intact, a wireless network that has an optical backbone with a huge bandwidth capacity is required. Radio-over-Fiber (RoF) networks prove to be a promising solution that can provide a high data rate along with a very low delay. In this paper, we propose a converged medium access control (MAC) protocol for RoF networks. In addition, the proposed converged MAC protocol is compared with a state-of-art non-converged MAC protocol. The simulation results show that the converged MAC protocol for RoF network offers much lower delay and high channel utilization as compared to the non-converged and hence converged RoF networks prove to be a better choice for the evolution of next generation networks.
{"title":"Performance Analysis of Non-Converged and Converged Medium Access Control Protocols for Radio-over-Fiber Networks","authors":"Kshitiza Singh, A. Dixit, V. Jain","doi":"10.1109/NCC.2018.8600236","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600236","url":null,"abstract":"For supporting the upcoming applications like interactive gaming, 3D-TV, etc., a high data rate needs to be provided to the wireless mobile users. To facilitate these requirements, and to keep the mobility of the users intact, a wireless network that has an optical backbone with a huge bandwidth capacity is required. Radio-over-Fiber (RoF) networks prove to be a promising solution that can provide a high data rate along with a very low delay. In this paper, we propose a converged medium access control (MAC) protocol for RoF networks. In addition, the proposed converged MAC protocol is compared with a state-of-art non-converged MAC protocol. The simulation results show that the converged MAC protocol for RoF network offers much lower delay and high channel utilization as compared to the non-converged and hence converged RoF networks prove to be a better choice for the evolution of next generation networks.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132859448","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 : 2018-02-01DOI: 10.1109/NCC.2018.8600235
D. Marathe, K. Kulat
We report a compact dual-band negative permittivity metamaterial resonator evolved from conventional Z-shaped resonator. The design approach is based on modifying the resonator geometry to raise overall inductance and capacitance in the structure. Numerical simulations and parameter extractions indicate negative permittivity response over microwave frequencies 2.77GHz-3.97GHz and 7.37GHz-9.10GHz. The electromagnetic response and effective medium ratio for metamaterial made of proposed resonator are compared with various other electric resonators to show its superiority. Metamaterial sample is fabricated and free space measurements are performed to validate resonance frequency. The proposed structure is planar, compact and can be scaled at higher THz and optical frequencies for practical applications.
{"title":"A compact dual-band resonator for negative permittivity metamaterial at microwave regime","authors":"D. Marathe, K. Kulat","doi":"10.1109/NCC.2018.8600235","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600235","url":null,"abstract":"We report a compact dual-band negative permittivity metamaterial resonator evolved from conventional Z-shaped resonator. The design approach is based on modifying the resonator geometry to raise overall inductance and capacitance in the structure. Numerical simulations and parameter extractions indicate negative permittivity response over microwave frequencies 2.77GHz-3.97GHz and 7.37GHz-9.10GHz. The electromagnetic response and effective medium ratio for metamaterial made of proposed resonator are compared with various other electric resonators to show its superiority. Metamaterial sample is fabricated and free space measurements are performed to validate resonance frequency. The proposed structure is planar, compact and can be scaled at higher THz and optical frequencies for practical applications.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134471736","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 : 2018-02-01DOI: 10.1109/NCC.2018.8600229
A. Patel
In this paper, we consider an unlicensed or Secondary User (SU) that performs sequential spectrum sensing of channels in the band of the licensed or the Primary user (PU). The sensing not only decides the availability of the channel but also measures its strength. Using these two attributes for a channel (as state) the SU decides either to stop sensing, use a channel and obtain a reward or to continue sensing at a cost in the hope of achieving a channel with better attributes. We aim to find a stopping rule such that an expected reward over a finite duration of time for the SU is maximized. We model our problem in the elegant framework of an optimal stopping problem (OSP). We consider two scenarios, (i) where the channel states are independent and identically distributed (iid) over the channels and (ii) where channel states are independent but not identically distributed over the channels. It is shown that the optimal solution for the first scenario is a simple threshold based policy. Moreover, for the second scenario we extend the results of the first scenario and propose an optimal sensing order and sensing rule based on multiple thresholds, which is also easy to implement.
{"title":"Optimal Sequential Channel Sensing for Cognitive Radios for IID and Non-Identical Channels","authors":"A. Patel","doi":"10.1109/NCC.2018.8600229","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600229","url":null,"abstract":"In this paper, we consider an unlicensed or Secondary User (SU) that performs sequential spectrum sensing of channels in the band of the licensed or the Primary user (PU). The sensing not only decides the availability of the channel but also measures its strength. Using these two attributes for a channel (as state) the SU decides either to stop sensing, use a channel and obtain a reward or to continue sensing at a cost in the hope of achieving a channel with better attributes. We aim to find a stopping rule such that an expected reward over a finite duration of time for the SU is maximized. We model our problem in the elegant framework of an optimal stopping problem (OSP). We consider two scenarios, (i) where the channel states are independent and identically distributed (iid) over the channels and (ii) where channel states are independent but not identically distributed over the channels. It is shown that the optimal solution for the first scenario is a simple threshold based policy. Moreover, for the second scenario we extend the results of the first scenario and propose an optimal sensing order and sensing rule based on multiple thresholds, which is also easy to implement.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130199390","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 : 2018-02-01DOI: 10.1109/NCC.2018.8600199
Meera Bharathan, K. M. Mridula, P. M. Ameer
In this paper, the authors propose a novel range-free localization method to localize the sensor nodes in anisotropic networks. The basic methods of range-free localization assume the hop-size of all links to be the same. This assumption is valid only in scenarios where the node distribution is fairly balanced. This is not practically accurate due to the random deployment of nodes in wireless sensor networks. Hence, the method of finding hop-size using the expected distance and hop-count between the sensor nodes is used in our work. This method is applied to anisotropic networks where obstacles are present. Extensive simulation studies have been conducted to validate the accuracy of the proposed method under the effects of log-normal shadowing which is practically relevant. The results are compared with DV-Hop and Reliable anchor pair selection method (RAPS). This method gives up to 35% performance improvement over DV-Hop technique and 15% performance improvement over RAPS technique in the literature.
{"title":"Range Free Localization in Anisotropic Networks using Unbiased Distance Model","authors":"Meera Bharathan, K. M. Mridula, P. M. Ameer","doi":"10.1109/NCC.2018.8600199","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600199","url":null,"abstract":"In this paper, the authors propose a novel range-free localization method to localize the sensor nodes in anisotropic networks. The basic methods of range-free localization assume the hop-size of all links to be the same. This assumption is valid only in scenarios where the node distribution is fairly balanced. This is not practically accurate due to the random deployment of nodes in wireless sensor networks. Hence, the method of finding hop-size using the expected distance and hop-count between the sensor nodes is used in our work. This method is applied to anisotropic networks where obstacles are present. Extensive simulation studies have been conducted to validate the accuracy of the proposed method under the effects of log-normal shadowing which is practically relevant. The results are compared with DV-Hop and Reliable anchor pair selection method (RAPS). This method gives up to 35% performance improvement over DV-Hop technique and 15% performance improvement over RAPS technique in the literature.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132300544","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 : 2018-02-01DOI: 10.1109/NCC.2018.8600074
Ankita Jain, Vivek Kanhangad
This paper presents a shape descriptor-based approach to human activity classification in devices such as iPod Touch, smartphones, and other similar devices. In this work, signals acquired from the built-in accelerometer and gyroscope sensors of iPod Touch are analyzed to recognize different activities performed by a user. In order to extract the discriminative information, shape descriptor-based features are computed from the captured signals. These features are then normalized and concatenated to form a consolidated feature vector. To recognize an activity performed by the user, k-nearest neighbor classifier is employed. The proposed approach is evaluated on the publicly available dataset namely, physical activity sensor data. Our experimental results demonstrate the effectiveness of the proposed shape descriptors for activity classification. Additionally, the experimental results on the aforementioned dataset show significant improvement in classification accuracy as compared to the existing work.
{"title":"Human Activity Classification in Smartphones using Shape Descriptors","authors":"Ankita Jain, Vivek Kanhangad","doi":"10.1109/NCC.2018.8600074","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600074","url":null,"abstract":"This paper presents a shape descriptor-based approach to human activity classification in devices such as iPod Touch, smartphones, and other similar devices. In this work, signals acquired from the built-in accelerometer and gyroscope sensors of iPod Touch are analyzed to recognize different activities performed by a user. In order to extract the discriminative information, shape descriptor-based features are computed from the captured signals. These features are then normalized and concatenated to form a consolidated feature vector. To recognize an activity performed by the user, k-nearest neighbor classifier is employed. The proposed approach is evaluated on the publicly available dataset namely, physical activity sensor data. Our experimental results demonstrate the effectiveness of the proposed shape descriptors for activity classification. Additionally, the experimental results on the aforementioned dataset show significant improvement in classification accuracy as compared to the existing work.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125237146","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 : 2018-02-01DOI: 10.1109/NCC.2018.8599902
Arijit Roy, S. Sen, H. Nemade, Ratnajit Bhattachariee
Chirp modulation can be considered as a type of spread spectrum modulation process providing high processing gain, robustness to multipath interference, requirement of low power. The paper presents a multiuser communication system using chirp signals having the same chirp rate and different initial frequencies for different users. The design of the chirp waveforms is discussed, and the correlations between them and the conditions for minimizing interference are derived. Analytical expressions of bit error rate (BER) performance for coherent and noncoherent cases for single user and multiuser systems using the proposed set of linear chirp signals are analyzed in additive white Gaussian noise (AWGN) and Rayleigh fading channels. The performance of the multiuser system is compared with that of reported linear chirp spread spectrum (CSS) systems. Performance of the presented system is also evaluated under Doppler frequency offset scenario.
{"title":"Multiuser Communication Using Chirp Signals of Equal Chirp Rate","authors":"Arijit Roy, S. Sen, H. Nemade, Ratnajit Bhattachariee","doi":"10.1109/NCC.2018.8599902","DOIUrl":"https://doi.org/10.1109/NCC.2018.8599902","url":null,"abstract":"Chirp modulation can be considered as a type of spread spectrum modulation process providing high processing gain, robustness to multipath interference, requirement of low power. The paper presents a multiuser communication system using chirp signals having the same chirp rate and different initial frequencies for different users. The design of the chirp waveforms is discussed, and the correlations between them and the conditions for minimizing interference are derived. Analytical expressions of bit error rate (BER) performance for coherent and noncoherent cases for single user and multiuser systems using the proposed set of linear chirp signals are analyzed in additive white Gaussian noise (AWGN) and Rayleigh fading channels. The performance of the multiuser system is compared with that of reported linear chirp spread spectrum (CSS) systems. Performance of the presented system is also evaluated under Doppler frequency offset scenario.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129928800","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 : 2018-02-01DOI: 10.1109/NCC.2018.8599887
M. Latha, P. B. Gohain, S. Chaudhari
In this paper, we propose two two-stage spectrum sensing schemes for a single secondary user (SU) or cognitive radio (CR) with multiple antennas to detect a primary user (PU) transmission. For both the proposed schemes, the first stage involves low-complexity coarse-sensing using simple energy detection (ED). The second stage for both methods involve high-performance fine-sensing using beamformed energy detection (BFED) in the estimated direction of arrival (DoA) of the PU signal. In the two-stage method, the second stage is conditional and sensing process goes to the second stage only if certain performance criteria is not met in the first stage. The two proposed methods differ in the performance criteria, which decides if the second stage of BFED is needed or not. The first two-stage method is designed to reduce complexity when there is no PU transmission while the second method is designed to reduce complexity when the PU signal is present. It is shown through simulations that the proposed two-stage schemes have significantly lower complexity as compared to only employing single-stage BFED with little or no performance loss.
{"title":"Low Complexity Two-Stage Sensing using Energy Detection and Beamforming","authors":"M. Latha, P. B. Gohain, S. Chaudhari","doi":"10.1109/NCC.2018.8599887","DOIUrl":"https://doi.org/10.1109/NCC.2018.8599887","url":null,"abstract":"In this paper, we propose two two-stage spectrum sensing schemes for a single secondary user (SU) or cognitive radio (CR) with multiple antennas to detect a primary user (PU) transmission. For both the proposed schemes, the first stage involves low-complexity coarse-sensing using simple energy detection (ED). The second stage for both methods involve high-performance fine-sensing using beamformed energy detection (BFED) in the estimated direction of arrival (DoA) of the PU signal. In the two-stage method, the second stage is conditional and sensing process goes to the second stage only if certain performance criteria is not met in the first stage. The two proposed methods differ in the performance criteria, which decides if the second stage of BFED is needed or not. The first two-stage method is designed to reduce complexity when there is no PU transmission while the second method is designed to reduce complexity when the PU signal is present. It is shown through simulations that the proposed two-stage schemes have significantly lower complexity as compared to only employing single-stage BFED with little or no performance loss.","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117005922","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 : 2018-02-01DOI: 10.1109/NCC.2018.8600007
Salil Sarnant, S. Joshi
In this paper we propose and lay the foundations of a functorial framework for representing signals. By incorporating an additional category-theoretic relative and generative perspective alongside the set-theoretic measure theory, the fundamental concept of redundancy is formulated in an arrow-theoretic way. The existing classic framework representing a signal as a vector in an appropriate linear space becomes a special case of the proposed framework. We also propose new definition of intra-signal redundancy using an isomorphism in a category, covering the translation case. Using category theory we provide a mathematical explanation for better signal compression performance of lossless differential encoding standards than classic representation techniques in certain cases (e.g. iconic images).
{"title":"Functorial Signal Representation: Foundations and Redundancy","authors":"Salil Sarnant, S. Joshi","doi":"10.1109/NCC.2018.8600007","DOIUrl":"https://doi.org/10.1109/NCC.2018.8600007","url":null,"abstract":"In this paper we propose and lay the foundations of a functorial framework for representing signals. By incorporating an additional category-theoretic relative and generative perspective alongside the set-theoretic measure theory, the fundamental concept of redundancy is formulated in an arrow-theoretic way. The existing classic framework representing a signal as a vector in an appropriate linear space becomes a special case of the proposed framework. We also propose new definition of intra-signal redundancy using an isomorphism in a category, covering the translation case. Using category theory we provide a mathematical explanation for better signal compression performance of lossless differential encoding standards than classic representation techniques in certain cases (e.g. iconic images).","PeriodicalId":121544,"journal":{"name":"2018 Twenty Fourth National Conference on Communications (NCC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123345551","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
扫码关注我们
求助内容：
应助结果提醒方式：