Wireless Connectivity: An Intuitive And Fundamental Guide (Registro nro. 62909)
[ vista simple ]
000 -CABECERA | |
---|---|
campo de control de longitud fija | 00619nam a2200193Ia 4500 |
003 - IDENTIFICADOR DEL NÚMERO DE CONTROL | |
campo de control | OSt |
005 - FECHA Y HORA DE LA ÚLTIMA TRANSACCIÓN | |
campo de control | 20181023043908.0 |
008 - DATOS DE LONGITUD FIJA--INFORMACIÓN GENERAL | |
campo de control de longitud fija | 24418b pe ||||| |||| 00| 0 spa d |
040 ## - FUENTE DE LA CATALOGACIÓN | |
Centro/agencia transcriptor | Transcribing agency |
082 ## - NÚMERO DE LA CLASIFICACIÓN DECIMAL DEWEY | |
Número de clasificación | 005.43.POPO.00 |
100 ## - ENTRADA PRINCIPAL--NOMBRE DE PERSONA | |
Nombre de persona | Popovski, Petar |
100 ## - ENTRADA PRINCIPAL--NOMBRE DE PERSONA | |
Término indicativo de función/relación | Autor |
245 #0 - MENCIÓN DE TÍTULO | |
Título | Wireless Connectivity: An Intuitive And Fundamental Guide |
250 ## - MENCIÓN DE EDICIÓN | |
Mención de edición | 1A. ed |
260 ## - PUBLICACIÓN, DISTRIBUCIÓN, ETC. | |
Lugar de publicación, distribución, etc. | SINGAPORE |
260 ## - PUBLICACIÓN, DISTRIBUCIÓN, ETC. | |
Nombre del editor, distribuidor, etc. | WILEY |
260 ## - PUBLICACIÓN, DISTRIBUCIÓN, ETC. | |
Fecha de publicación, distribución, etc. | 2020 |
300 ## - DESCRIPCIÓN FÍSICA | |
Extensión | 384 |
300 ## - DESCRIPCIÓN FÍSICA | |
Dimensiones | 25.0 |
505 ## - NOTA DE CONTENIDO CON FORMATO | |
Nota de contenido con formato | Foreword <br/>. -- Acknowledgments <br/>. -- Acronyms <br/>. -- 1 An Easy Introduction To The Shared Wireless Medium <br/>. -- 1.1 How To Build a Simple Model For Wireless Communication<br/>. -- 1.1.1 Which Features We Want From The Model <br/>. -- 1.1.2 Communication Channel With Collisions <br/>. -- 1.1.3 Trade-Offs In The Collision Model <br/>. -- 1.2 The First Contact <br/>. -- 1.2.1 Hierarchy Helps To Establish Contact <br/>. -- 1.2.2 Wireless Rendezvous Without Help <br/>. -- 1.2.3 Rendezvous With Full-Duplex Devices <br/>. -- 1.3 Multiple Access With Centralized Control<br/>. -- 1.3.1 a Frame For Time Division <br/>. -- 1.3.2 Frame Header For Flexible Time Division <br/>. -- 1.3.3 a Simple Two-Way System That Works Under The Collision Model<br/>. -- 1.3.4 Still Not a Practical Tdma System <br/>. -- 1.4 Making Tdma Dynamic <br/>. -- 1.4.1 Circuit-Switched Versus Packet-Switched Operation <br/>. -- 1.4.2 Dynamic Allocation Of Resources To Users <br/>. -- 1.4.3 Short Control Packets And The Idea Of Reservation<br/>. -- 1.4.4 Half-Duplex Versus Full-Duplex In Tdma <br/>. -- 1.5 Chapter Summary <br/>. -- 1.6 Further Reading <br/>. -- 1.7 Problems And Reflections <br/>. -- 2 Random Access: How To Talk In Crowded Dark Room <br/>. -- 2.1 Framed Aloha <br/>. -- 2.1.1 Randomization That Maximizes The Aloha Throughput <br/>. -- 2.2 Probing <br/>. -- 2.2.1 Combining Aloha And Probing <br/>. -- 2.3 Carrier Sensing <br/>. -- 2.3.1 Randomization And Spectrum Sharing <br/>. -- 2.3.2 An Idle Slot Is Cheap <br/>. -- 2.3.3 Feedback To The Transmitter <br/>. -- 2.4 Random Access And Multiple Hops<br/>. -- 2.4.1 Use Of Reservation Packets In Multi-Hop <br/>. -- 2.4.2 Multiple Hops And Full-Duplex <br/>. -- 2.5 Chapter Summary <br/>. -- 2.6 Further Reading <br/>. -- 2.7 Problems And Reflections <br/>. -- 3 Access Beyond The Collision Model<br/>. -- 3.1 Distance Gets Into The Model <br/>. -- 3.1.1 Communication Degrades As The Distance Increases <br/>. -- 3.1.2 How To Make The Result Of a Collision Dependent On The Distance <br/>. -- 3.2 Simplified Distance Dependence: a Double Disk Model <br/>. -- 3.3 Downlink Communication With The Double Disk Model <br/>. -- 3.3.1 a Cautious Example Of a Design That Reaches The Limits Of The Model <br/>. -- 3.4 Uplink Communication With The Double Disk Model <br/>. -- 3.4.1 Uplink That Uses Multi-Packet Reception <br/>. -- 3.4.2 Buffered Collisions For Future Use <br/>. -- 3.4.3 Protocols That Use Packet Fractions<br/>. -- <br/>. -- 3.5 Unwrapping The Packets <br/>. -- 3.6 Chapter Summary <br/>. -- 3.7 Further Reading <br/>. -- 3.8 Problems And Reflections <br/>. -- 4 The Networking Cake: Layering And Slicing <br/>. -- 4.1 Layering For a One-Way Link <br/>. -- 4.1.1 Modules And Their Interconnection <br/>. -- 4.1.2 Three Important Concepts In Layering<br/>. -- 4.1.3 An Example Of a Two-Layer System <br/>. -- 4.2 Layers And Cross-Layer <br/>. -- 4.3 Reliable And Unreliable Service From a Layer <br/>. -- 4.4 Black Box Functionality For Different Communication Models <br/>. -- 4.5 Standard Layering Models <br/>. -- 4.5.1 Connection Versus Connectionless <br/>. -- 4.5.2 Functionality Of The Standard Layers <br/>. -- 4.5.3 a Very Brief Look At The Network Layer <br/>. -- 4.6 An Alternative Wireless Layering <br/>. -- 4.7 Cross-Layer Design For Multiple Hops <br/>. -- 4.8 Slicing Of The Wireless Communication Resources <br/>. -- 4.8.1 Analog, Digital, Sliced <br/>. -- 4.8.2 a Primer On Wireless Slicing <br/>. -- 4.8.2.1 Orthogonal Wireless Slicing <br/>. -- 4.8.2.2 Non-Orthogonal Wireless Slicing <br/>. -- 4.9 Chapter Summary <br/>. -- 4.10 Further Reading <br/>. -- 4.11 Problems And Reflections <br/>. -- 5 Packets Under The Looking Glass: Symbols And Noise <br/>. -- 5.1 Compression, Entropy, And Bit <br/>. -- 5.1.1 Obtaining Digital Messages By Compression <br/>. -- 5.1.2 a Bit Of Information <br/>. -- 5.2 Baseband Modules Of The Communication System <br/>. -- 5.2.1 Mapping Bits To Baseband Symbols Under Simplifying Assumptions <br/>. -- 5.2.2 Challenging The Simplifying Assumptions About The Baseband <br/>. -- 5.3 Signal Constellations And Noise <br/>. -- 5.3.1 Constellation Points And Noise Clouds <br/>. -- 5.3.2 Constellations With Limited Average Power <br/>. -- 5.3.3 Beyond The Simple Setup For Symbol Detection <br/>. -- 5.3.4 Signal-To-Noise Ratio (Snr) <br/>. -- 5.4 From Bits To Symbols <br/>. -- 5.4.1 Binary Phase Shift Keying (Bpsk) <br/>. -- 5.4.2 Quaternary Phase Shift Keying (Qpsk) <br/>. -- 5.4.3 Constellations Of Higher Order <br/>. -- 5.4.4 Generalized Mapping To Many Symbols <br/>. -- 5.5 Symbol-Level Interference Models <br/>. -- 5.5.1 Advanced Treatment Of Collisions Based On a Baseband Model <br/>. -- 5.6 Weak And Strong Signals: New Protocol Possibilities <br/>. -- 5.6.1 Randomization Of Power <br/>. -- 5.6.2 Other Goodies From The Baseband Model <br/>. -- 5.7 How To Select The Data Rate <br/>. -- 5.7.1 a Simple Relation Between Packet Errors And Distance <br/>. -- 5.7.2 Adaptive Modulation <br/>. -- 5.8 Superposition Of Baseband Symbols <br/>. -- 5.8.1 Broadcast And Non-Orthogonal Access <br/>. -- 5.8.2 Unequal Error Protection (Uep) <br/>. -- 5.9 Communication With Unknown Channel Coefficients <br/>. -- 5.10 Chapter Summary <br/>. -- 5.11 Further Reading <br/>. -- 5.12 Problems And Reflections <br/>. -- 6 a Mathematical View On a Communication Channel <br/>. -- 6.1 a Toy Example: The Pigeon Communication Channel <br/>. -- 6.1.1 Specification Of a Communication Channel <br/>. -- 6.1.2 Comparison Of The Information Carrying Capability Of Mathematical Channels<br/>. -- 6.1.3 Assumptions And Notations <br/>. -- 6.2 Analog Channels With Gaussian Noise <br/>. -- 6.2.1 Gaussian Channel <br/>. -- 6.2.2 Other Analog Channels Based On The Gaussian Channel <br/>. -- 6.3 The Channel Definition Depends On Who Knows What <br/>. -- 6.4 Using Analog To Create Digital Communication Channels <br/>. -- 6.4.1 Creating Digital Channels Through Gray Mapping <br/>. -- 6.4.2 Creating Digital Channels Through Superposition <br/>. -- 6.5 Transmission Of Packets Over Communication Channels <br/>. -- 6.5.1 Layering Perspective Of The Communication Channels <br/>. -- 6.5.2 How To Obtain Throughput That Is Not Zero <br/>. -- 6.5.3 Asynchronous Packets And Transmission Of "Nothing" <br/>. -- 6.5.4 Packet Transmission Over a Ternary Channel <br/>. -- 6.6 Chapter Summary <br/>. -- 6.7 Further Reading <br/>. -- 6.8 Problems And Reflections <br/>. -- 7 Coding For Reliable Communication <br/>. -- 7.1 Some Coding Ideas For The Binary Symmetric Channel <br/>. -- 7.1.1 a Channel Based On Repetition Coding <br/>. -- 7.1.2 Channel Based On Repetition Coding With Erasures <br/>. -- 7.1.3 Coding Beyond Repetition <br/>. -- 7.1.4 An Illustrative Comparison Of The Bsc Based Channels <br/>. -- 7.2 Generalization Of The Coding Idea <br/>. -- 7.2.1 Maximum Likelihood (Ml) Decoding <br/>. -- 7.3 Linear Block Codes For The Binary Symmetric Channel <br/>. -- 7.4 Coded Modulation As a Layered Subsystem <br/>. -- 7.5 Retransmission As a Supplement To Coding <br/>. -- 7.5.1 Full Packet Retransmission <br/>. -- 7.5.2 Partial Retransmission And Incremental Redundancy <br/>. -- 7.6 Chapter Summary <br/>. -- 7.7 Further Reading <br/>. -- 7.8 Problems And Reflections <br/>. -- 8 Information-Theoretic View On Wireless Channel Capacity <br/>. -- 8.1 It Starts With The Law Of Large Numbers <br/>. -- 8.2 a Useful Digression Into Source Coding <br/>. -- 8.3 Perfectly Reliable Communication And Channel Capacity <br/>. -- 8.4 Mutual Information And Its Interpretations <br/>. -- 8.4.1 From a Local To a Global Property <br/>. -- 8.4.2 Mutual Information In Some Actual Communication Setups <br/>. -- 8.5 The Gaussian Channel And The Popular Capacity Formula <br/>. -- 8.5.1 The Concept Of Entropy In Analog Channels <br/>. -- 8.5.2 The Meaning Of "Shannon’S Capacity Formula" <br/>. -- 8.5.3 Simultaneous Usage Of Multiple Gaussian Channels <br/>. -- 8.6 Capacity Of Fading Channels <br/>. -- 8.6.1 Channel State Information Available At The Transmitter<br/>. -- 8.6.2 Example: Water Filling For Binary Fading <br/>. -- 8.6.3 Water Filling For Continuously Distributed Fading<br/>. -- 8.6.4 Fast Fading And Further Remarks On Channel Knowledge <br/>. -- 8.6.5 Capacity When The Transmitter Does Not Know The Channel <br/>. -- 8.6.5.1 Channel With Binary Inputs And Binary Fading <br/>. -- 8.6.5.2 Channels With Gaussian Noise And Fading <br/>. -- 8.6.6 Channel Estimation And Knowledge <br/>. -- 8.7 Chapter Summary <br/>. -- 8.8 Further Reading <br/>. -- 8.9 Problems And Reflections <br/>. -- 9 Time And Frequency In Wireless Communications <br/>. -- 9.1 Reliable Communication Requires Transmission Of Discrete Values <br/>. -- 9.2 Communication Through a Waveform: An Example <br/>. -- 9.3 Enter The Frequency <br/>. -- 9.3.1 Infinitely Long Signals And True Frequency <br/>. -- 9.3.2 Bandwidth And Time-Limited Signals <br/>. -- 9.3.3 Parallel Communication Channels <br/>. -- 9.3.4 How Frequency Affects The Notion Of Multiple Access <br/>. -- 9.4 Noise And Interference <br/>. -- 9.4.1 Signal Power And Gaussian White Noise <br/>. -- 9.4.2 Interference Between Non-Orthogonal Frequencies <br/>. -- 9.5 Power Spectrum And Fourier Transform <br/>. -- 9.6 Frequency Channels, Finally <br/>. -- 9.6.1 Capacity Of a Bandlimited Channel <br/>. -- 9.6.2 Capacity And Ofdm Transmission <br/>. -- 9.6.3 Frequency For Multiple Access And Duplexing <br/>. -- 9.7 Code Division And Spread Spectrum <br/>. -- 9.7.1 Sharing Synchronized Resources With Orthogonal Codes <br/>. -- 9.7.2 Why Go Through The Trouble Of Spreading? <br/>. -- 9.7.3 Mimicking The Noise And Covert Communication <br/>. -- 9.7.4 Relation To Random Access <br/>. -- 9.8 Chapter Summary <br/>. -- 9.9 Further Reading <br/>. -- 9.10 Problems And Reflections <br/>. -- 10 Space In Wireless Communications <br/>. -- 10.1 Communication Range And Coverage Area <br/>. -- 10.2 The Myth About Frequencies That Propagate Badly In Free Space <br/>. -- 10.3 The World View Of An Antenna <br/>. -- 10.3.1 Antenna Directivity <br/>. -- 10.3.2 Directivity Changes The Communication Models<br/>. -- 10.4 Multipath And Shadowing: Space Is Rarely Free <br/>. -- 10.5 The Final Missing Link In The Layering Model <br/>. -- 10.6 The Time-Frequency Dynamics Of The Radio Channel <br/>. -- 10.6.1 How a Time-Invariant Channel Distorts The Received Signal <br/>. -- 10.6.2 Frequency Selectivity, Multiplexing, And Diversity <br/>. -- 10.6.3 Time-Variant Channel Introduces New Frequencies <br/>. -- 10.6.4 Combined Time-Frequency Dynamics <br/>. -- 10.7 Two Ideas To Deal With Multipath Propagation And delay Spread <br/>. -- 10.7.1 The Wideband Idea: Spread Spectrum And a Rake Receiver <br/>. -- 10.7.2 The Narrowband Idea: Ofdm And a Guard Interval <br/>. -- 10.8 Statistical Modeling Of Wireless Channels <br/>. -- 10.8.1 Fading Models: Rayleigh And Some Others<br/>. -- 10.8.2 Randomness In The Path Loss <br/>. -- 10.9 Reciprocity And How To Use It <br/>. -- 10.10 Chapter Summary <br/>. -- 10.11 Further Reading <br/>. -- 10.12 Problems And Reflections <br/>. -- 11 Using Two, More, Or a Massive Number Of Antennas <br/>. -- 11.1 Assumptions About The Channel Model And The Antennas <br/>. -- 11.2 Receiving Or Transmitting With a Two-Antenna Device <br/>. -- 11.2.1 Receiver With Two Antennas <br/>. -- 11.2.2 Using Two Antennas At a Knowledgeable Transmitter <br/>. -- 11.2.3 Transmit Diversity <br/>. -- 11.3 Introducing Mimo <br/>. -- 11.3.1 Spatial Multiplexing <br/>. -- 11.4 Multiple Antennas For Spatial Division Of Multiple Users <br/>. -- 11.4.1 Digital Interference-Free Beams: Zero Forcing <br/>. -- 11.4.2 Other Schemes For Precoding And Digital Beamforming <br/>. -- 11.5 Beamforming And Spectrum Sharing <br/>. -- 11.6 What If The Number Of Antennas Is Scaled Massively? <br/>. -- 11.6.1 The Base Station Knows The Channels Perfectly <br/>. -- 11.6.2 The Base Station Has To Learn The Channels <br/>. -- 11.7 Chapter Summary <br/>. -- 11.8 Further Reading <br/>. -- 11.9 Problems And Reflections <br/>. -- 12 Wireless Beyond a Link: Connections And Networks <br/>. -- 12.1 Wireless Connections With Different Flavors <br/>. -- 12.1.1 Coarse Classification Of The Wireless Connections <br/>. -- 12.1.2 The Complex, Multidimensional World Of Wireless Connectivity <br/>. -- 12.2 Fundamental Ideas For Providing Wireless Coverage <br/>. -- 12.2.1 Static Or Moving Infrastructure <br/>. -- 12.2.2 Cells And a Cellular Network <br/>. -- 12.2.3 Spatial Reuse <br/>. -- 12.2.4 Cells Come In Different Sizes <br/>. -- 12.2.5 Two-Way Coverage And Decoupled Access <br/>. -- 12.3 no Cell Is An Island <br/>. -- 12.3.1 Wired And Wireless Backhaul <br/>. -- 12.3.2 Wireless One-Way Relaying And The Half-Duplex Loss <br/>. -- 12.3.3 Wireless Two-Way Relaying: Reclaiming The Half-Duplex Loss <br/>. -- 12.4 Cooperation And Coordination <br/>. -- 12.4.1 Artificial Multipath: Treating The Bs As Yet Another Antenna <br/>. -- 12.4.2 Distributing And Networking The Mimo Concept <br/>. -- 12.4.3 Cooperation Through a Wireless Backhaul <br/>. -- 12.5 Dissolving The Cells Into Clouds And Fog <br/>. -- 12.5.1 The Unattainable Ideal Coverage <br/>. -- 12.5.2 The Backhaul Links Must Have a Finite Capacity <br/>. -- 12.5.3 Noisy Cooperation With a Finite Backhaul <br/>. -- 12.5.4 Access Through Clouds And Fog <br/>. -- 12.6 Coping With External Interference And Other Questions About The Radio Spectrum <br/>. -- 12.6.1 Oblivious Rather Than Selfish <br/>. -- 12.6.2 License To Control Interference <br/>. -- 12.6.3 Spectrum Sharing And Caring <br/>. -- 12.6.4 Duty Cycling, Sensing, And Hopping <br/>. -- 12.6.5 Beyond The Licensed And Unlicensed And Some Final Words <br/>. -- 12.7 Chapter Summary <br/>. -- 12.8 Further Reading <br/>. -- 12.9 Problems And Reflections <br/>. -- Bibliography <br/>. -- Index |
650 ## - PUNTO DE ACCESO ADICIONAL DE MATERIA--TÉRMINO DE MATERIA | |
Término de materia o nombre geográfico como elemento de entrada | INGENIERIA ELECTRONICA |
700 ## - PUNTO DE ACCESO ADICIONAL--NOMBRE DE PERSONA | |
Nombre de persona | Popovski, Petar |
942 ## - ELEMENTOS DE PUNTO DE ACCESO ADICIONAL (KOHA) | |
Tipo de ítem Koha | Libros |
Fuente del sistema de clasificación o colocación | Dewey Decimal Classification |
Estado de retiro | Estado de pérdida | Estado dañado | No para préstamo | Código de colección | Localización permanente | Ubicación/localización actual | Ubicación en estantería | Fecha de adquisición | Coste, precio normal de compra | Total de préstamos | Signatura topográfica completa | Código de barras | Fecha visto por última vez | Número de copia | Coste, precio de reemplazo | Precio válido a partir de | Tipo de ítem Koha |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
BIBCE-CSING (Biblioteca Central - 1er piso) | Biblioteca Central | Biblioteca Central | 04/03/2024 | 0.00 | 005.43.POPO.00 | 73120 | 04/03/2024 | 1e. | 0.00 | 04/03/2024 | Libros |