Spelling suggestions: "subject:"then core"" "subject:"them core""
311 |
An OFDM System Based on Complementary Code CDMA and its Performance AnalysisLin, Che-Min 12 August 2004 (has links)
In this thesis, the feasibility of complete complementary code based OFDM CDMA system is studied. The complete complementary code is composed of several sets of auto-complementary codes, any two of which are cross-complementary codes. The perfect correlation between code sets is the distinguishing feature of complete complementary code.
In this thesis, we designed a new OFDM CDMA system architecture according the property of complete complementary code. The most obvious characteristic is that the bit stream in the new system is no longer aligned one bit after another in time. Instead, a new bit will start only after one chip delay relative to the previous bit, which is spread by an element code of complete complementary code. The proposed new CDMA architecture can offer an MAI-free operation in both down-link (synchronous channel) and up-link (asynchronous channel) transmission under the AWGN channel, because of the use of the CC-codes.
However, due to the special spreading modulator-offset stacking modulator (OSM), we¡¦ll encounter a ¡§ multi-level ¡¨ problem . If we can¡¦t solve this problem , the linear power amplifier will not be able to support the whole system . Hence , we try to clip the multilevel into a smaller magnitude . And also , we try some other mapping methods to solve the multilevel problem .
|
312 |
noneCheng, Jian-Li 22 July 2005 (has links)
NONE
|
313 |
Use of Parallel Computing Techniques to Search for Perfectly Orthogonal Complementary CodesChang, Chin-hsiang 02 September 2005 (has links)
Because using the perfect orthogonal code in CDMA system means elimination of multi-path interference and multiple access interference, we will discuss this aspect in this thesis.
At first, we address a algorithm to how to search a flock of perfect orthogonal code, which consisting of many codes have a characteristic of perfect auto-correlation and perfect cross-correlation to each other. Following, we will compare perfect orthogonal code we find with the present complementary codes include complete complementary code (CCC), super complementary code (SCC), and two-dimensional
orthogonal variable spreading code (2D-OVSF code).
Considering that the run time of searching perfect orthogonal code is long in case of high processing gain (PG), we construct a PC cluster based Linux O.S or Windows O.S for the operation of parallel program to faster our production of perfect orthogonal code.
|
314 |
Research On The Recovery of Semi-Fragile Watermarked ImageSun, Ming-Hong 03 July 2006 (has links)
In recent years, there are more and more researches on semi-fragile watermarking scheme which can resist JPEG compression. But, there are few researches focused on the recovery of semi-fragile watermarked image. Therefore, in this paper, we not only present a semi-fragile watermarking scheme which can resist JPEG compression but use the error correction code (Reed-Solomon Code) to recover the area being malicious manipulated.
At first, we use the semi-fragile watermarking scheme proposed by Lin and Hsieh to detect the counterfeit under the JPEG compression [9]. Its main effect is to resist JPEG compression and to detect the attacked parts without the need of the original image. And then, we will introduce how we use RS code to recover the attacked parts being detected by the semi-fragile watermarking scheme. We use the scheme ¡§Interleaving¡¨ to spread the local pixels to the global area. Next, we encode to each little image block by RS code. The redundant symbols generated by RS code will be signed to be signature attached with the watermarked image. Finally, the receiver can use semi-fragile watermarking scheme to detect attacked part and use the information of the signature to decode these attacked parts. Additionally, we also discuss how to decrease the load of the signature, thus, it can not significant loading of the watermarked image.
|
315 |
New Intra and Inter Shape Coding Algorithms for MPEG-4Bian, Shiu-Hong 09 September 2002 (has links)
In this paper, new intra and inter shape coding algorithms are proposed. The new algorithms are based on chain code. Chain code of an object's contour can be divided into several segments by the smooth contour characteristic. By this property, some techniques can be used for the proposed intra and inter shape coding algorithms. In intra mode, each segment is encoded by specific codes, and the decoding result is lossless. Compared with MPEG-4, M4R, DCC and chain code, the compression ratio is improved. Besides, a new coding scheme is proposed for the inter shape coding. It includes finding break points in a series of chain code, correlation between break points and fine scaling with a tolerant threshold between two similar chain code segments. By detecting the segments, break points can be found. The correlation is performed by computing the curvature difference between break points and contour points. The scaling is a technique for extending or shrinking a segment of chain code. Experimental results show that in the condition of high quality or low bit rate our proposed inter shape coding algorithm obtains better performance than MPEG-4 in compression.
|
316 |
Complementary Coded CDMA and Its Applications in V2V CommunicationsTsao, Yao-Lin 10 September 2007 (has links)
First, the introduction of IEEE 802.11p will be made. There are some issues of IEEE 802.11p under vehicular environment And its OFDM system suffers much loss in time-varying fading channel. To mitigate the performance degradation, we combine Columnwise Complementary Codes with IEEE 802.11p to resist the interference caused by high-speed mobile channel. Finally, we will show some simulation results of CCC-OFDM system compared with the original OFDM system working in the IEEE 802.11p environment.
|
317 |
Angular and Temporal Diversity Combining in CDMA systemsLee, Hung-yang 15 August 2009 (has links)
none
|
318 |
Rhapsody on small processor platformsAndersson, Per-Oskar January 2008 (has links)
<p>Rhapsody is a Model-Driven Development (MDD) tool for embedded and real-time system design. The purpose of this thesis is to determine if Rhapsody can be used for software development on small processor platforms such as the Atmel AVR. Rhapsody is normally used on platforms running an operating system. Therefore certain adaptations are needed in order to use it on platforms without an operating system. These adaptations and their affect on the usability of the tool, advantages and disadvantages are all studied while porting AVR-software to Rhapsody on one of CC Systems products, the robust on-board computer CC Pilot XL II.</p> / <p>Rhapsody är ett verktyg för modelldriven utveckling och design av inbyggda system och realtidssystem. Syftet med detta examensarbete är att undersöka om Rhapsody kan användas för att utveckla mjukvara till små processorplattformar som Atmel’s AVR. Då Rhapsody normalt används till plattformar med ett operativsystem behöver vissa modifieringar göras för att möjliggöra utveckling mot plattformar utan operativsystem. Dessa modifieringar, deras för och nackdelar samt påverkan på utvecklingsprocessen undersöks medan AVR-mjukvara porteras till Rhapsody. Mjukvaran som porteras är en del av styrsystemet till en av CC Systems produkter: CC Pilot XL II, en robust fordonsdator.</p>
|
319 |
Le chiffre de la vie /Bénichou, Grégory, January 2002 (has links)
Texte remanié de: Th. doct.--Pharm.--Paris 5, 1999. Titre de soutenance : Le quotient génétique. Texte remanié de: Th. doct.--Philos.--Paris 4, 2000. Titre de soutenance : Le chiffre de la vie, essai philosophique sur le code génétique. / Bibliogr. p. 309-318.
|
320 |
Language choice and code switching in the Azerbaijandi community in Teheran : a conversation analytic approach to bilingual practices /Bani-Shoraka, Helena. January 2005 (has links)
Thesis--Uppsala--Uppsala universitet, 2005. / Bibliogr. p. 204-211.
|
Page generated in 0.0726 seconds