Thematische Bibliographien / Multiaccess channel

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Multiaccess channel“

Autor: Grafiati

Veröffentlicht am 11. Januar 2025

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Multiaccess channel" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Multiaccess channel"

Csiszar, Imre, und Prakash Narayan. „Secrecy Generation for Multiaccess Channel Models“. IEEE Transactions on Information Theory 59, Nr. 1 (Januar 2013): 17–31. http://dx.doi.org/10.1109/tit.2012.2216254.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dowd, P. W., und K. Jabbour. „Spanning multiaccess channel hypercube computer interconnection“. IEEE Transactions on Computers 37, Nr. 9 (1988): 1137–42. http://dx.doi.org/10.1109/12.2267.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Demianowicz, Maciej. „Decoherence-Free Communication over Multiaccess Quantum Channels“. Open Systems & Information Dynamics 20, Nr. 02 (Juni 2013): 1350007. http://dx.doi.org/10.1142/s1230161213500078.

Der volle Inhalt der Quelle

Annotation:

In this paper we consider decoherence-free communication over multiple access and k-user quantum channels. First, we concentrate on a hermitian unitary noise model U for a two-access bi-unitary channel and show that in this case a decoherence-free code exists if the space of Schmidt matrices of an eigensubspace of U exhibits certain properties of decomposability. Then, we show that our technique is also applicable for generic random unitary two-access channels. Finally, we consider the applicability of the result to the case of a larger number of senders and general Kraus operators.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Krikidis, I. „Multilevel Modulation for Cognitive Multiaccess Relay Channel“. IEEE Transactions on Vehicular Technology 59, Nr. 6 (Juli 2010): 3121–25. http://dx.doi.org/10.1109/tvt.2010.2047515.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fan, P. Z., M. Darnell und B. Honary. „Superimposed codes for the multiaccess binary adder channel“. IEEE Transactions on Information Theory 41, Nr. 4 (Juli 1995): 1178–82. http://dx.doi.org/10.1109/18.391266.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mı́guez, Joaquı́n, und Luis Castedo. „Space–time channel estimation and soft detection in time-varying multiaccess channels“. Signal Processing 83, Nr. 2 (Februar 2003): 389–411. http://dx.doi.org/10.1016/s0165-1684(02)00426-7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Awan, Z. H., A. Zaidi und L. Vandendorpe. „Multiaccess Channel With Partially Cooperating Encoders and Security Constraints“. IEEE Transactions on Information Forensics and Security 8, Nr. 7 (Juli 2013): 1243–54. http://dx.doi.org/10.1109/tifs.2013.2263804.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Panwar, S. S., D. Towsley und Y. Armoni. „Collision resolution algorithms for a time-constrained multiaccess channel“. IEEE Transactions on Communications 41, Nr. 7 (Juli 1993): 1023–26. http://dx.doi.org/10.1109/26.231930.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Seshadri, N., und P. Srikantakumar. „On Group Testing Protocols for Binary-Feedback Multiaccess Channel“. IEEE Transactions on Communications 33, Nr. 6 (Juni 1985): 574–77. http://dx.doi.org/10.1109/tcom.1985.1096339.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ehsan, Navid, und Tara Javidi. „Delay Optimal Transmission Policy in a Wireless Multiaccess Channel“. IEEE Transactions on Information Theory 54, Nr. 8 (August 2008): 3745–51. http://dx.doi.org/10.1109/tit.2008.926328.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Multiaccess channel"

Teletar, Ä°brahim Emre. „Coding and multiaccess for the energy limited Rayleigh fading channel“. Thesis, Massachusetts Institute of Technology, 1988. http://hdl.handle.net/1721.1/14759.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ren, Weili. „A control-centralised multiaccess protocol exploiting non-selective fading for LEO satellite communications“. Thesis, University of Surrey, 2001. http://epubs.surrey.ac.uk/892/.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sagheer, Fakher. „Bayesian statistical methods for joint user activity detection, channel estimation, and data decoding in dynamic wireless networks“. Electronic Thesis or Diss., Institut polytechnique de Paris, 2024. https://theses.hal.science/tel-04874844.

Der volle Inhalt der Quelle

Annotation:

L'accès multiple non-orthogonal grant-free (GF-NOMA) s'impose progressivement comme une partie intégrante de la couche physique des systèmes d'accès radio du futur. En permettant d'accéder à une station de base sans allocation explicite de ressources temps/fréquence/code, GF-NOMA permet non seulement d'améliorer l'efficacité spectrale, mais également de rendre possible des communications ultra fiables à faible latence (URLLC). De telles exigences permettront de répondre aux enjeux spécifiques d'applications sans fil telles que l'internet des objets, la réalité virtuelle, les jeux vidéo en ligne, les communications entre machines, véhicules, etc. Cependant, GF-NOMA introduit un nouveau défi inexistant dans les systèmes de communication classiques, à savoir la détection d'activité des utilisateurs : en plus de l'estimation du canal, de la détection et du décodage des utilisateurs interférant, la station de base réceptrice doit être en mesure de procéder à leur classification en deux catégories : ceux qui sont actifs et transmettent et ceux qui ne le sont pas. La massivité du système, l'absence de contrôle de puissance à l'émission et/ou d'orthogonalité des séquences pilotes des utilisateurs sont autant de caractéristiques qui compliquent les traitements en réception. Cette thèse a pour thème général l'étude de nouvelles méthodes statistiques basées sur des algorithmes à passage de messages sur des graphes factoriels (factor graphs) appropriés afin de traiter conjointement toutes ces tâches au niveau du récepteur. Sont étudiées plus précisément :- une méthode (1) d'inférence bayésienne hybride à base de l'algorithme de propagation de croyance (belief propagation algorithme, BP) et de l'algorithme de propagation de l'espérance (expectation propagation algorithme, EP) pour résoudre le problème conjoint de détection d'activité, estimation de canal, et détection multi-utilisateur dans un système GF-NOMA synchrone avec absence de contrôle de puissance à l'émission, séquences pilotes orthogonales et antennes réceptrices multiples. En introduisant un critère d'approximation pour exprimer le passage de messages sous forme de lois gaussiennes, l'estimation du canal et la détection multi-utilisateurs peuvent être traitées efficacement par l'algorithme EP. Ceci s'avérant impossible sous cette forme pour la détection d'activité des utilisateurs, un passage de messages sous forme BP est utilisé à cet effet. La méthode proposée inclut une étape d'estimation des hyperparamètres du modèle que sont l'énergie des signaux reçus et la corrélation spatiale entre les antennes réceptrices. Une variante à complexité réduite ignorant la corrélation spatiale entre antennes réceptrices est également proposée ;- une méthode (2) d'inférence bayésienne à base de l'algorithme EP exploitant des méthodes d'analyse complexe (dérivées de Wirtinger) permettant de traiter la détection d'activité des utilisateurs également sous la forme d'un algorithme à passage de messages gaussiens ;- une méthode (3) faisant précéder la méthode (2) d'une méthode d'acquisition comprimée bayésienne chargée de l'estimation initiale du canal et de l'activité des utilisateurs dans le contexte complexifié d'un accès massif avec séquences pilotes des utilisateurs non-orthogonales. L'évaluation par simulations de ces différentes méthodes est effectuée dans le cas particulier d'un système GF-NOMA synchrone par codage, entrelacement et modulation OFDM (GF-OFDM-IDMA). Les performances obtenues (mesurées en termes de taux d'erreur binaire résiduel pour la détection et le décodage, d'erreur quadratique moyenne pour l'estimation de canal, et de probabilités de fausse alarme et de non-détection pour la détection d'activité) se comparent favorablement par rapport à celles obtenues avec des méthodes classiques publiées dans la littérature. Mots clés : NOMA, grant-free, accès massif, OFDM, graphes factoriels, algorithmes à passage de messages, propagation de croyance, propagation de l'espérance
Grant-free non-orthogonal multiple access (GF-NOMA) is gradually becoming an integral part of the physical layer of future radio access systems. By allowing access to a base station without explicit allocation of time/frequency/code resources, GF-NOMA not only improves spectral efficiency, but also enables ultra-reliable low latency communications (URLLC) . Such requirements will make it possible to meet the specific challenges of wireless applications such as the Internet of Things, virtual reality, online video games, communications between machines, vehicles, etc.However, GF-NOMA introduces a new challenge that does not exist in conventional communication systems, namely user activity detection: in addition to channel estimation, detection and decoding of interfering users, the base station receiver must be able to classify them into two categories: those who are active and transmitting and those who are not. The massiveness of the system, the absence of power control on transmission and/or orthogonality of user pilot sequences are all characteristics which complicate processing at the receiver.The general subject of this thesis is the study of new statistical methods based on message passing algorithms on appropriate factor graphs in order to jointly handle all these tasks at the receiver level.Are studied more precisely:- a method (1) of hybrid Bayesian inference based on the belief propagation algorithm (BP) and the expectation propagation algorithm (EP) to solve the problem of joint activity detection, channel estimation, and multi-user detection in a synchronous GF-NOMA system with no transmit power control, orthogonal pilot sequences and multiple receiver antennas. By introducing an approximation criterion to express message passing as Gaussian laws, channel estimation and multi-user detection can be efficiently processed by the EP algorithm. This proving impossible in this form for detecting user activity, message passing in BP form is used for this purpose. The proposed method includes a step of estimating the hyperparameters of the model, which are the energy of the received signals and the spatial correlation between the receiving antennas. A reduced complexity variant ignoring the spatial correlation between receiving antennas is also proposed;- a method (2) of Bayesian inference based on the EP algorithm exploiting complex analysis methods (Wirtinger derivatives) making it possible to process user activity detection also in the form of a Gaussian message passing algorithm;- a method (3) preceding method (2) with a Bayesian compressed acquisition method responsible for the initial estimation of the channel and user activity in the more complex context of massive access with non-orthogonal pilot sequences for the users.The evaluation by simulations of these different methods is carried out in the particular case of a synchronous GF-NOMA system by coding, interleaving and OFDM modulation (GF-OFDM-IDMA). The performance obtained (measured in terms of residual bit error rate for detection and decoding, root mean square error for channel estimation, and false alarm and missed-detection probabilities for activity detection) compare favorably with those obtained with traditional methods published in the literature. Keywords: NOMA, grant-free, massive access, OFDM, factor graphs, message passing algorithms, belief propagation, expectation propagation

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Khanna, Atul C. „An analysis of multiaccess reservation strategies for satellite channels“. Thesis, Massachusetts Institute of Technology, 1985. http://hdl.handle.net/1721.1/15130.

Der volle Inhalt der Quelle

Annotation:

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1985.
MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING
Bibliography: leaf 71.
by Atul C. Khanna.
M.S.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wikstrand, Greger. „Improving user comprehension and entertainment in wireless streaming media : introducing cognitive quality of service“. Licentiate thesis, Umeå University, Computing Science, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-916.

Der volle Inhalt der Quelle

Annotation:

In future mobile networks service quality might be poor. A new measure is needed to be able to assess services in terms of their effectiveness and usefulness despite their lacking visual appeal. Cognitive Quality of Service is a way to measure the effectiveness in use of a networked service.

This thesis introduces Cognitive Quality of Service and puts it in relation to other ways to measure quality in streaming media. Through four studies the concept is used to improve multicast performance in a WLAN, to assess the effectiveness of simple animations compared to video, to build an application that fuses video and animations and to assess the differences between various levels of streaming video quality.

Guidelines on how to measure Cognitive Quality of Service are introduced based on a review of available literature and later analyzed in light of the studies presented in the thesis. It turns out that the guidelines are sound and should be used as a basis for assessing Cognitive Quality of Service.

Finally, the usefullness of Cognitive Quality of Service is analyzed. It turns out that it is especially useful when comparing different media, e.g. animations and video. In the video only case even bit-rate might be a useful predictor of subjective quality.

I framtiden kommer användare att titta på videosekvenser i trådlösa apparater, exempelvis mobiltelefoner. På grund av tekniska faktorer som störningar och på grund av kostnaden för det kommer den kvalitet som de erhåller inte att vara jämförbar med till exempel den kvalitet som kan erhållas när man tittar på tv. Trots det kan man anta att sådan video kan vara intressant och upplysande.

I avhandlingen introduceras och används begreppet Cognitive Quality of Service (CQoS) - kognitiv servicekvalitet. Begreppet definieras av att den överföring som ger den bästa förståelsen och känslomässiga reaktionen också har bäst CQoS. För att mäta CQoS bör man följa vissa riktlinjer, särskilt som det är svårt att mäta förståelse i samband med att man tittar på video.

Författaren har tillsammans med medarbetare tittat på hur man kan förbättra förhållandena för själva radioöverföringen (studie I). Genom en algoritm som ger multicast-paket bättre skydd mot kollisioner visas att man kan erhålla förbättrad överföringskapacitet för strömmande video i ett trådlöst nätverk.

Animeringar är ett alternativ till video som kräver låg bandbredd. I ett experiment har man undersökt hur väl animeringar står sig mot video av olika kvalitet när det gäller att upplysa användaren och ge en bra upplevelse (studie II). Det visade sig att animeringar var bättre för förståelsen medan video gav en bättre känslomässig upplevelse. Vanare åskådare föredrog videon medan ovanare åskådare föredrog animeringarna.

Frågan som ställdes var då hur man kunde kombinera respektive mediums fördelar för att få en så bra blandning som möjligt. Å ena sidan var animeringarna billiga och lätta att förstå medan videon var dyrare och mer intressant. Ett prototypgränssnitt skapades. Där kunde användaren själv välja vilken mix mellan de två alternativen som skulle visas (studie III). Det visade sig att försökspanelen föredrog video och dessutom ville ha mer information om spelare och match.

Trots animationernas förträfflighet kan man anta att det ändå är video som kommer att dominera i framtiden. En sista studie genomfördes för att se om man kunde finna liknande resultat vid olika kvalitetsgrader i video som man tidigare hade funnit mellan video och animeringar (studie IV). Det visade sig att så länge man höll sig till ett format var sambanden enklare. Mer var helt enkelt bättre upp till en viss gräns där det inte tillförde mer att öka överföringsresurserna för videon.

Sammanfattningsvis visar studierna att CQoS kan ge värdefull designkunskap. I synnerhet när man jämför olika presentationsformer som i det här fallet animeringar och video. Nästa steg blir att gå vidare med att applicera CQoS i tvåvägskommunikation, särskilt i Conversational Multimedia (CMM) ungefär bildtelefoni där det är särskilt goda möjligheter att sammanställa en för omständigheterna anpassad mediamix.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

„A perspective on multiaccess channels“. Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, 1985. http://hdl.handle.net/1721.1/1149.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

„Energy limited channels : coding, multiaccess, and spread spectrum“. Laboratory for Information and Decision Systems, Massachusetts Institute of Technology], 1987. http://hdl.handle.net/1721.1/3023.

Der volle Inhalt der Quelle

Annotation:

Robert G. Gallager.
Caption title. "November 1987."
Includes bibliographical references.
Supported in part by a contract from the National Science Foundation. NSF-ECS-8310698 Supported in part by a contract from ARO. DAAL03-86-K-0171

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Goyal, Munish. „Stochastic Control Of Transmissions Over Multiaccess Fading Channels“. Thesis, 2004. https://etd.iisc.ac.in/handle/2005/1194.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Goyal, Munish. „Stochastic Control Of Transmissions Over Multiaccess Fading Channels“. Thesis, 2004. http://etd.iisc.ernet.in/handle/2005/1194.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kalyanarama, Sesha Sayee KCV. „Scheduling For Stable And Reliable Communication Over Multiaccess Channels And Degraded Broadcast Channels“. Thesis, 2006. https://etd.iisc.ac.in/handle/2005/362.

Der volle Inhalt der Quelle

Annotation:

Information-theoretic arguments focus on modeling the reliability of information transmission, assuming availability of infinite data at sources, thus ignoring randomness in message generation times at the respective sources. However, in information transport networks, not only is reliable transmission important, but also stability, i.e., finiteness of mean delay in- curred by messages from the time of generation to the time of successful reception. Usually, delay analysis is done separately using queueing-theoretic arguments, whereas reliable information transmission is studied using information theory. In this thesis, we investigate these two important aspects of data communication jointly by suitably combining models from these two fields. In particular, we model scheduled communication of messages , that arrive in a random process, (i) over multiaccess channels, with either independent decoding or joint decoding, and (ii) over degraded broadcast channels. The scheduling policies proposed permit up to a certain maximum number of messages for simultaneous transmission. In the ﬁrst part of the thesis, we develop a multi-class discrete-time processor-sharing queueing model, and then investigate the stability of this queue. In particular, we model the queue by a discrete-time Markov chain defined on a countable state space, and then establish (i) a sufficient condition for c-regularity of the chain, and hence positive recurrence and finiteness of stationary mean of the function c of the state, and (ii) a sufficient condition for transience of the chain. These stability results form the basis for the conclusions drawn in the thesis. The second part of the thesis is on multiaccess communication with random message arrivals. In the context of independent decoding, we assume that messages can be classified into a fixed number of classes, each of which specifies a combination of received signal power, message length, and target probability of decoding error. Each message is encoded independently and decoded independently. In the context of joint decoding, we assume that messages can be classified into a fixed number of classes, each of which specifies a message length, and for each of which there is a message queue. From each queue, some number of messages are encoded jointly, and received at a signal power corresponding to the queue. The messages are decoded jointly across all queues with a target probability of joint decoding error. For both independent decoding and joint decoding, we derive respective discrete- time multiclass processor-sharing queueing models assuming the corresponding information-theoretic models for the underlying communication process. Then, for both the decoding schemes, we (i) derive respective outer bounds to the stability region of message arrival rate vectors achievable by the class of stationary scheduling policies, (ii) show for any mes- sage arrival rate vector that satisfies the outer bound, that there exists a stationary “state-independent” policy that results in a stable system for the corresponding message arrival process, and (iii) show that the stability region of information arrival rate vectors, in the limit of large message lengths, equals an appropriate information-theoretic capacity region for independent decoding, and equals the information-theoretic capacity region for joint de-coding. For independent decoding, we identify a class of stationary scheduling policies, for which we show that the stability region in the limit of large maximum number of simultane-ous transmissions is independent of the received signal powers, and each of which achieves a spectral efficiency of 1 nat/s/Hz in the limit of large message lengths. In the third and last part of the thesis, we show that the queueing model developed for multiaccess channels with joint decoding can be used to model communication over degraded broadcast channels, with superposition encoding and successive decoding across all queues. We then show respective results (i), (ii), and (iii), stated above.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Multiaccess channel"

Tufvesson, Fredrik, und Torleiv Maseng. „Optimization of Sub-Channel Bandwidth for Mobile OFDM Systems“. In Multiaccess, Mobility and Teletraffic, 103–13. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5437-0_9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

La, Richard, und Venkat Anatharam. „A game-theoretic look at the Gaussian multiaccess channel“. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 87–105. Providence, Rhode Island: American Mathematical Society, 2004. http://dx.doi.org/10.1090/dimacs/066/06.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Hayar, Aawatif, Bernard Lacaze und Daniel Roviras. „Multiple Access Using Periodic Clock Changes through Slow Fading Multipath Channel“. In Multiaccess, Mobility and Teletraffic in Wireless Communications: Volume 4, 63–71. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4757-5920-4_7.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Iacono, Ana Lúcia, Ashok Rudrapatna und Peter Zhu. „The Enhanced Access Channel in cdma2000“. In Multiaccess, Mobility and Teletraffic in Wireless Communications: Volume 5, 317–28. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4757-5916-7_27.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Balakrishnan, Jaiganesh, Markus Rupp und Harish Viswanathan. „Optimal Channel Training for Multiple Antenna Systems“. In Multiaccess, Mobility and Teletraffic in Wireless Communications: Volume 5, 25–36. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4757-5916-7_3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Calin, Doru, und Djamal Zeghlache. „Analysis of GSM HSCSD Service with Channel Allocation Constraints“. In Multiaccess, Mobility and Teletraffic for Wireless Communications: Volume 3, 237–52. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4615-5607-7_16.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sherif, Mahmoud, Ibrahim Habib, Mahmoud Naghshineh und Parviz Kermani. „Adaptive Channel Borrowing Algorithm for Multimedia Wireless/Mobile Networks“. In Multiaccess, Mobility and Teletraffic in Wireless Communications: Volume 5, 123–34. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4757-5916-7_11.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ilić, Željko, Smiljan Pilipović und Mladen Kos. „An Extended Error Control Technique for Wireless ATM Channel“. In Multiaccess, Mobility and Teletraffic in Wireless Communications: Volume 4, 159–65. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4757-5920-4_17.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Akhtar, Saleem, und Djamal Zeghlache. „Rate and Power Adaptation for Downlink Shared Channel in WCDMA“. In Multiaccess, Mobility and Teletraffic for Wireless Communications, volume 6, 61–74. Boston, MA: Springer US, 2002. http://dx.doi.org/10.1007/978-1-4757-5918-1_4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Choy, Manhoi, Bo Li und Xiaomao Liu. „A Distributed and Adaptive Hybrid Channel Allocation Strategy for PCS Networks“. In Multiaccess, Mobility and Teletraffic for Wireless Communications: Volume 3, 279–94. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4615-5607-7_19.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Multiaccess channel"

Sankar, Lalitha, Yingbin Liang, H. Vincent Poor und Narayan Mandayam. „Opportunistic Communications in an Orthogonal Multiaccess Relay Channel“. In 2007 IEEE International Symposium on Information Theory. IEEE, 2007. http://dx.doi.org/10.1109/isit.2007.4557396.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Chen, Deqiang, und J. Laneman. „The Diversity-Multiplexing Tradeoff for the Multiaccess Relay Channel“. In 2006 40th Annual Conference on Information Sciences and Systems. IEEE, 2006. http://dx.doi.org/10.1109/ciss.2006.286669.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Awan, Zohaib Hassan, Abdellatif Zaidi und Luc Vandendorpe. „On multiaccess channel with unidirectional cooperation and security constraints“. In 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 2012. http://dx.doi.org/10.1109/allerton.2012.6483325.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Clarke, Ernest S., R. Prenger und Monte Ross. „Experimental results with a prototype three-channel multiaccess transceiver lasercom terminal“. In OE/LASE'93: Optics, Electro-Optics, & Laser Applications in Science& Engineering, herausgegeben von G. Stephen Mecherle. SPIE, 1993. http://dx.doi.org/10.1117/12.149250.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wu, Shuhang, Shuangqing Wei, Yue Wang, Ramachandran Vaidyanathan, Jian Yuan und Xiqin Wang. „Detection of graph structures via communications over a multiaccess Boolean channel“. In 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, 2015. http://dx.doi.org/10.1109/isit.2015.7282917.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Rezki, Zouheir, und Mohamed-Slim Alouini. „On the capacity of multiaccess fading channels with full channel state information at low power regime“. In ICC 2013 - 2013 IEEE International Conference on Communications. IEEE, 2013. http://dx.doi.org/10.1109/icc.2013.6655045.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Soussi, Mohieddine El, Abdellatif Zaidi und Luc Vandendorpe. „Compress-and-forward on a multiaccess relay channel with computation at the receiver“. In ICC 2013 - 2013 IEEE International Conference on Communications. IEEE, 2013. http://dx.doi.org/10.1109/icc.2013.6655436.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Goyal, M., A. Kumar und V. Sharma. „Delay optimal control algorithm for a multiaccess fading channel with peak power constraint“. In Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. IEEE, 2005. http://dx.doi.org/10.1109/isit.2005.1523708.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Cheung, Kwok-wai, Lian-Kuan Chen, C. Su, C. T. Yeung und P. T. To. „Tunable-channel multiaccess (TCMA) networks: a new class of high-speed networks suitable for multimedia integrated networking“. In SPIE's 1993 International Symposium on Optics, Imaging, and Instrumentation, herausgegeben von Leonid G. Kazovsky und Karen Liu. SPIE, 1993. http://dx.doi.org/10.1117/12.161318.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sang Wu Kim. „Optimal multiaccess of slotted communication channels“. In IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings. IEEE, 1991. http://dx.doi.org/10.1109/infcom.1991.147562.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Multiaccess channel"

Gallager, R. G. A Perspective on Multiaccess Channels. Fort Belvoir, VA: Defense Technical Information Center, Januar 1985. http://dx.doi.org/10.21236/ada150183.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!