Готові списки джерел за темами / Reduced-complexity receiver

Добірка наукової літератури з теми "Reduced-complexity receiver"

Автор: Grafiati
Опубліковано: 26 січня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Reduced-complexity receiver".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Зміст

  1. Статті в журналах
  2. Дисертації
  3. Книги
  4. Частини книг
  5. Тези доповідей конференцій

Статті в журналах з теми "Reduced-complexity receiver":

1

Lin, Tsui-Tsai, and Tung-Chou Chen. "Complexity-Reduced Receiver for Universal Filtered Multicarrier Systems." IEEE Wireless Communications Letters 8, no. 6 (December 2019): 1667–70. http://dx.doi.org/10.1109/lwc.2019.2935191.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Badiu, Mihai-Alin, C. N. Manchon, and B. H. Fleury. "Message-Passing Receiver Architecture with Reduced-Complexity Channel Estimation." IEEE Communications Letters 17, no. 7 (July 2013): 1404–7. http://dx.doi.org/10.1109/lcomm.2013.060513.130733.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Park, S. Y., S. K. Choi, and C. G. Kang. "Complexity-reduced iterative MAP receiver for spatial multiplexing systems." IEE Proceedings - Communications 152, no. 4 (2005): 432. http://dx.doi.org/10.1049/ip-com:20041140.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Tsukamoto, Masaki, and Yasunori Iwanami. "Complexity Reduced MIMO Interleaved SC-FDMA Receiver with Iterative Detection." International Journal of Communications, Network and System Sciences 07, no. 12 (2014): 508–18. http://dx.doi.org/10.4236/ijcns.2014.712051.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Ucuncu, Ali Bulut, Gokhan M. Guvensen, and Ali Ozgur Yilmaz. "A Reduced Complexity Ungerboeck Receiver for Quantized Wideband Massive SC-MIMO." IEEE Transactions on Communications 69, no. 7 (July 2021): 4921–36. http://dx.doi.org/10.1109/tcomm.2021.3071537.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

YOSHIKAWA, Shogo, Satoshi DENNO, and Masahiro MORIKURA. "Complexity Reduced Lattice-Reduction-Aided MIMO Receiver with Virtual Channel Detection." IEICE Transactions on Communications E96.B, no. 1 (2013): 263–70. http://dx.doi.org/10.1587/transcom.e96.b.263.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Zihua Guo and K. B. Letaief. "A low complexity reduced-rank MMSE receiver for DS/CDMA communications." IEEE Transactions on Wireless Communications 2, no. 1 (January 2003): 59–68. http://dx.doi.org/10.1109/twc.2002.806364.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Abu-Shaban, Zohair, Hani Mehrpouyan, Bhavani Shankar M. R., and Björn Ottersten. "Reduced complexity satellite broadcast receiver with interference mitigation in correlated noise." International Journal of Satellite Communications and Networking 36, no. 5 (May 17, 2018): 402–15. http://dx.doi.org/10.1002/sat.1243.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

ElHelaly, Alaa, Ahmed H. Mehana, and Mohammad M. Khairy. "Reduced-Complexity Receiver for Free-Space Optical Communication over Orbital Angular Momentum Partial-Pattern Modes." International Journal of Antennas and Propagation 2018 (2018): 1–11. http://dx.doi.org/10.1155/2018/8514705.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
This paper explores the effect of a partial-pattern receiver for transmitted orbital angular momentum (OAM) multimodes included in the Laguerre-Gaussian beam propagating under non-Kolomogorov weak-to-moderate turbulence on the achievable capacity and the error rates with introduced controlled parameters. We deduce the necessary conditions for reducing the receiver’s area to guarantee that the modes are decoupled when the area is reduced. Furthermore, we derive the conditions at which area reduction yields a performance gain over the complete-area reception. For that, some use cases are introduced and discussed and the basic building block for multibeam MIMO receivers with a reduced area is developed and analyzed.
10

Xu, Feng, and Yang Gao. "A Complexity Reduced Frequency Domain Receiver for Galileo and GPS L1 Signals." Journal of Global Positioning Systems 8, no. 2 (December 2009): 124–34. http://dx.doi.org/10.5081/jgps.8.2.124.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел
Також вас можуть зацікавити розширені добірки на тему "Reduced-complexity receiver" для конкретних типів джерел:
Статті в журналах

Дисертації з теми "Reduced-complexity receiver":

1

Ozgur, Soner. "Reduced Complexity Sequential Monte Carlo Algorithms for Blind Receivers." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/10518.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Monte Carlo algorithms can be used to estimate the state of a system given relative observations. In this dissertation, these algorithms are applied to physical layer communications system models to estimate channel state information, to obtain soft information about transmitted symbols or multiple access interference, or to obtain estimates of all of these by joint estimation. Initially, we develop and analyze a multiple access technique utilizing mutually orthogonal complementary sets (MOCS) of sequences. These codes deliberately introduce inter-chip interference, which is naturally eliminated during processing at the receiver. However, channel impairments can destroy their orthogonality properties and additional processing becomes necessary. We utilize Monte Carlo algorithms to perform joint channel and symbol estimation for systems utilizing MOCS sequences as spreading codes. We apply Rao-Blackwellization to reduce the required number of particles. However, dense signaling constellations, multiuser environments, and the interchannel interference introduced by the spreading codes all increase the dimensionality of the symbol state space significantly. A full maximum likelihood solution is computationally expensive and generally not practical. However, obtaining the optimum solution is critical, and looking at only a part of the symbol space is generally not a good solution. We have sought algorithms that would guarantee that the correct transmitted symbol is considered, while only sampling a portion of the full symbol space. The performance of the proposed method is comparable to the Maximum Likelihood (ML) algorithm. While the computational complexity of ML increases exponentially with the dimensionality of the problem, the complexity of our approach increases only quadratically. Markovian structures such as the one imposed by MOCS spreading sequences can be seen in other physical layer structures as well. We have applied this partitioning approach with some modification to blind equalization of frequency selective fading channel and to multiple-input multiple output receivers that track channel changes. Additionally, we develop a method that obtains a metric for quantifying the convergence rate of Monte Carlo algorithms. Our approach yields an eigenvalue based method that is useful in identifying sources of slow convergence and estimation inaccuracy.
2

Wang, Houhao. "Reduced-complexity noncoherent receiver for GMSK signals." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ63034.pdf.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Deepak, Virat. "Partitioned Reduced Complexity Multiuser Detectors For Code Division Multiple Access Systems." Ohio University / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1127143401.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Sen, Indranil. "Bandwidth Efficient Reduced-Complexity MT-DS-SS via Reduced Subcarrier Frequency Spacing." Ohio University / OhioLINK, 2004. http://www.ohiolink.edu/etd/view.cgi?ohiou1091107331.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Ugurlu, Bilal. "Receiver Design For A Class Of New Pulse Shapes For Cpm Signals." Master's thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12614093/index.pdf.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Recently, a study on obtaining better Euclidean distance for CPM (Continuous Phase Modulation) signals that fit well-known GSM spectral envelope has been carried out, and significant performance improvements were obtained. Two new pulse shapes, which are represented using 8th degree polynomials, were optimized to give the best error performance under the constraint that the PSD stays below GSM spectral standards. However, the approach uses parameters that cause the number of states to increase considerably, and thus yielding high complexity for receiver implementation. In this thesis, a study on finding a feasible receiver design that can provide a performance with acceptable degradation but affordable complexity is carried out for those new pulse shapes. After a survey about complexity reduction techniques, a decision is made to go on with a receiver structure based on Laurent Decomposition (LD) of phase modulated signals. Unlike other complexity reduction techniques, usage of LD based receivers permits reduction in both the number of matched filters and trellis states. Throughout the study, different numbers of matched filters and trellis states were used in LD based receivers for the new pulse shapes, and good results are obtained. For the pulse shape with pulse length L = 3, about a gain of 0.93dB in power is achieved by only 2 matched filters and 14 trellis states. For the case where L = 7, approximately a gain of 2.25dB is achieved with only 8 matched filters and 56 states, whereas 896 matched filters and 448 states are needed in the optimum case without complexity reduction.
6

Skelton, Benjamin C. "Reduced complexity asynchronous multi-user receivers for spread spectrum multiple access." Thesis, University of Canterbury. Electrical and Electronic Engineering, 2000. http://hdl.handle.net/10092/5743.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
One of the major problems facing the implementation of multi-user detectors in a mobile radio multiple access environment is the complexity of the receiver structure. This thesis addresses this problem and develops three related receiver structures based on the maximum likelihood multi-user detector. They allow a degradation in performance to be traded for a reduction in the complexity of the receiver. The first family of reduced complexity receivers is derived considering a serial partitioning of the maximum likelihood trellis. A receiver with two degrees of freedom is developed by the application of reduced state sequence estimation (RSSE) techniques to the first receiver. A maximum-ratio combining-like detector with self-noise cancellation is derived for the multi-path fading channel. All three receiver structures allow for significant reductions in complexity with respect to the maximum likelihood detector with only modest performance reductions.
7

Abou, Faycal Ibrahim C. (Ibrahim Chafik). "An information theoretic study of reduced-complexity receivers for intersymbol interference channels." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/8922.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.
Includes bibliographical references (leaves 105-108).
The complexity of the optimal receiver for communications over a discrete-time additive Gaussian intersymbol interference channel typically grows exponentially with the duration of the channel impulse response. Consequently, practical sub-optimal receivers are often designed as though the channel impulse response were shorter than it is. While previous studies on the performance of such receivers have mainly focused on bit error rates in uncoded systems, this thesis takes a different approach to the problem. We adopt an information theoretic approach and study the rates that are achievable in the Shannon sense over the true channel with the given, possibly sub-optimal, decoding rule. One can establish that, under such mismatch conditions, the achievable rates are bounded in the Signal-to-Noise Ratio necessitating the use of a linear equalizer at the front end of the decoder. We derive the achievable rates for these schemes and optimize under complexity constraints the design of the equalizer and the receiver. Overall, two ensemble of codes are considered: the Independent Identically Distributed Gaussian ensemble and the "spherical" ensemble, where codewords are uniformly distributed over a sphere.
by Ibrahim C. Abou Faycal.
Ph.D.
8

Kasan, Karim. "Performance of a new single sideband (SSB) continuous phase modulation (CPM)." Thesis, CentraleSupélec, 2021. http://www.theses.fr/2021CSUP0010.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Dans cette thèse, nous étudions la modulation par déplacement de fréquence à bande latérale unique (SSB-FSK), un schéma de modulation de phase continue (CPM) ayant, par essence, la caractéristique original du spectre à bande latérale unique (BLU). Tout d’abord, nous présentons l’origine du signal à partir de la physique quantique. Ensuite, nous proposons un détecteur de séquence à maximum de vraisemblance (MLSD) simplifié pour les schémas CPM conventionnels, basé sur le réarrangement montré dans le modèle de signal SSB-FSK. Pour exploiter pleinement les performances de la SSB-FSK, nous examinons la probabilité d’erreur du signal, l’occupation de la bande passante et la complexité du récepteur. Étant donné que différentes mesures de performance sont prises en compte, nous avons utilisé une optimisation multi-objectifs pour obtenir de nouveaux schémas SSB-FSK plus performants que les schémas CPM classiques. En outre, nous proposons une solution pour simplifier la complexité des signaux SSB-FSK en utilisant la décomposition de la modulation d’amplitude d’impulsion (PAM). Les impulsions PAM ont été obtenues à partir d’un algorithme que nous avons développé. En outre, nous proposons une séquence d’entraînement générique optimale pour l’estimation conjointe de la synchronisation des symboles, du décalage de fréquence et de la phase de la porteuse pour la synchronisation en mode burst. La séquence d’entraînement a été obtenue en utilisant les bornes de Cramér-Rao
In this PhD thesis, we investigate the single-sideband frequency shift keying (SSB-FSK), a continuous phase modulation (CPM) scheme having, by essence, the original feature of the single-sideband (SSB) spectrum. First, we present the origin of the signal from quantum physics. Then, we propose a simplified Maximum likelihood sequence detection (MLSD) detector for conventional CPM schemes based on the rearrangement shown in the SSB-FSK signal model. To fully exploit the SSB-FSK performance, we examine the signal error probability, bandwidth occupancy, and receiver complexity. Since different performance metrics are considered, we employed a multi-objective optimization to achieve new SSB-FSK schemes that outperform conventional CPM schemes. Moreover, we propose a solution to simplify the complexity of SSB-FSK signals using the pulse amplitude modulation (PAM) decomposition. The PAM pulses were achieved from an algorithm we developed. Furthermore, we offer an optimum generic training sequence for the joint estimation of symbol timing, frequency offset, and carrier phase for burst mode synchronization. The training sequence was obtained using the Cramér-Rao bounds
9

Yeh, Wan-Chen, and 葉宛真. "Multimode Antenna Selection with Reduced Complexity for Zero-forcing Receiver." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/3c2brd.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
碩士
國立交通大學
電控工程研究所
98
In this thesis, we proposed reduced-complexity algorithms to select appropriate transmit antennas for MIMO system with zero-forcing receiver. Two criteria for selecting antennas are derived: achievable data rate maximization and average symbol error rate minimization. In addition, bit allocation is also applied to improve the performance. The computational complexity can be reduced by simplifying search strategy and matrix inversion. The computational complexity analysis and simulation results are given to see that the advantages of the proposed algorithm.
10

Bai, Cheng-Zong, and 白承宗. "New Reduced-Complexity Receiver Designs for DS-CDMA Downlink Systems." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/88973741016558065468.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
碩士
國立臺灣大學
電信工程學研究所
95
In recent years, DS-CDMA systems have gained its popularity and become the most widely used mobile communication systems. However, as the transmission bandwidth increases, one of the primary challenges in wireless communication is to overcome the effect of multipath channel. The G-RAKE receiver is capable to mitigate the interference that is introduced by the multipath channel. The main defect of a G-RAKE is that one needs to evaluate a large matrix inversion. In this thesis, we propose a new MRC-MMSE-RAKE receiver which is a compromise between conventional RAKE and G-RAKE receivers. The signal fingers are placed to collect signal energy and combined with MRC. Additional noise fingers are introduced in order to suppress the interference of the MRC output by the MMSE interference estimation. We also propose an efficient finger selection algorithm (EFSA) to select valuable noise fingers. In addition, we extend the RAKE receivers to the receive diversity scheme and the MIMO transmission. From the simulation results, the MRC-MMSE-RAKE may outperform the G-RAKE with lower complexity, and the proposed EFSA can be utilized to select noise fingers effectively. On the other hand, we also design two types of MMSE equalizers for DS-CDMA downlink systems. We propose using the Neumann series perturbation (NSP) method and the Rayleigh-Schrödinger perturbation (RSP) method to correct the FFT-based approximation in matrix inversion. Besides, an algorithm for finding the RSP correction is also derived. By analyzing the distribution of SINR, it is found that the RSP is able to reduce the probability of the occurrence of deep fading events, whereas the NSP can not be. Several strategies were proposed to enhance the statistical characteristic of SINR in RSP. From the simulation results, the RSP is able to correct the inaccuracy of the FFT-based approximation and it may achieve the performance of the optimal MMSE equalizer.

Книги з теми "Reduced-complexity receiver":

1

Wang, Houhao. Reduced-complexity noncoherent receiver for GMSK signals. Ottawa: National Library of Canada, 2001.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

O'Reilly, Paul. An adaptive reduced complexity MLSE receiver for GSM mobile radio. Dublin: University College Dublin, 1996.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "Reduced-complexity receiver":

1

Gharaee, Hossein, Abdolreza Nabavi, and Jalil ("Joe") Etminan. "Performance and Complexity Evaluation of OTR-UWB Receiver." In Networking and Telecommunications, 1945–58. IGI Global, 2010. http://dx.doi.org/10.4018/978-1-60566-986-1.ch123.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
This article presents a new transmitted reference UWB receiver, which utilizes the orthogonal property of even and odd order derivatives of Gaussian pulses in neighboring chips for synchronization. This system, referred to as orthogonal TR-UWB (OTR-UWB), employs only a single spreading code, which results in much lower mean detection time compared to DS-UWB systems. The hardware complexity for OTR-UWB receiver is significantly reduced against conventional TR-UWB systems. In addition, simulation results show that BER performance is improved, while the new system is capable of supporting higher data rates. Also, this article presents the FPGA implementation of OTR-UWB, with a bit-rate of 25Mb/s without using equalizer. In addition, we present the DSP algorithm of baseband. Hardware of this system is implemented on two different FPGAs from ALTERA and XILINX, CycloneII (EP2C35F672C6) and Spartan 3 (3s4000fg676-5). Gate estimation and power analysis are performed by Quartus II 7.2 (ALTERA) and ISE 8.1 (XILINX) softwares.
2

Priyatam, Kumar, R. M. Banakar, and B. Shankaranand. "ISI Cancellation in 4G Wireless Mobiles." In Handbook of Research in Mobile Business, Second Edition, 354–67. IGI Global, 2009. http://dx.doi.org/10.4018/978-1-60566-156-8.ch033.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
Physical layer issues of broadband wireless communication systems form the bottleneck in providing fast and reliable communication over wireless channel. Critical performance limiting challenges are time selective fading channels, frequency selective fading channels, noise, inter symbol interference (ISI), inter carrier interference, power, and bandwidth. Addressing these challenges of wireless broadband communication systems, one can provide faster data processing with lower computational complexity, higher data throughput, and improved performance in terms of bit error rate (BER). In this chapter an effective technique (SISO estimation) to handle interference cancellation is developed. ISI is caused by multi-path propagation. It can be reduced by using a channel equalizer which provides the receiver with the prior knowledge of the channel. Channel estimation is a technique to acquire behavior of the channel. Accuracy of the channel estimation improves the system performance. At BER of 10-4 SISO estimator provide an improvement of 2dB as compared with MMSE DFE estimator.
3

Xu, Junjun, Haiyong Luo, Fang Zhao, Rui Tao, Yiming Lin, and Hui Li. "The WiMap." In Global Applications of Pervasive and Ubiquitous Computing, 31–41. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-2645-4.ch004.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Анотація:
As positioning technology is an important foundation of the Internet of Things, a dynamic indoor WLAN localization system is proposed in this paper. This paper mainly concentrates on the design and implementation of the WiMap-a dynamic indoor WLAN localization system, which employs grid-based localization method using RSS (received signal strength). To achieve high localization accuracy and low computational complexity, Gaussian mixture model is applied to approximate the signal distribution and a ROI (region of interest) is defined to limit the search region. The authors also discuss other techniques like AP selection and threshold control, which affects the localization accuracy. The experimental results indicate that an accuracy of 3m with 73.8% probability can be obtained in WiMap. Moreover, the running time is reduced greatly with limited ROI method.

Тези доповідей конференцій з теми "Reduced-complexity receiver":

1

Murphy, K., and S. McGrath. "Architecture for a reduced complexity UWB receiver." In IET Irish Signals and Systems Conference (ISSC 2006). IEE, 2006. http://dx.doi.org/10.1049/cp:20060429.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Zhongpeng Wang. "Reduced complexity receiver based on MIMO systems." In IET International Conference on Wireless Mobile and Multimedia Networks Proceedings (ICWMMN 2006). IEE, 2006. http://dx.doi.org/10.1049/cp:20061363.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Nedelcu, Andrei, Radu Lupoaie, Andrei A. Enescu, Cristian Anghel, and Constantin Paleologu. "Spatial Multiplexing Turbo Receiver with Reduced Complexity." In 2009 Third International Conference on Sensor Technologies and Applications (SENSORCOMM). IEEE, 2009. http://dx.doi.org/10.1109/sensorcomm.2009.82.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Oliaei, Omid. "Beamforming MIMO Receiver with Reduced Hardware Complexity." In 2007 IEEE International Symposium on Circuits and Systems. IEEE, 2007. http://dx.doi.org/10.1109/iscas.2007.377897.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Thian, Boon Sim, and Andrea Goldsmith. "A Reduced-Complexity MIMO Receiver via Channel Ordering." In GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference. IEEE, 2009. http://dx.doi.org/10.1109/glocom.2009.5426105.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Miller, Craig, Wei Liu, and Richard J. Langley. "Reduced Complexity MIMO Receiver with Real-Valued Beamforming." In 2015 IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing (CIT/IUCC/DASC/PICOM). IEEE, 2015. http://dx.doi.org/10.1109/cit/iucc/dasc/picom.2015.8.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Bursalioglu, Ozgun Y., Haralabos C. Papadopoulos, and Carl-Erik W. Sundberg. "Reduced-Complexity Adaptive Receiver Algorithms for 4G SU-MIMO Systems." In 2008 IEEE 68th Vehicular Technology Conference (VTC 2008-Fall). IEEE, 2008. http://dx.doi.org/10.1109/vetecf.2008.92.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Salih-Alj, Yassine, Francois Gagnon, and Rene Landry. "A systolic-based architecture for a novel reduced-complexity GPS receiver." In 2012 International Conference on Computer Systems and Industrial Informatics (ICCSII 2012). IEEE, 2012. http://dx.doi.org/10.1109/iccsii.2012.6454625.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Wang, Jun, and Shaoqian Li. "Reliability based Reduced-Complexity MMSE Soft Interference Cancellation Mimo Turbo Receiver." In 2007 IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications. IEEE, 2007. http://dx.doi.org/10.1109/pimrc.2007.4394292.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Yoshikawa, Shogo, Satoshi Denno, and Masahiro Morikura. "Complexity reduced lattice-reduction-aided MIMO receiver with virtual channel detection." In 2012 6th International Conference on Signal Processing and Communication Systems (ICSPCS 2012). IEEE, 2012. http://dx.doi.org/10.1109/icspcs.2012.6507940.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

До бібліографії