The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Based on the analysis of the fundamental constraints on deep space communication data rates, this paper shows that the performance of post-carrier synchronization combining could be enhanced by Data-Aided (DA) synchronization. Through simulation, we get the optimal parameters for the DA synchronization algorithms and the performance enhancing zone of the proposed arraying scheme comparing with the...
This paper focuses on the subchannel and power allocation for mixed multicast and unicast traffic in wireless OFDMA networks, where the multicast data is divided into basic layer and enhancement layer data. Our goal is to maximize the network total throughput with a total power constraint while guaranteeing the minimum rate requirement of both the unicast and muticast traffic. A heuristic allocation...
In this paper, we focus on joint subchannel and power allocation for layered multicast streams in OFDMA cellular networks, where the multicast stream is composed of a basic layer and an enhancement layer. Our goal is to maximize the system total throughput with a total power constraint and a minimum rate requirement. A low-complexity allocation algorithm is proposed, which combined a cost-based subchannel...
Low-density parity-check (LDPC) codes of column weight two, also called cycle codes, can be constructed based on connected simple graphs. In this paper, efficiently encodable cycle codes and modified Repeat-Accumulate codes based on Hamiltonian graphs with large girths are devised. Specifically, the Hamiltonian property of the graphs is exploited to obtain efficient encoder structures and a concise...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.