Pub Date : 2006-03-27DOI: 10.1109/SARNOF.2006.4534786
D. Green, M. Fiuczynski, E. Jankiewicz
The US Department of Defense (DoD) plans to add Internet protocol (IP) version 6 (IPv6) capability to all DoD IP networks by 2008 then begin a phase-out of IP version 4 (IPv4). To facilitate this migration various transition mechanisms have been developed to address interoperability of IPv4 and IPv6 networks and systems. Unfortunately, none of the existing mechanisms address two fundamental problems: (1) noninvasive migration of essential legacy IPv4-only systems to IPv6, and (2) operation of IPv4-only systems on IPv6-only core networks. This paper presents a solution to these problems by using a simple, low cost IPv4/IPv6 proxy translation device
{"title":"IPv6 translation for IPv4 embedded systems","authors":"D. Green, M. Fiuczynski, E. Jankiewicz","doi":"10.1109/SARNOF.2006.4534786","DOIUrl":"https://doi.org/10.1109/SARNOF.2006.4534786","url":null,"abstract":"The US Department of Defense (DoD) plans to add Internet protocol (IP) version 6 (IPv6) capability to all DoD IP networks by 2008 then begin a phase-out of IP version 4 (IPv4). To facilitate this migration various transition mechanisms have been developed to address interoperability of IPv4 and IPv6 networks and systems. Unfortunately, none of the existing mechanisms address two fundamental problems: (1) noninvasive migration of essential legacy IPv4-only systems to IPv6, and (2) operation of IPv4-only systems on IPv6-only core networks. This paper presents a solution to these problems by using a simple, low cost IPv4/IPv6 proxy translation device","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"85 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127987804","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 : 2005-10-20DOI: 10.1109/MILCOM.2005.1605687
G. Liva, W. Ryan
While it is fairly easy to design good low-density parity-check codes with medium or large block lengths, and with code rates 1/2 or greater, much more effort is required for short lengths and low rates. We propose a code structure which incorporates Hamming codes into a code's graph, leading to a type of a Tanner code. The incorporation of Hamming codes into the graph, which we call "Hamming code doping", tends to lead to larger minimum distances and hence low error-rate floors. We present an iterative decoding algorithm tailored to graphs possessing "Hamming nodes". Further, a density evolution analysis based on the Gaussian approximation is presented, which is a useful tool for finding good codes. Finally, we present numerical results of some Hamming-doped Tanner codes simulated on the AWGN channel. The simulated codes exhibit remarkably low error floors, while simultaneously displaying good decoding thresholds
{"title":"Short low-error-floor Tanner codes with Hamming nodes","authors":"G. Liva, W. Ryan","doi":"10.1109/MILCOM.2005.1605687","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605687","url":null,"abstract":"While it is fairly easy to design good low-density parity-check codes with medium or large block lengths, and with code rates 1/2 or greater, much more effort is required for short lengths and low rates. We propose a code structure which incorporates Hamming codes into a code's graph, leading to a type of a Tanner code. The incorporation of Hamming codes into the graph, which we call \"Hamming code doping\", tends to lead to larger minimum distances and hence low error-rate floors. We present an iterative decoding algorithm tailored to graphs possessing \"Hamming nodes\". Further, a density evolution analysis based on the Gaussian approximation is presented, which is a useful tool for finding good codes. Finally, we present numerical results of some Hamming-doped Tanner codes simulated on the AWGN channel. The simulated codes exhibit remarkably low error floors, while simultaneously displaying good decoding thresholds","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123237454","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1605783
G. Osborn, F. James, B. Swinford, A. Stewart, S. Chuprun
The future networked architectures currently in development represent a significant advancement from today's deployed military communications infrastructure. Given the substantial effort in developing and fielding these new technologies, transitional test beds are needed to evaluate networking objectives against simulated results. This paper describes a flexible test bed solution that supports the evaluation of communication protocol layers 1-3 in the context of a multi-channel software defined radio. The test bed provides a path for evaluating emerging high data rate waveforms (e.g. tactical OFDM), adaptive cross-layered quality of service behaviors, and network topology management using the distributed network agent (DNA) tool. It also demonstrates the feasibility of integrating networking technology into fielded SDR platforms. Both the current and planned capabilities of the test bed are described
{"title":"Software defined radio wideband networking QoS test bed","authors":"G. Osborn, F. James, B. Swinford, A. Stewart, S. Chuprun","doi":"10.1109/MILCOM.2005.1605783","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605783","url":null,"abstract":"The future networked architectures currently in development represent a significant advancement from today's deployed military communications infrastructure. Given the substantial effort in developing and fielding these new technologies, transitional test beds are needed to evaluate networking objectives against simulated results. This paper describes a flexible test bed solution that supports the evaluation of communication protocol layers 1-3 in the context of a multi-channel software defined radio. The test bed provides a path for evaluating emerging high data rate waveforms (e.g. tactical OFDM), adaptive cross-layered quality of service behaviors, and network topology management using the distributed network agent (DNA) tool. It also demonstrates the feasibility of integrating networking technology into fielded SDR platforms. Both the current and planned capabilities of the test bed are described","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114998707","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1605890
J. Noseworthy
The test and training enabling architecture (TENA) middleware is the result of a joint interoperability initiative of the Director, Operational Test and Evaluation (DOT&E) of the Office of the Secretary of Defense (OSD). The goals of the initiative are to enable interoperability among ranges, facilities, and simulations in a quick and cost-efficient manner, and to foster reuse of range assets and future range system developments. The TENA middleware uses Unified Modeling Language (UML)-based model-driven code generation to automatically create a complex Common Object Request Broker Architecture (CORBA) application. This model-driven automatic code-generation greatly reduces the amount of software that must be hand-written and tested. Furthermore, the TENA middleware combines distributed shared memory, anonymous publish-subscribe, and model-driven distributed object-oriented programming paradigms into a single distributed middleware system. This unique combination yields a powerful middleware system that enables its users to rapidly develop sophisticated yet understandable distributed applications. The TENA middleware offers powerful programming abstractions that are not present in CORBA alone and provides a strongly-typed application programmer interface (API) that is much less error-prone than the existing CORBA API. These high-level, easy-to-understand programming abstractions combined with an API designed to reduce programming errors enable users to quickly and correctly express the concepts of their applications. Re-usable standardized objects farther simplify the development of applications. The net result of this combination of features is a significant reduction of application programming errors yielding increased overall reliability and decreased overall development time. Distributed applications developed using the TENA middleware exchange data using the publish-subscribe paradigm. Although many publish-subscribe systems exist, the TENA middleware represents a significant advance in the field due to the many high-level, model-driven programming abstractions it presents to the programmer. The TENA middleware API relies heavily on compile-time type-safety to help ensure reliable behavior at runtime. Careful API design allows a great number of potential errors to be detected at compile-time that might otherwise go unnoticed until run-time - where the cost of an error could be extremely high! The implementation of the TENA middleware uses C++, as well as a real-time CORBA ORB. The TENA middleware is currently in use at dozens of Department of Defense (DoD) testing and training range facilities across the county and has been used to support major test and training events such as Joint Red Flag '05. The TENA Middleware is available at http://www.tena-sda.org/
{"title":"Developing distributed applications rapidly and reliably using the TENA middleware","authors":"J. Noseworthy","doi":"10.1109/MILCOM.2005.1605890","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605890","url":null,"abstract":"The test and training enabling architecture (TENA) middleware is the result of a joint interoperability initiative of the Director, Operational Test and Evaluation (DOT&E) of the Office of the Secretary of Defense (OSD). The goals of the initiative are to enable interoperability among ranges, facilities, and simulations in a quick and cost-efficient manner, and to foster reuse of range assets and future range system developments. The TENA middleware uses Unified Modeling Language (UML)-based model-driven code generation to automatically create a complex Common Object Request Broker Architecture (CORBA) application. This model-driven automatic code-generation greatly reduces the amount of software that must be hand-written and tested. Furthermore, the TENA middleware combines distributed shared memory, anonymous publish-subscribe, and model-driven distributed object-oriented programming paradigms into a single distributed middleware system. This unique combination yields a powerful middleware system that enables its users to rapidly develop sophisticated yet understandable distributed applications. The TENA middleware offers powerful programming abstractions that are not present in CORBA alone and provides a strongly-typed application programmer interface (API) that is much less error-prone than the existing CORBA API. These high-level, easy-to-understand programming abstractions combined with an API designed to reduce programming errors enable users to quickly and correctly express the concepts of their applications. Re-usable standardized objects farther simplify the development of applications. The net result of this combination of features is a significant reduction of application programming errors yielding increased overall reliability and decreased overall development time. Distributed applications developed using the TENA middleware exchange data using the publish-subscribe paradigm. Although many publish-subscribe systems exist, the TENA middleware represents a significant advance in the field due to the many high-level, model-driven programming abstractions it presents to the programmer. The TENA middleware API relies heavily on compile-time type-safety to help ensure reliable behavior at runtime. Careful API design allows a great number of potential errors to be detected at compile-time that might otherwise go unnoticed until run-time - where the cost of an error could be extremely high! The implementation of the TENA middleware uses C++, as well as a real-time CORBA ORB. The TENA middleware is currently in use at dozens of Department of Defense (DoD) testing and training range facilities across the county and has been used to support major test and training events such as Joint Red Flag '05. The TENA Middleware is available at http://www.tena-sda.org/","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"337 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115670900","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1605753
K. Balachandran, K. Budka, T. P. Chu, T. Doumi, J.H. Kang, R. Whinnery
We propose a converged wireless network architecture that allows both emerging IP-based multimedia services and mission-critical services to be supported for public safety end users. The proposed network architecture allows the technology and cost advantages of commercial wireless technologies (3G cellular, IEEE 802.x) to be leveraged while preserving existing investments in land mobile radio networks. The proposed converged network architecture also fulfils the key requirement of enabling interoperable mission-critical communications between public safety end users during times of need - a current limitation of public safety networks
{"title":"Converged wireless network architecture for homeland security","authors":"K. Balachandran, K. Budka, T. P. Chu, T. Doumi, J.H. Kang, R. Whinnery","doi":"10.1109/MILCOM.2005.1605753","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605753","url":null,"abstract":"We propose a converged wireless network architecture that allows both emerging IP-based multimedia services and mission-critical services to be supported for public safety end users. The proposed network architecture allows the technology and cost advantages of commercial wireless technologies (3G cellular, IEEE 802.x) to be leveraged while preserving existing investments in land mobile radio networks. The proposed converged network architecture also fulfils the key requirement of enabling interoperable mission-critical communications between public safety end users during times of need - a current limitation of public safety networks","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116670074","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1605850
Qiang Li, W. Wong
Traditional ultra-wideband (UWB) impulse radio system is sensitive to timing jitter effect, as a result precise synchronization is required. Our previous study shows that a simple "sample and compare'' high-speed UWB receiver is an effective scheme to combat timing jitter. In this paper, we extend our previous study by using the maximum absolute sampling value as the decision variable and derive the corresponding threshold optimization algorithm by means of a version of the Kiefer-Wolfowitz algorithm with expanding truncations and randomized differences. The new algorithm is robust under timing jitter and no knowledge of the channel gains is required. Convergence of the algorithm is analyzed. Simulation results show that the new algorithm has better performance than previous one
{"title":"A novel timing jitter robust UWB impulse radio system","authors":"Qiang Li, W. Wong","doi":"10.1109/MILCOM.2005.1605850","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605850","url":null,"abstract":"Traditional ultra-wideband (UWB) impulse radio system is sensitive to timing jitter effect, as a result precise synchronization is required. Our previous study shows that a simple \"sample and compare'' high-speed UWB receiver is an effective scheme to combat timing jitter. In this paper, we extend our previous study by using the maximum absolute sampling value as the decision variable and derive the corresponding threshold optimization algorithm by means of a version of the Kiefer-Wolfowitz algorithm with expanding truncations and randomized differences. The new algorithm is robust under timing jitter and no knowledge of the channel gains is required. Convergence of the algorithm is analyzed. Simulation results show that the new algorithm has better performance than previous one","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116773920","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1605955
V. Fineberg
The design of the IPv6 protocol includes mechanisms that fix issues encountered in IPv4 networks and provides new features and capabilities. Many of these features enhance the end-to-end performance of converged IP-based networks, and QoS improvements are usually listed as a major advantage of IPv6. This paper reviews IPv6-based QoS-enabling mechanisms and provides various examples of how they can be used in the GIG, including some innovative approaches
{"title":"IPV6 features for enhancing QoS in the GIG","authors":"V. Fineberg","doi":"10.1109/MILCOM.2005.1605955","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605955","url":null,"abstract":"The design of the IPv6 protocol includes mechanisms that fix issues encountered in IPv4 networks and provides new features and capabilities. Many of these features enhance the end-to-end performance of converged IP-based networks, and QoS improvements are usually listed as a major advantage of IPv6. This paper reviews IPv6-based QoS-enabling mechanisms and provides various examples of how they can be used in the GIG, including some innovative approaches","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117118914","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1605861
A.K. Das, M. Mesbahi
We consider the problem of survivable minimum power bidirectional topology optimization in wireless networks with sectored antennas. In this paper, we take an algebraic view of graph connectivity, which is defined as the second smallest eigenvalue of the Laplacian matrix of a graph. We propose a (sub-optimal) centralized heuristic procedure for constructing power efficient K-node connected topologies. The procedure comprises a construction phase and an improvement phase. The construction phase is based on Kruskal's algorithm for the minimum spanning tree (MST) problem. However, unlike Kruskal's MST algorithm which chooses minimum cost edges from a set of edge weights, our algorithm uses an incremental cost mechanism to select edges. The topology improvement phase is used to remove non-essential edges from the construction phase, without affecting the desired connectivity
{"title":"K-node connected power efficient topologies in networks with sectored antennas","authors":"A.K. Das, M. Mesbahi","doi":"10.1109/MILCOM.2005.1605861","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605861","url":null,"abstract":"We consider the problem of survivable minimum power bidirectional topology optimization in wireless networks with sectored antennas. In this paper, we take an algebraic view of graph connectivity, which is defined as the second smallest eigenvalue of the Laplacian matrix of a graph. We propose a (sub-optimal) centralized heuristic procedure for constructing power efficient K-node connected topologies. The procedure comprises a construction phase and an improvement phase. The construction phase is based on Kruskal's algorithm for the minimum spanning tree (MST) problem. However, unlike Kruskal's MST algorithm which chooses minimum cost edges from a set of edge weights, our algorithm uses an incremental cost mechanism to select edges. The topology improvement phase is used to remove non-essential edges from the construction phase, without affecting the desired connectivity","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127365666","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1606135
Zhifeng Hu, Junshan Zhang, L. Tong
We consider a many-to-one sensor network in which a large number of sensors are deployed to monitor an environment. We study sensor activity management therein to maximize the network lifetime while meeting the network resolution requirement. Specifically, in each transmission round the sink estimates the number of active sensors and broadcasts control information to the sensors for activity management. We first consider the case with accurate estimation, and devise a sensor activity control scheme under which the number of active sensors would converge to the minimum one that can meet the requirement. Next, we study the case when the estimation is inaccurate, and propose a stochastic approximation method to minimize the average number of active sensors.
{"title":"Dynamic activity management in many-to-one sensor networks","authors":"Zhifeng Hu, Junshan Zhang, L. Tong","doi":"10.1109/MILCOM.2005.1606135","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1606135","url":null,"abstract":"We consider a many-to-one sensor network in which a large number of sensors are deployed to monitor an environment. We study sensor activity management therein to maximize the network lifetime while meeting the network resolution requirement. Specifically, in each transmission round the sink estimates the number of active sensors and broadcasts control information to the sensors for activity management. We first consider the case with accurate estimation, and devise a sensor activity control scheme under which the number of active sensors would converge to the minimum one that can meet the requirement. Next, we study the case when the estimation is inaccurate, and propose a stochastic approximation method to minimize the average number of active sensors.","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127478292","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1605719
Lei Feng, W. Namgoong
While OFDM emerges as a potential solution for high data rate ultra-wideband (UWB) systems, the primary implementation challenge is the design of the high-speed ADC. In this paper, an efficient and fast adaptive frequency channelized receiver structure for OFDM is proposed. The cyclic prefix (CP) in OFDM signals enable the channelizer and the propagation channel to be decomposed into DFT related matrices and two cascaded equalizers corresponding to the channelizer and the propagation channel. A novel decomposition of DFT matrix is proposed to reduce the complexity of the cascaded receiver structure. The cascaded equalization structure enables the receiver to quickly track variations in the propagation channel. Simulations show that the proposed receiver achieves comparable uncoded bit error rate (BER) as an ideal fullband OFDM receiver
{"title":"Digitizing ultra-wideband OFDM signals with frequency channelization","authors":"Lei Feng, W. Namgoong","doi":"10.1109/MILCOM.2005.1605719","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605719","url":null,"abstract":"While OFDM emerges as a potential solution for high data rate ultra-wideband (UWB) systems, the primary implementation challenge is the design of the high-speed ADC. In this paper, an efficient and fast adaptive frequency channelized receiver structure for OFDM is proposed. The cyclic prefix (CP) in OFDM signals enable the channelizer and the propagation channel to be decomposed into DFT related matrices and two cascaded equalizers corresponding to the channelizer and the propagation channel. A novel decomposition of DFT matrix is proposed to reduce the complexity of the cascaded receiver structure. The cascaded equalization structure enables the receiver to quickly track variations in the propagation channel. Simulations show that the proposed receiver achieves comparable uncoded bit error rate (BER) as an ideal fullband OFDM receiver","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124846984","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
扫码关注我们
求助内容：
应助结果提醒方式：