Hasil untuk "Production capacity. Manufacturing capacity"

Doğa Evgür, Ozan Alp Topal, Özlem Tuğfe Demir

This paper investigates the uplink capacity of single-input single-output (SISO) systems assisted by a swarm of network-controlled repeaters (NCRs). We develop a rigorous wideband formulation based on OFDM signaling. Starting from the continuous-time passband model, we derive the capacity expression for the repeater-assisted OFDM channel, accounting for amplified noise contributions from multiple repeaters. Numerical results demonstrate that NCRs can substantially enhance system capacity even with simple activation strategies, and that activating only the closest repeater yields nearly the same performance as activating all repeaters, thereby offering significant energy-saving opportunities. These findings highlight the potential of NCR swarms as a cost-effective and scalable solution for coverage extension and capacity enhancement in wideband wireless networks.

Aharon Rips, Oron Sabag

We study communication over control systems, where a controller-encoder selects inputs to a dynamical system in order to simultaneously regulate the system and convey a message to an observer that has access to the system's output measurements. This setup reflects implicit communication, as the controller embeds a message in the control signal. The capacity of a control system is the maximal reliable rate of the embedded message subject to a closed-loop control-cost constraint. We focus on linear quadratic Gaussian (LQG) control systems, in which the dynamical system is given by a state-space model with Gaussian noise, and the control cost is a quadratic function of the system inputs and system states. Our main result is a convex optimization upper bound on the capacity of LQG systems. In the case of scalar systems, we prove that the upper bound yields the exact LQG system capacity. The upper bound also recovers all known results, including LQG control, feedback capacity of Gaussian channels with memory, and the LQG system capacity with a state-feedback. For vector LQG control systems, we provide a sufficient condition for tightness of the upper bound, based on the Riccati equation. Numerical simulations indicate the upper bound tightness in all tested examples, suggesting that the upper bound may be equal to the LQG system capacity in the vector case as well.

Pedro Bargueño, Diego Fernández-Silvestre, Juan A. Miralles

A generic characteristic of self-gravitating systems is that they have a negative heat capacity. An important example of this behavior is given by the Schwarzschild black hole. The case of charged and rotating black holes is even more interesting since a change of sign of the specific heat takes place through an infinite discontinuity. This has been usually associated with a black hole thermodynamic phase transition appearing at the points where the heat capacity diverges, the so-called Davies points. This aspect of black hole thermodynamics has been addressed from different perspectives, motivating different interpretations since its discovery in the 1970s. In this paper, a physical reinterpretation of the heat capacity is provided for spherically symmetric and static black holes. Our analysis is partially based on a reformulation of the black hole heat capacity using the Newman-Penrose formalism. The application to the Reissner-Nordström-de Sitter black hole case reveals a clear physical interpretation of the Newman-Penrose scalars evaluated at the event horizon. This allows us to write the heat capacity as a balance of pressures defined at the horizon, in particular, a matter pressure (coming from the energy-momentum tensor) and a thermal pressure (coming from the holographic energy equipartition of the horizon). The Davies point is identified with the point where the Komar thermal energy density matches the matter pressure at the horizon. We also compare the black hole case with the case of self-gravitating objects and their corresponding thermal evolutions. We conclude that the heat capacity of black holes and self-gravitating systems can be understood qualitatively in similar terms.

Haiyue Jing, Wenchi Cheng, Xiang-Gen Xia et al.

The plane wave based wireless communications have becoming more and more matured, along with the well utilization of the traditional resources such as time and frequency. To further increase the capacity for rapidly increasing capacity demand of wireless communications, it is potential to use the twist wave, which has the orbital angular momentum (OAM). In this paper, we discuss the OAM based wireless communications in the aspect of orthogonality, degree of freedom (DoF), and capacity, where both the transmitter and the receiver use uniform circular array (UCA) antennas. In particular, we compare OAM based wireless communications with multiple-input-multiple-output (MIMO) based wireless communications in terms of DoF and capacity. Numerical results are presented to validate and evaluate that the DoF of OAM based wireless communications is greater than or equal to that of correlated MIMO based wireless communications when the transmitter and the receiver antennas are aligned well. The OAM based wireless communications can achieve larger capacity than the correlated MIMO in high signal-to-noise ratio (SNR) region under line-of-sight scenario.

Eli Shemuel, Oron Sabag, Haim Permuter

We consider finite-state channels (FSCs) where the channel state is stochastically dependent on the previous channel output. We refer to these as Noisy Output is the STate (NOST) channels. We derive the feedback capacity of NOST channels in two scenarios: with and without causal state information (CSI) available at the encoder. If CSI is unavailable, the feedback capacity is $C_{\text{FB}}= \max_{P(x|y')} I(X;Y|Y')$, while if it is available at the encoder, the feedback capacity is $C_{\text{FB-CSI}}= \max_{P(u|y'),x(u,s')} I(U;Y|Y')$, where $U$ is an auxiliary RV with finite cardinality. In both formulas, the output process is a Markov process with stationary distribution. The derived formulas generalize special known instances from the literature, such as where the state is i.i.d. and where it is a deterministic function of the output. $C_{\text{FB}}$ and $C_{\text{FB-CSI}}$ are also shown to be computable via convex optimization problem formulations. Finally, we present an example of an interesting NOST channel for which CSI available at the encoder does not increase the feedback capacity.

Borazon Rassouli, Bruno Clerckx

This paper slightly improves the upper bound in Thangaraj et al. for the capacity of the amplitude-constrained scalar AWGN channel. This improvement makes the upper bound within 0.002 bits of the capacity for $\frac{E_b}{N_0}\leq 2.5$ dB.

Avhishek Chatterjee, Lav R. Varshney, Sriram Vishwanath

Crowdsourcing of jobs to online freelance markets is rapidly gaining popularity. Most crowdsourcing platforms are uncontrolled and offer freedom to customers and freelancers to choose each other. This works well for unskilled jobs (e.g., image classification) with no specific quality requirement since freelancers are functionally identical. For skilled jobs (e.g., software development) with specific quality requirements, however, this does not ensure that the maximum number of job requests is satisfied. In this work we determine the capacity of freelance markets, in terms of maximum satisfied job requests, and propose centralized schemes that achieve capacity. To ensure decentralized operation and freedom of choice for customers and freelancers, we propose simple schemes compatible with the operation of current crowdsourcing platforms that approximately achieve capacity. Further, for settings where the number of job requests exceeds capacity, we propose a scheme that is agnostic of that information, but is optimal and fair in declining jobs without wait.

Felipe Gomez-Cuba, Jinfeng Du, Muriel Médard et al.

In non-coherent wideband fading channels where energy rather than spectrum is the limiting resource, peaky and non-peaky signaling schemes have long been considered species apart, as the first approaches asymptotically the capacity of a wideband AWGN channel with the same average SNR, whereas the second reaches a peak rate at some finite critical bandwidth and then falls to zero as bandwidth grows to infinity. In this paper it is shown that this distinction is in fact an artifact of the limited attention paid in the past to the product between the bandwidth and the fraction of time it is in use. This fundamental quantity, called bandwidth occupancy, measures average bandwidth usage over time. For all signaling schemes with the same bandwidth occupancy, achievable rates approach to the wideband AWGN capacity within the same gap as the bandwidth occupancy approaches its critical value, and decrease to zero as the occupancy goes to infinity. This unified analysis produces quantitative closed-form expressions for the ideal bandwidth occupancy, recovers the existing capacity results for (non-)peaky signaling schemes, and unveils a trade-off between the accuracy of approximating capacity with a generalized Taylor polynomial and the accuracy with which the optimal bandwidth occupancy can be bounded.

Zbigniew Lipiński

In the paper we analyze the maximum lifetime problem in sensor networks with limited channel capacity for multipoint-to-multipoint and broadcast data transmission services. We show, that in order to achieve an optimal data transmission regarding the maximum lifetime problem we cannot allow for any interference of signals. We propose a new Signal to Interference plus Noise Ratio function and used is to modify the Shannon-Hartley channel capacity formula. For the modified channel capacity formula we solve the maximum lifetime problem in one dimensional regular sensor network $L_N$ for discussed data transmission services.

Chang-Yu Guo

It is well-known that several problems related to analysis on $s$-John domains can be unified by certain capacity lower estimates. In this paper, we obtain general lower bounds of $p$-capacity of a compact set $E$ and the central Whitney cube $Q_0$ in terms of the Hausdorff $q$-content of $E$ in an $s$-John domain $Ω$. Moreover, we construct several examples to show the essential sharpness of our estimates.

Kamil Bradler, Esteban Castro-Ruiz, Eduardo Nahmad-Achar

In this paper we show that the quantum channel between two inertial observers who transmit quantum information by sending realistic photonic wave packets is a well-studied channel in quantum Shannon theory -- the Pauli channel. The parameters of the Pauli channel and therefore its classical and quantum capacity depend on the magnitude of the Lorentz boost relating the two observers. The most striking consequence is that two inertial observers whose Pauli channel has initially zero quantum capacity can achieve nonzero quantum communication rates (reaching in principle its maximal value equal to one) by applying a boost in the right direction. This points to a fundamental connection between quantum channel capacities and special relativity.

David Sutter, Joseph M. Renes, Frédéric Dupuis et al.

We construct a channel coding scheme to achieve the capacity of any discrete memoryless channel based solely on the techniques of polar coding. In particular, we show how source polarization and randomness extraction via polarization can be employed to "shape" uniformly-distributed i.i.d. random variables into approximate i.i.d. random variables distributed ac- cording to the capacity-achieving distribution. We then combine this shaper with a variant of polar channel coding, constructed by the duality with source coding, to achieve the channel capacity. Our scheme inherits the low complexity encoder and decoder of polar coding. It differs conceptually from Gallager's method for achieving capacity, and we discuss the advantages and disadvantages of the two schemes. An application to the AWGN channel is discussed.

Lei Zhou, Wei Yu

This paper studies the relaying strategies and the approximate capacity of the classic three-node Gaussian relay channel, but where the noises at the relay and at the destination are correlated. It is shown that the capacity of such a relay channel can be achieved to within a constant gap of $\hf \log_2 3 =0.7925$ bits using a modified version of the noisy network coding strategy, where the quantization level at the relay is set in a correlation dependent way. As a corollary, this result establishes that the conventional compress-and-forward scheme also achieves to within a constant gap to the capacity. In contrast, the decode-and-forward and the single-tap amplify-and-forward relaying strategies can have an infinite gap to capacity in the regime where the noises at the relay and at the destination are highly correlated, and the gain of the relay-to-destination link goes to infinity.

Boris Ryabko

We address the problems of estimating the computer efficiency and the computer capacity. We define the computer efficiency and capacity and suggest a method for their estimation, based on the analysis of processor instructions and kinds of accessible memory. It is shown how the suggested method can be applied to estimate the computer capacity. In particular, this consideration gives a new look at the organization of the memory of a computer. Obtained results can be of some interest for practical applications

Chi-Kin Chau, Minghua Chen, Soung Chang Liew

In the literature, asymptotic studies of multi-hop wireless network capacity often consider only centralized and deterministic TDMA (time-division multi-access) coordination schemes. There have been fewer studies of the asymptotic capacity of large-scale wireless networks based on CSMA (carrier-sensing multi-access), which schedules transmissions in a distributed and random manner. With the rapid and widespread adoption of CSMA technology, a critical question is that whether CSMA networks can be as scalable as TDMA networks. To answer this question and explore the capacity of CSMA networks, we first formulate the models of CSMA protocols to take into account the unique CSMA characteristics not captured by existing interference models in the literature. These CSMA models determine the feasible states, and consequently the capacity of CSMA networks. We then study the throughput efficiency of CSMA scheduling as compared to TDMA. Finally, we tune the CSMA parameters so as to maximize the throughput to the optimal order. As a result, we show that CSMA can achieve throughput as $Ω(\frac{1}{\sqrt{n}})$, the same order as optimal centralized TDMA, on uniform random networks. Our CSMA scheme makes use of an efficient backbone-peripheral routing scheme and a careful design of dual carrier-sensing and dual channel scheme. We also address the implementation issues of our CSMA scheme.

Saikat Guha, Jeffrey H. Shapiro, Baris I. Erkmen

Determining the ultimate classical information carrying capacity of electromagnetic waves requires quantum-mechanical analysis to properly account for the bosonic nature of these waves. Recent work has established capacity theorems for bosonic single-user and broadcast channels, under the presumption of two minimum output entropy conjectures. Despite considerable accumulated evidence that supports the validity of these conjectures, they have yet to be proven. In this paper, it is shown that the second conjecture suffices to prove the classical capacity of the bosonic wiretap channel, which in turn would also prove the quantum capacity of the lossy bosonic channel. The preceding minimum output entropy conjectures are then shown to be simple consequences of an Entropy Photon-Number Inequality (EPnI), which is a conjectured quantum-mechanical analog of the Entropy Power Inequality (EPI) form classical information theory.

Gabriel Vigny

For a Kahler manifold X, we study a space of test functions W* which is a complex version of H1. We prove for W* the classical results of the theory of Dirichlet spaces: the functions in W* are defined up to a pluripolar set and the functional capacity associated to W* tests the pluripolar sets. This functional capacity is a Choquet capacity. The space W* is not reflexive and the smooth functions are not dense in it for the strong topology. So the classical tools of potential theory do not apply here. We use instead pluripotential theory and Dirichlet spaces associated to a current.

Syed A. Jafar, Sudhir Srinivasa

We investigate the capacity of opportunistic communication in the presence of dynamic and distributed spectral activity, i.e. when the time varying spectral holes sensed by the cognitive transmitter are correlated but not identical to those sensed by the cognitive receiver. Using the information theoretic framework of communication with causal and non-causal side information at the transmitter and/or the receiver, we obtain analytical capacity expressions and the corresponding numerical results. We find that cognitive radio communication is robust to dynamic spectral environments even when the communication occurs in bursts of only 3-5 symbols. The value of handshake overhead is investigated for both lightly loaded and heavily loaded systems. We find that the capacity benefits of overhead information flow from the transmitter to the receiver is negligible while feedback information overhead in the opposite direction significantly improves capacity.

P. Fraundorf

Information theory this century has clarified the 19th century work of Gibbs, and has shown that natural units for temperature kT, defined via 1/T=dS/dE, are energy per nat of information uncertainty. This means that (for any system) the total thermal energy E over kT is the log-log derivative of multiplicity with respect to energy, and (for all b) the number of base-b units of information lost about the state of the system per b-fold increase in the amount of thermal energy therein. For ``un-inverted'' (T>0) systems, E/kT is also a temperature-averaged heat capacity, equaling ``degrees-freedom over two'' for the quadratic case. In similar units the work-free differential heat capacity C_v/k is a ``local version'' of this log-log derivative, equal to bits of uncertainty gained per 2-fold increase in temperature. This makes C_v/k (unlike E/kT) independent of the energy zero, explaining in statistical terms its usefulness for detecting both phase changes and quadratic modes.

Vittorio Giovannetti, Seth Lloyd, Lorenzo Maccone et al.

We calculate the entanglement assisted capacity of a multimode bosonic channel with loss. As long as the efficiency of the channel is above 50%, the superdense coding effect can be used to transmit more bits than those that can be stored in the message sent down the channel. Bounds for the other capacities of the multimode channel are also provided.