Service Oriented Architecture (SOA) is of current interest as a technological basis for new military Command, Control, Communications, Computers, Intelligence, Information, Surveillance and Reconnaissance (C4I2SR) systems. However, the main ideas of SOA are very different from the needs for a C4I2SR. The paper provides a mapping of the ideas of SOA to the needs of C4I2SR. Especially, SOA Business Processes seem useful. The paper gives architectural views on a hybrid SOA system that may be suitable for C4I2SR. Specific problems of migrating present C4I2SR systems to SOA, such as legacy systems and service registry, are also addressed.
{"title":"Architectural Aspects of C4I2SR Systems and Migration to Service Oriented Architecture","authors":"J. Jormakka, Jan Lucenius","doi":"10.1109/ICDT.2010.29","DOIUrl":"https://doi.org/10.1109/ICDT.2010.29","url":null,"abstract":"Service Oriented Architecture (SOA) is of current interest as a technological basis for new military Command, Control, Communications, Computers, Intelligence, Information, Surveillance and Reconnaissance (C4I2SR) systems. However, the main ideas of SOA are very different from the needs for a C4I2SR. The paper provides a mapping of the ideas of SOA to the needs of C4I2SR. Especially, SOA Business Processes seem useful. The paper gives architectural views on a hybrid SOA system that may be suitable for C4I2SR. Specific problems of migrating present C4I2SR systems to SOA, such as legacy systems and service registry, are also addressed.","PeriodicalId":322589,"journal":{"name":"2010 Fifth International Conference on Digital Telecommunications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116850560","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}
Abstract - This work presents a synchronizer based on pulse comparation, between variable and fixed pulses. We consider four synchronizers, divided in two variants, one variant operate at the rate and the other at half rate.Each synchronizer variant has two versions which are the manual and the automatic.The objective is to study the synchronizers and evaluate the output jitter UIRMS (Unit Interval Root Mean Square) versus the input SNR (Signal Noise Ratio).
{"title":"Sequential Symbol Synchronizers Based on Pulse Comparation at Half Rate","authors":"A. Reis, J. F. Rocha, A. Gameiro, J. P. Carvalho","doi":"10.1109/ICDT.2010.40","DOIUrl":"https://doi.org/10.1109/ICDT.2010.40","url":null,"abstract":"Abstract - This work presents a synchronizer based on pulse comparation, between variable and fixed pulses. We consider four synchronizers, divided in two variants, one variant operate at the rate and the other at half rate.Each synchronizer variant has two versions which are the manual and the automatic.The objective is to study the synchronizers and evaluate the output jitter UIRMS (Unit Interval Root Mean Square) versus the input SNR (Signal Noise Ratio).","PeriodicalId":322589,"journal":{"name":"2010 Fifth International Conference on Digital Telecommunications","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122269962","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}
Space-time block coding represents a practical and pragmatic method to mitigate the fading effects and to increase the channel capacity, by using spatial diversity. The space-time coding techniques are still preferred in communication systems because of the very simple transmit coding rule and of the relative reduced complexity of the maximum likelihood (ML) receivers with respect to other coding methods (e.g., space-time trellis codes) or other MIMO (Multiple Input Multiple Output) algorithms (e.g., spatial multiplexing). One of the drawbacks when using space-time block codes is the increase in complexity at the ML receiver when increasing the number of transmit antennas and the number of constellation points. This paper deals with this issue and introduces a decoding algorithm applicable only for orthogonal space-time block codes. We show that this decoding algorithm reduces the search space dimension of a regular ML receiver, leading to significant complexity reduction for quadrature amplitude modulation (QAM) constellations. The algorithm is then extended to an arbitrary number of receive antennas, increasing the spatial diversity order.
{"title":"Reduced Complexity Decoder for Orthogonal Space-Time Codes When Using QAM Constellations and Multiple Receive Antennas","authors":"A. Enescu, S. Ciochină, C. Paleologu","doi":"10.1109/ICDS.2008.24","DOIUrl":"https://doi.org/10.1109/ICDS.2008.24","url":null,"abstract":"Space-time block coding represents a practical and pragmatic method to mitigate the fading effects and to increase the channel capacity, by using spatial diversity. The space-time coding techniques are still preferred in communication systems because of the very simple transmit coding rule and of the relative reduced complexity of the maximum likelihood (ML) receivers with respect to other coding methods (e.g., space-time trellis codes) or other MIMO (Multiple Input Multiple Output) algorithms (e.g., spatial multiplexing). One of the drawbacks when using space-time block codes is the increase in complexity at the ML receiver when increasing the number of transmit antennas and the number of constellation points. This paper deals with this issue and introduces a decoding algorithm applicable only for orthogonal space-time block codes. We show that this decoding algorithm reduces the search space dimension of a regular ML receiver, leading to significant complexity reduction for quadrature amplitude modulation (QAM) constellations. The algorithm is then extended to an arbitrary number of receive antennas, increasing the spatial diversity order.","PeriodicalId":322589,"journal":{"name":"2010 Fifth International Conference on Digital Telecommunications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116924666","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
扫码关注我们
求助内容：
应助结果提醒方式：