Добірка наукової літератури з теми "Code Construction Networks"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Code Construction Networks".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Code Construction Networks"
1
Skachek, Vitaly. "Recursive Code Construction for Random Networks." IEEE Transactions on Information Theory 56, no. 3 (March 2010): 1378–82. http://dx.doi.org/10.1109/tit.2009.2039163.
Повний текст джерела
2
Sanna, Michele, and Ebroul Izquierdo. "A Survey of Linear Network Coding and Network Error Correction Code Constructions and Algorithms." International Journal of Digital Multimedia Broadcasting 2011 (2011): 1–12. http://dx.doi.org/10.1155/2011/857847.
Повний текст джерелаАнотація:
Network coding was introduced by Ahlswede et al. in a pioneering work in 2000. This paradigm encompasses coding and retransmission of messages at the intermediate nodes of the network. In contrast with traditional store-and-forward networking, network coding increases the throughput and the robustness of the transmission. Linear network coding is a practical implementation of this new paradigm covered by several research works that include rate characterization, error-protection coding, and construction of codes. Especially determining the coding characteristics has its importance in providing the premise for an efficient transmission. In this paper, we review the recent breakthroughs in linear network coding for acyclic networks with a survey of code constructions literature. Deterministic construction algorithms and randomized procedures are presented for traditional network coding and for network-control network coding.
3
Zhao, Xubo. "An efficient basic convolutional network code construction algorithm on cyclic networks." AEU - International Journal of Electronics and Communications 67, no. 12 (December 2013): 1072–78. http://dx.doi.org/10.1016/j.aeue.2013.06.010.
Повний текст джерела
4
Abbas, Huda Saleh, Mark A. Gregory, and Michael W. Austin. "A New Prime Code for Synchronous Optical Code Division Multiple-Access Networks." Journal of Computer Networks and Communications 2018 (2018): 1–11. http://dx.doi.org/10.1155/2018/3192520.
Повний текст джерелаАнотація:
A new spreading code based on a prime code for synchronous optical code-division multiple-access networks that can be used in monitoring applications has been proposed. The new code is referred to as “extended grouped new modified prime code.” This new code has the ability to support more terminal devices than other prime codes. In addition, it patches subsequences with “0s” leading to lower power consumption. The proposed code has an improved cross-correlation resulting in enhanced BER performance. The code construction and parameters are provided. The operating performance, using incoherent on-off keying modulation and incoherent pulse position modulation systems, has been analyzed. The performance of the code was compared with other prime codes. The results demonstrate an improved performance, and a BER floor of 10−9 was achieved.
5
Shapoval, Nataliia, and Denys Lobanov. "Detecting Handwritten Line for TikZ Code Generating." Electronics and Control Systems 2, no. 76 (June 23, 2023): 56–60. http://dx.doi.org/10.18372/1990-5548.76.17671.
Повний текст джерелаАнотація:
This work is devoted to the recognition of straight lines in geometric drawings created by hand with the help of neural networks. The LaTeX language is usually used for the design of articles, which takes more time, especially when writing formulas or constructing geometric drawings, unlike writing by hand. Automating the construction of drawings will make it possible to speed up the process of writing articles. The paper considers the recognition of straight lines as the most popular element of geometric drawings. The Hough transform for straight lines detection and its disadvantages are considered. The use of convolutional neural networks for this task is proposed as the best tool for working with images. To train the model, a dataset was created with handwritten lines and lines constructed in a graphics editor. The results of the neural network are given.
6
Duo, Bin, Xiaoling Zhong, and Yong Guo. "Practical polar code construction for degraded multiple-relay networks." China Communications 14, no. 4 (April 2017): 127–39. http://dx.doi.org/10.1109/cc.2017.7927571.
Повний текст джерела
7
Nlend, Samuel, and Theo G. Swart. "Construction and Characterization of Optical Orthogonal Codes (n,w,1) for Fast Frequency Hopping-Optical Code Division Multiple Access." ECTI Transactions on Electrical Engineering, Electronics, and Communications 20, no. 1 (February 18, 2022): 62–73. http://dx.doi.org/10.37936/ecti-eec.2022201.246105.
Повний текст джерелаАнотація:
This paper investigates a new combinatorial construction approach based on cyclic difference packings for the construction of an optical orthogonal code that is suitable as a time spreading sequence for fast frequency hopping optical code division multiple access (OCDM) systems. The proposed construction provides a solution to the electrical decoding delay problem when compared to its optical counterpart, as well as other optimization issues. The criteria for optimizing the performance of such an OCDMA system are provided, namely: the flexibility and simplicity in constructing the optimal code for any length and weight, a reduction in the encoding/decoding complexity that complies with changes in the fast frequency hopping system, and the provision of system transfer transparency, a decoding rule that exploits the embedded asymmetric error correcting capability of the code. Our neighbor difference approach refers to the partition of different solutions into sub-classes, given in the correlation matrix form. It takes into account both direct and recursive combinatorial code construction methods, and the resulting characteristics are evaluated accordingly. A performance analysis based on the OCDMA channel is given, and a comparison with other difference family solutions is performed.
8
GRELCK, CLEMENS, SVEN-BODO SCHOLZ, and ALEX SHAFARENKO. "A GENTLE INTRODUCTION TO S-NET: TYPED STREAM PROCESSING AND DECLARATIVE COORDINATION OF ASYNCHRONOUS COMPONENTS." Parallel Processing Letters 18, no. 02 (June 2008): 221–37. http://dx.doi.org/10.1142/s0129626408003351.
Повний текст джерелаАнотація:
We present the design of S-NET, a coordination language and component technology based on stream processing. S-NET achieves a near-complete separation between application code, written in a conventional programming language, and coordination code, written in S-NET itself. S-NET boxes integrate existing sequential code as stream-processing components into streaming networks, whose construction is based on algebraic formulae built out of four network combinators. Subtyping on the level of boxes and networks and a tailor-made inheritance mechanism achieve flexible software reuse.
9
Li, Jian, Tongtong Li, and Jian Ren. "Optimal Construction of Regenerating Code Through Rate-Matching in Hostile Networks." IEEE Transactions on Information Theory 63, no. 7 (July 2017): 4414–29. http://dx.doi.org/10.1109/tit.2017.2694441.
Повний текст джерела
10
Li, Xiyang, and Kenneth W. Shum. "Mixed construction of OOC for optical code division multiple access networks." IET Communications 13, no. 7 (April 23, 2019): 837–41. http://dx.doi.org/10.1049/iet-com.2018.5602.
Повний текст джерелаДисертації з теми "Code Construction Networks"
1
Ferdinand, N. S. (Nuwan Suresh). "Low complexity lattice codes for communication networks." Doctoral thesis, Oulun yliopisto, 2016. http://urn.fi/urn:isbn:9789526210964.
Повний текст джерелаАнотація:
Abstract Lattice codes achieve AWGN capacity and naturally fit in many multi-terminal networks because of their inherited structure. Although extensive information theoretic research has been done to prove the importance of lattice codes for these networks, the progress in finding practical low-complexity lattice schemes is limited. Hence, the motivation of this thesis is to develop several methods to make lattice codes practical for communication networks. First, we propose an efficient lattice coding scheme for real-valued, full-duplex one- and two-way relay channels. Lattice decomposition, superposition, and block Markov encoding are used to propose a simple, yet near capacity achieving encoding/decoding schemes for these relay channels. By using information theoretic tools, we prove the achievable rates of these schemes, which are equal to the best known rates. Then, we construct practical, low-complexity implementations of the proposed relay schemes using low-density lattice codes. Numerical evaluation is presented and they show that our schemes achieve performance as close as 2.5dB away from theoretical limits. The effect of shaping/coding loss on the performance of relay channels is studied. Then, we propose a low complexity lattice code construction that provides high shaping and coding gains. First, integer information is encoded to shaped integers. Two methods are proposed for this task: ''Voronoi integers'' and ''non uniform integers''. These shaped integers have shaping gains over the integer lattice. Then for the second step, we present a general framework to systematically encode these integers, using any high dimensional lattice with lower-triangular generator or parity check matrices, retaining the same shaping gain. The proposed scheme can be used to shape high dimensional lattices such as low density lattice codes, LDA-lattice, etc. Comprehensive analysis is presented using low density lattice codes. By using E8 and BW16 as shaping lattices, we numerically show the Voronoi integers result in the shaping gain of these lattices, that is, as much as 0.65dB and 0.86dB. It is numerically observed that non-uniform integers have shaping gains of up to 1.25dB. These shaping operations can be implemented with less complexity than previous low density lattice codes shaping approaches and shaping gains are higher than in previously reported cases, which are in the order of 0.4dB. Lastly, we propose a low complexity practical code construction for compute-and-forward. A novel code construction called ''mixed nested lattice code construction'' is developed. This code construction uses a pair of distinct nested lattices to encode the integers where shaping is provided by a small dimensional lattice with high shaping gain and coding is performed using a high coding gain and a high dimensional lattice. This construction keeps the shaping and the coding gains of respective shaping and coding lattices. Further, we prove an existence of an isomorphism in this construction such that linear combination of lattice codes can be mapped to a linear combination of integers over a finite field. Hence, this construction can be readily used for any compute-and-forward applications. A modified LDLC decoder is proposed to estimate a linear combination of messages. Performance is numerically evaluatedTiivistelmä Hilakoodit saavuttavat AWGN kapasiteetin ja sopivat luonnollisesti moniin monen päätelaitteen verkkoihin niihin sisältyvän rakenteen vuoksi. Vaikka lukuisat informaatioteoreettiset tutkimustyöt todistavat hilakoodien tärkeyden näille verkoille, käytännössä alhaisen kompleksisuuden hilajärjestelmiä on vielä vähän. Näin ollen tämän tutkielman tarkoitus on kehittää useita metodeja, jotta hilakoodeista saadaan käytännöllisiä viestintäverkkoihin. Aluksi, ehdotamme tehokkaan hilakoodausjärjestelmän reaaliarvoisille, full duplexisille yksi- ja kaksisuuntaisille välittäjäkanaville. Käytämme hilan hajottamista, superpositiota ja lohko-Markov -koodausta ehdottaessamme yksinkertaiset ja siltikin kapasiteetin saavuttavat koodaus- ja dekoodausjärjestelmät näihin välityskanaviin. Käyttämällä informaatioteoreettisia työkaluja, osoitamme näiden järjestelmien saavutettavat nopeudet, jotka ovat yhtä suuret kuin parhaimmat tunnetut nopeudet. Sitten rakennamme käytännölliset ja alhaisen monimutkaisuuden toteutukset ehdotetuille välitysjärjestelmille käyttäen alhaisen tiheyden hilakoodeja. Esitämme näille järjestelmille numeeriset arvioinnit, jotka näyttävät että nämä toteutukset saavuttavat tehokkuuden, joka on 2.5dB:n päässä teoreettisista rajoista. Tutkimme muotoilu- ja koodaushäviön vaikutusta välityskanavien tehokkuuteen. Sitten, ehdotamme alhaisen monimutkaisuuden hilakoodirakenteen, joka tarjoaa korkean muotoilu- ja koodausvahvistuksen. Ensin, kokonaislukuinformaatio on koodattu muotoiltuihin kokonaislukuihin. Esitämme kaksi metodia tähän tehtävään; 'Voronoi kokonaisluvut' ja 'ei yhtenäiset kokonaisluvut'. Näillä muotoilluilla kokonaisluvuilla on muotoiluvahvistusta kokonaislukuhilalle. Toisena askeleena, esitämme yleiset puitteet systemaattiseen kokonaislukujen koodaukseen käyttäen korkeaulotteisia hiloja alhaisen kolmiogeneraattori- tai pariteettivarmistusmatriiseja, jotka säilyttävät samalla muotoiluvahvistuksen. Ehdotettua järjestelmää voidaan käyttää muotoilemaan korkeaulotteisia hiloja kuten alhaisen tiheyden hilakoodeja, LDA-hiloja, jne. Esitämme kattavan analyysin käyttäen alhaisen tiheyden hilakoodeja. Käyttämällä muotoiluhiloina E8aa ja BW16a, näytämme numeerisesti 'Voronoi kokonaislukujen' käyttämisen seurauksena saavutettavat hilojen muotoiluvahvistukset, jotka ovat jopa 0.65dB ja 0.86dB. Näytämme myös numeerisesti että 'ei yhtenäisillä kokonaisluvuilla' on muotoiluvahvistusta jopa 1.25dB. Nämä muotoiluoperaatiot voidaan toteuttaa alhaisemmalla monimutkaisuudella kuin aikaisemmat 'alhaisen tiheyden hilakoodien muotoilumenetelmät' ja muotoiluvahvistukset ovat suuremmat kuin aikaisemmin raportoidut tapaukset, jotka ovat suuruusluokaltaan 0.4dB. Viimeiseksi, ehdotamme käytännöllisen koodikonstruktion alhaisella monimutkaisuudella 'laske ja lähetä' -menetelmään. Kehitämme uuden koodikonstruktion, jota kutsumme 'sekoitetuksi sisäkkäiseksi hilakoodikonstruktioksi'. Tämä koodikonstruktio käyttää kahta eroteltavissa olevaa sisäkkäistä hilaa koodaamaan kokonaisluvut siellä, missä muotoilu tehdään pienen ulottuvuuden hiloilla korkean muotoiluvahvistuksella ja koodaus toteutetaan käyttäen korkean koodausvahvistuksen omaavaa korkeaulottuvuuksista hilaa. Tämä konstruktio säilyttää muotoilu- ja koodausvahvistukset kullekin muotoilu- ja koodaushilalle. Lisäksi, todistamme isomorfismin olemassaolon tässä konstruktiossa siten, että lineaarisen hilakoodien kombinaatio voidaan kuvata lineaarisena kokonaislukujen kombinaationa äärellisessä kunnassa. Näin ollen tätä konstruktiota voidaan helposti käyttää missä tahansa 'laske ja lähetä' -sovelluksessa. Esitämme muokatun LDLC dekooderin lineaarisen viestikombinaation estimointiin. Arvioimme tehon numeerisesti
2
Rossetti, Anibal Martins. "Identificação de competências essenciais para formação e gerência de redes de empresas da construção civil." Universidade de São Paulo, 2005. http://www.teses.usp.br/teses/disponiveis/18/18140/tde-08052007-185644/.
Повний текст джерелаАнотація:
No setor da construção civil as perspectivas gerenciais das organizações são de adaptar-se aos novos cenários e uma das formas é a de formar redes de empresas. Para formar e gerenciar redes de empresas é necessária a adequação de competências essenciais, pois organizações bem sucedidas são aquelas que demonstram desenvolver suas competências essenciais para oferecer padrão de excelência em bens e serviços. Neste trabalho são analisadas as propostas e os possíveis desdobramentos sobre o escopo compreendendo o processo de formação de redes de empresas e posteriormente é sugerida uma sistematização para identificar as competências essenciais para a formação e gerenciamento de redes de empresas da construção civil, empresas estas que possuam objetivos comuns e que mantenham a independência e individualidade para, assim, formar uma rede que permita a realização de ações conjuntas, facilitando a solução de problemas comuns e viabilizar novas oportunidades. As empresas por fim identificadas unem-se em uma rede e conseguem reduzir custos, dividir riscos, conquistar novos mercados, qualificar produtos e serviços e ter acesso à novas tecnologias. A aplicação prática do trabalho é feita através de um estudo de caso exploratório em uma obra de construção civil buscando as competências contidas nas empresas participantes para, assim, poder afirmar quais são as competências essenciais para formação da rede e quais poderão trazer benefícios à mesma ou a outras que virão a se formar. Espera-se com o resultado desta pesquisa determinar quais empresas são capazes de operar em um negócio em forma de rede de empresas, envolvendo profunda avaliação de competências essenciais, verificando se as mesmas irão garantir uma adequada sustentação competitiva nos mercados almejados.In the civil construction, the management perspectives of organizations are to adapt to new sceneries and one of the ways is to create enterprise networks. To create and management enterprise networks it is necessary the adequation the core competence, because well succeeded organizations are those which demonstrate to develop its core competences to offer excellent standards in goods and services. In this work proposals and possible results of the issues concerning to the process of networks formation area analyzed. It is also suggest a systematization to identify core competence to the formation and management of enterprise networks in civil construction sector that have common goals and maintain the independence and individuality, to create a network that allows the accomplishment of joined actions, making the solution of common problems easier and making new opportunities feasible. These enterprises, finally identified, join themselves in a network and can reduce costs, divide risks, reach new markets, qualify products and services, and have access to new technologies. The practical application of this work is done throughout a case study which explores a civil construction task arming to identify the competence inserted in the participate enterprise, that it will be possible to affirm which the core competence to the formation of the network and which are able to bring benefits to itself and to others enterprise networks. It is intended, as a result of this research, to determine which enterprises are capable to operate in a new business, in a network configuration, involving deep evaluation of core competences and verifying if they will guarantee a competitive sustentation in desired markets.
3
Ghatak, Anirban. "Algebraic Techniques for Error Correction in Random Networks." Thesis, 2016. https://etd.iisc.ac.in/handle/2005/4373.
Повний текст джерелаАнотація:
Abstract
The transmission of data in the presence of errors and erasures over random networks, in situations where there is only partial information regarding the underlying network topology, has been interpreted in terms of the transmission and recovery of subspaces of an ambient vector space over a finite field. Under this representation, a random network code is a collection of such subspaces. The present thesis explores several algebraic techniques for constructing constant and non-constant dimension codes for random networks. Orbit codes are constant dimension codes which are orbits of suitable subgroups of the general linear group acting on the subspaces in a Grassmannian. One contribution of the present thesis is to link the construction of Singer cycle orbit codes possessing a given minimum subspace distance with the construction of cyclic difference sets with the appropriate parameters.
In a second contribution, we interpret two constructions of constant dimension codes, namely, the lifting construction and its generalization using Ferrers diagram rank-metric (FDRM) codes, in terms of Plücker coordinates. We show that both constructions can be described via a two-step procedure. In the first step, a set of indices which provides a non-zero Plücker coordinate is identified; in the second, the remaining Plücker coordinates of the lifted subspace are computed by replacing the columns of the original matrix in row-reduced echelon form with those of the matrix to be lifted.
In the existing literature, balls of a given radius cantered at a subspace codeword of a constant dimension code has been interpreted as Schubert systems. We establish that the balls of the same radius cantered at a codeword of the dual subspace code are characterized by the classical dual of the original Schubert system. A method for constructing non-constant dimension subspace codes is proposed, similar to the two-step existing construction with FDRM codes. In the proposed method, the characteristic tuple is used to characterize a Schubert cell. Bounds on the subspace distance and the injection distance among the chosen Schubert cells are obtained in terms of the symmetric distance and a modified symmetric distance between the characteristic tuples. It is shown that our framework is equivalent to the existing construction when FDRM codes are employed.
Based on some modifications of the nearly optimal (5; 3)2 code given by Etzion and Vardy, 4 optimal (5; 3)2 codes are constructed. It is shown that all these sporadic examples fall outside the framework of the recent construction of Honold et al. The radical ideals of a Noetherian commutative ring have unique decomposition as the intersection of prime ideals. This fact is used to construct constant weight codes on the power set of a set of radical ideals. These constant weight codes are suitable for store and- forward (SAF) routing over random networks. Several upper and lower bounds on the sizes of such codes are verified. In this context, the search for codes which achieve a Johnson bound is interpreted as the search for maximal subgraphs in the generalized Johnson graph corresponding to the subset code.
A generalization of the above construction is achieved by considering lattices having irredundant primary decomposition and unique (meet) irreducible decomposition, respectively. The difference between the criteria for these decompositions is established and the primary decomposition in Dedekind domains shown as a common example. In addition, the unique decomposition in lattices in terms of prime elements is formulated in the former case. Construction of constant weight codes for SAF routing is indicated. Finally, the random linear network coding problem has been formulated on the lattice of ideals as well as on the lattice of radical ideals of rings.
4
Agrawal, Shweta Prem. "Efficient, provably secure code constructions." Thesis, 2011. http://hdl.handle.net/2152/ETD-UT-2011-05-2675.
Повний текст джерелаАнотація:
The importance of constructing reliable and efficient methods for securing digital information in the modern world cannot be overstated. The urgency of this need is reflected in mainstream media--newspapers and websites are full of news about critical user information, be it credit card numbers, medical data, or social security information, being compromised and used illegitimately. According to news reports, hackers probe government computer networks millions of times a day, about 9 million Americans have their identities stolen each year and cybercrime costs large American businesses 3.8 million dollars a year. More than 1 trillion worth of intellectual property has already been stolen from American businesses. It is this evergrowing problem of securing valuable information that our thesis attempts to address (in part). In this thesis, we study methods to secure information that are fast, convenient and reliable. Our overall contribution has four distinct threads. First, we construct efficient, "expressive" Public Key Encryption systems (specifically, Identity Based Encryption systems) based on the hardness of lattice problems. In Identity Based Encryption (IBE), any arbitrary string such as the user's email address or name can be her public key. IBE systems are powerful and address several problems faced by the deployment of Public Key Encryption. Our constructions are secure in the standard model. Next, we study secure communication over the two-user interference channel with an eavesdropper. We show that using lattice codes helps enhance the secrecy rate of this channel in the presence of an eavesdropper. Thirdly, we analyze the security requirements of network coding. Network Coding is an elegant method of data transmission which not only helps achieve capacity in several networks, but also has a host of other benefits. However, network coding is vulnerable to "pollution attacks" when there are malicious users in the system. We design mechanisms to prevent pollution attacks. In this setting, we provide two constructions -- a homomorphic Message Authentication Code (HMAC) and a Digital Signature, to secure information that is transmitted over such networks. Finally, we study the benefits of using Compressive Sensing for secure communication over the Wyner wiretap channel. Compressive Sensing has seen an explosion of interest in the last few years with its elegant mathematics and plethora of applications. So far however, Compressive Sensing had not found application in the domain of secrecy. Given its inherent assymetry, we ask (and answer in the affirmative) the question of whether it can be deployed to enable secure communication. Our results allow linear encoding and efficient decoding (via LASSO) at the legitimate receiver, along with infeasibility of message recovery (via an information theoretic analysis) at the eavesdropper, regardless of decoding strategy.text
5
Hsieh, Wen-Pin, and 謝文彬. "A New Algorithm for the Construction of a Generic Linear Network Code." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/27114679558140393169.
Повний текст джерелаАнотація:
碩士國立清華大學
通訊工程研究所
95
In this thesis, we consider generic linear network codes introduced by Li et al. We give a new algorithm for the construction of a generic linear network code on an acyclic network, which is an enhancement of a previously proposed algorithm by Yeung et al. for the construction of a generic linear network code. We also obtain an improved lower bound on the size of the finite field from which the source symbols are taken.
6
林佩璇. "Design of Multirate Schemes and Code Constructions for MC-DS/CDMA Wireless Networks." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/40865234936722213730.
Повний текст джерелаАнотація:
碩士國立中興大學
電機工程學系
90
The second-generation (2G) systems impacts the modern life greatly but only support the voice-orient applications. It is desired a variety of data services with different quality requirements in the future wireless systems. Multicarrier direct-sequence code-division multiple-access (MC-DS/CDMA) is one possible scheme for the new-generation wireless networks. In this thesis, a MC-DS/CDMA system with 2D spreading codes is proposed to provide multirate services by varying the number of carrier frequencies and code length. First, new constructions of 2D orthogonal codes is presented. The proposed 2D codes possess zero cyclic auto- and cross-correlation properties. By using these new codes, multiple access interference (MAI) can be eliminated for MC-DS/CDMA systems in asynchronous channels. In addition, several multirate schemes for MC-DS/CDMA systems with the proposed 2D codes are discussed. By using these schemes, multirate transmissions can be achieved and the bandwidth efficiency can be improved. Owing to the above multirate schemes, the proposed MC-DS/CDMA system will be more serviceable in future wireless networks.
7
Lee, Kung-Tien, and 李耿典. "Construction and performance analysis of new codes for optical CDMA networks with M-ary signaling." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/67473600976189244194.
Повний текст джерелаАнотація:
碩士國立中正大學
通訊工程研究所
89
In this thesis we investigate the construction of spreading code for optical CDMA systems. Because the characteristic of the electric and optical signal is different, e.g., the optical signal is positive and the electric signal may be positive or negative, the spreading code used in RF-CDMA systems is inappropriate to use in optical CDMA systems. The low noise property is an advantage in optical communications. Therefore, we don’t consider the effect of noise on the performance of our proposed systems. The main performance degradation is caused by the multiple access interference only. In this thesis we propose two new code constructions and analyze the performance for Direct Sequence (DS)-CDMA system and Fast Frequency Hopping (FFH) CDMA system respectively. Conventionally, the spreading codes for optical CDMA system encode one bit per symbol. However, both of our proposed new codes can encode k bits per symbol. Therefore, the transmission rate can be increased by k times with the new codes. Based on the performance analysis, we get the expected result that the BER of our proposed system is better than the conventional one.
8
Upadrashta, Raviteja. "Design and Development of a Passive Infra-Red-Based Sensor Platform for Outdoor Deployment." Thesis, 2017. http://etd.iisc.ac.in/handle/2005/3439.
Повний текст джерелаАнотація:
This thesis presents the development of a Sensor Tower Platform (STP) comprised of an array of Passive Infra-Red (PIR) sensors along with a classification algorithm that enables the STP to distinguish between human intrusion, animal intrusion and clutter arising from wind-blown vegetative movement in an outdoor environment. The research was motivated by the aim of exploring the potential use of wireless sensor networks (WSNs) as an early-warning system to help mitigate human-wildlife conflicts occurring at the edge of a forest.
While PIR sensors are in commonplace use in indoor settings, their use in an outdoor environment is hampered by the fact that they are prone to false alarms arising from wind-blown vegetation. Every PIR sensor is made up of one or more pairs of pyroelectric pixels arranged in a plane, and the orientation of interest in this thesis is one in which this plane is a vertical plane, i.e., a plane perpendicular to the ground plane. The intersection of the Field Of View (FOV) of the PIR sensor with a second vertical plane that lies within the FOV of the PIR sensor, is called the virtual pixel array (VPA). The structure of the VPA corresponding to the plane along which intruder motion takes place determines the form of the signal generated by the PIR sensor. The STP developed in this thesis employs an array of PIR sensors designed so as to result in a VPA that makes it easier to discriminate between human and animal intrusion while keeping to a small level false alarms arising from vegetative motion. The design was carried out in iterative fashion, with each successive iteration separated by a lengthy testing phase. There were a total of 5 design iterations spanning a total period of 14 months.
Given the inherent challenges involved in gathering data corresponding to animal intrusion, the testing of the SP was carried out both using real-world data and through simulation. Simulation was carried out by developing a tool that employed animation software to simulate intruder and animal motion as well as some limited models of wind-blown vegetation. More specifically, the simulation tool employed 3-dimensional models of intruder and shrub motion that were developed using the popular animation software Blender. The simulated output signal of the PIR sensor was then generated by calculating the area of the 3-dimensional intruder when projected onto the VPA of the STP. An algorithm for efficiently calculating this to a good degree of approximation was implemented in Open Graphics Library (OpenGL). The simulation tool was useful both for evaluating various competing design alternatives as well as for developing an intuition for the kind of signals the SP would generate without the need for time-consuming and challenging animal-motion data collection.
Real-world data corresponding to human motion was gathered on the campus of the Indian Institute of Science (IISc), while animal data was recorded at a dog-trainer facility in Kengeri as well as the Bannerghatta Biological Park, both located in the outskirts of Bengaluru. The array of PIR sensors was designed so as to result in a VPA that had good spatial resolution. The spatial resolution capabilities of the STP permitted distinguishing between human and animal motion with good accuracy based on low-complexity, signal-energy computations. Rejecting false alarms arising from vegetative movement proved to be more challenging. While the inherent spatial resolution of the STP was very helpful, an alternative approach turned out to have much higher accuracy, although it is computationally more intensive. Under this approach, the intruder signal, either human or animal, was modelled as a chirp waveform. When the intruder moves along a circular arc surrounding the STP, the resulting signal is periodic with constant frequency. However, when the intruder moves along a more likely straight-line path, the resultant signal has a strong chirp component. Clutter signals arising from vegetative motion does not exhibit this chirp behavior and an algorithm that exploited this difference turned in a classification accuracy in excess of 97%.
9
Upadrashta, Raviteja. "Design and Development of a Passive Infra-Red-Based Sensor Platform for Outdoor Deployment." Thesis, 2017. http://etd.iisc.ernet.in/2005/3439.
Повний текст джерелаАнотація:
This thesis presents the development of a Sensor Tower Platform (STP) comprised of an array of Passive Infra-Red (PIR) sensors along with a classification algorithm that enables the STP to distinguish between human intrusion, animal intrusion and clutter arising from wind-blown vegetative movement in an outdoor environment. The research was motivated by the aim of exploring the potential use of wireless sensor networks (WSNs) as an early-warning system to help mitigate human-wildlife conflicts occurring at the edge of a forest.
While PIR sensors are in commonplace use in indoor settings, their use in an outdoor environment is hampered by the fact that they are prone to false alarms arising from wind-blown vegetation. Every PIR sensor is made up of one or more pairs of pyroelectric pixels arranged in a plane, and the orientation of interest in this thesis is one in which this plane is a vertical plane, i.e., a plane perpendicular to the ground plane. The intersection of the Field Of View (FOV) of the PIR sensor with a second vertical plane that lies within the FOV of the PIR sensor, is called the virtual pixel array (VPA). The structure of the VPA corresponding to the plane along which intruder motion takes place determines the form of the signal generated by the PIR sensor. The STP developed in this thesis employs an array of PIR sensors designed so as to result in a VPA that makes it easier to discriminate between human and animal intrusion while keeping to a small level false alarms arising from vegetative motion. The design was carried out in iterative fashion, with each successive iteration separated by a lengthy testing phase. There were a total of 5 design iterations spanning a total period of 14 months.
Given the inherent challenges involved in gathering data corresponding to animal intrusion, the testing of the SP was carried out both using real-world data and through simulation. Simulation was carried out by developing a tool that employed animation software to simulate intruder and animal motion as well as some limited models of wind-blown vegetation. More specifically, the simulation tool employed 3-dimensional models of intruder and shrub motion that were developed using the popular animation software Blender. The simulated output signal of the PIR sensor was then generated by calculating the area of the 3-dimensional intruder when projected onto the VPA of the STP. An algorithm for efficiently calculating this to a good degree of approximation was implemented in Open Graphics Library (OpenGL). The simulation tool was useful both for evaluating various competing design alternatives as well as for developing an intuition for the kind of signals the SP would generate without the need for time-consuming and challenging animal-motion data collection.
Real-world data corresponding to human motion was gathered on the campus of the Indian Institute of Science (IISc), while animal data was recorded at a dog-trainer facility in Kengeri as well as the Bannerghatta Biological Park, both located in the outskirts of Bengaluru. The array of PIR sensors was designed so as to result in a VPA that had good spatial resolution. The spatial resolution capabilities of the STP permitted distinguishing between human and animal motion with good accuracy based on low-complexity, signal-energy computations. Rejecting false alarms arising from vegetative movement proved to be more challenging. While the inherent spatial resolution of the STP was very helpful, an alternative approach turned out to have much higher accuracy, although it is computationally more intensive. Under this approach, the intruder signal, either human or animal, was modelled as a chirp waveform. When the intruder moves along a circular arc surrounding the STP, the resulting signal is periodic with constant frequency. However, when the intruder moves along a more likely straight-line path, the resultant signal has a strong chirp component. Clutter signals arising from vegetative motion does not exhibit this chirp behavior and an algorithm that exploited this difference turned in a classification accuracy in excess of 97%.
10
Vikas, G. "Power Optimal Network-On-Chip Interconnect Design." Thesis, 2010. https://etd.iisc.ac.in/handle/2005/1408.
Повний текст джерелаАнотація:
A large part of today's multi-core chips is interconnect. Increasing communication complexity has made new strategies for interconnects essential such as Network on Chip. Power dissipation in interconnects has become a substantial part of the total power dissipation. Hence, techniques to reduce interconnect power have become a necessity. In this thesis, we present a design methodology that gives values of bus width for interconnect links, frequency of operation for routers, in Network on Chip scenario that satisfy required throughput and dissipate minimal switching power. We develop closed form analytical expressions for the power dissipation, with bus width and frequency as variables and then use Lagrange multiplier method to arrive at the optimal values.
To validate our methodology, we implement the router design in 90 nm technology and measure power for various bus widths and frequency combinations. We find that the experimental results are in good agreement with the predicted theoretical results. Further, we present the scenario of an Application Specific System on Chip (ASSoC), where the throughput requirements are different on different links. We show that our analytical model holds in this case also. Then, we present modified version of the solution considered for Chip Multi Processor (CMP) case that can solve the ASSoC scenario also.
Книги з теми "Code Construction Networks"
1
1968-, Zhang Qinqing, ed. Design and performance of 3G wireless networks and wireless LANs. New York: Springer Science+Business Media, 2006.
Знайти повний текст джерела
2
Chuah, Mooi Choo, and Qinqing Zhang. Design and Performance of 3G Wireless Networks and Wireless LANs. Springer, 2005.
Знайти повний текст джерела
3
Hylander, Paul Donald. Design automation tools for pulse coded VLSI neural networks. 1994.
Знайти повний текст джерела
4
Ampadu, Paul, and Qiaoyan Yu. Transient and Permanent Error Control for Networks-on-Chip. Springer, 2014.
Знайти повний текст джерела
5
Ampadu, Paul, and Qiaoyan Yu. Transient and Permanent Error Control for Networks-On-Chip. Springer, 2011.
Знайти повний текст джерела
6
Ampadu, Paul, and Qiaoyan Yu. Transient and Permanent Error Control for Networks-on-Chip. Springer, 2011.
Знайти повний текст джерела
7
Wheeldon, Marianne. Debussy's Legacy and the Construction of Reputation. Oxford University Press, 2018. http://dx.doi.org/10.1093/acprof:oso/9780190631222.001.0001.
Повний текст джерелаАнотація:
This book examines the vicissitudes of Debussy’s posthumous reception in the 1920s and early 1930s and analyzes the confluence of factors that helped to overturn the initial backlash against his musical aesthetic. In tracing this overarching narrative, this study enters into dialogue with research in the sociology of reputation and commemoration, examining the collective nature of the processes of artistic consecration. Key in this regard is identifying the networks of influence that had to come together and act in several spheres—textual, performative, material—to safeguard the composer’s legacy. Today, Debussy’s position as a central figure in twentieth-century concert music is secure: this book examines how and why this seemingly inevitable state of affairs came about. Although this study focuses on one particular instance of reputation building, its scope is also broader in that it addresses the more general processes by which reputations are constructed, contested, and consolidated. And by analyzing the forces that came to bear on the formation of Debussy's legacy, this book contributes to a greater understanding of the interwar period—the cultural politics, debates, and issues that confronted musicians in 1920s and 1930s Paris.
8
Howe, Justine. Building the Webb Community. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190258870.003.0002.
Повний текст джерелаАнотація:
This chapter explores the suburban religious landscape, educational networks, and narratives of the American Muslim past out of which the Webb community emerged. It demonstrates how the suburbs are a vital site to study broader dynamics in the American Muslim community. At its heart, the Webb Foundation is built on the idea that the Chicago suburbs can be the ideal place to practice Islam. Its core membership consists of young parents who are very committed to upper-middle-class norms of intensive parenting, such as supervising homework, shuttling kids between after-school activities, and maintaining an active presence in their social lives. The American Islam they seek to create fits into these constructions of family life, enabling children and adults alike to become American Muslims in ways they believe earlier generations were either unable or unwilling to be.
9
Moore, Robbie. Hotel Modernity. Edinburgh University Press, 2021. http://dx.doi.org/10.3366/edinburgh/9781474456654.001.0001.
Повний текст джерелаАнотація:
Hotel Modernity explores the impact of corporate space on the construction and texture of modern literature and film. It centres the hotel and corporate space as key sites of modern experience and culture. Examining architectural and financial records, hotel trade journals, travel journalism, advertisements and cinematic and literary representations, it charts the rise of hotel culture from 1870 to 1939. The book defines corporate space as the new urban, capital-intensive, large-scale spaces brought about by corporations during the nineteenth century, including department stores, railway stations and banking halls. Only in hotels, however, did the individual live within corporate space: sleeping in its beds and lounging in its parlours. The hotel structured intimate encounters with the impersonal and the anonymous, representing a radically new mode of experience. In chapters featuring readings of both canonical and relatively little-studied texts by Henry James, F. Scott Fitzgerald, Elizabeth Bowen, Arnold Bennett, and Henry Green, alongside films by F. W. Murnau, Segundo de Chomón, and Charlie Chaplin, Hotel Modernity considers the relationship between new kinds of spatial organisation and new forms of subjective and intersubjective life. Hotels provoked these writers and filmmakers to rethink the conventions and functions of fictional characters. This book charts the warping and decentring of the category of ‘character’ within the corporate, architectural, informatic and technological networks which come to define hotel space in this period.
10
Transient And Permanent Error Control For Networksonchip. Springer, 2011.
Знайти повний текст джерелаЧастини книг з теми "Code Construction Networks"
1
Nirmaladevi, R., and K. Kishan Rao. "Optimal Codebook Construction Method Based on Zadoff-Chu Matrix for Code Division Multiple Access Systems." In Lecture Notes in Networks and Systems, 413–24. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-1976-3_50.
Повний текст джерела
2
Lin, Shu, Jun Xu, Heng Tang, and Yu Kou. "Geometric Constructions of Gallager Codes." In Communications, Information and Network Security, 147–62. Boston, MA: Springer US, 2003. http://dx.doi.org/10.1007/978-1-4757-3789-9_9.
Повний текст джерела
3
Horlemann-Trautmann, Anna-Lena, and Joachim Rosenthal. "Constructions of Constant Dimension Codes." In Network Coding and Subspace Designs, 25–42. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-70293-3_2.
Повний текст джерела
4
Dinneen, Michael J., Michael R. Fellows, and Vance Faber. "Algebraic constructions of efficient broadcast networks." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 152–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-54522-0_104.
Повний текст джерела
5
Otal, Kamil, and Ferruh Özbudak. "Constructions of Cyclic Subspace Codes and Maximum Rank Distance Codes." In Network Coding and Subspace Designs, 43–66. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-70293-3_3.
Повний текст джерела
6
Freij-Hollanti, Ragnar, Camilla Hollanti, and Thomas Westerbäck. "Matroid Theory and Storage Codes: Bounds and Constructions." In Network Coding and Subspace Designs, 385–425. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-70293-3_15.
Повний текст джерела
7
Shu, Zhong, Boer Deng, Luo Tian, Fen Duan, Xinyu Sun, Liangzhe Chen, and Yue Luo. "Construction of SDN Network Management Model Based on Virtual Technology Application." In Proceeding of 2021 International Conference on Wireless Communications, Networking and Applications, 257–68. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-2456-9_28.
Повний текст джерелаАнотація:
AbstractThis paper designs a virtual SDN network management model constrained by fair and equal network management information access mechanisms by analyzing the problems existing in the universality of existing SDN network management models. Starting with the three-tier structure of the SDN network management system, the main parameters involved in the network management service function, information processing and transmission channel construction in the system were strictly and normatively defined. The design of virtual nodes is regarded as the core element of the network management system, and the information transmission inside it adopts logical operation; The network management service function and the channel for realizing the network management service function are isolated, and the iterative search, analysis and update mechanism is enabled in the network management information transmission channel. By constructing the experimental verification platform and setting the evaluation parameters of the system performance objectives, the scalability and timeliness of the model were evaluated from two aspects: the deployment of network virtual nodes and the dynamic control of network management information channels. The collected experimental core evaluation parameters, the realization time of the network management service function, can show that the dynamic distribution mechanism of network management information can be cross-applied to each virtual node, and the channel update mechanism of network management information can adjust the information processing queue in real-time. The network management system model that has been built realizes the separation of management and control of the network management system and has the characteristics of independent operation, autonomous function, self-matching, rapid deployment and dynamic expansion.
8
Rahimian, Farzad Pour, Jack Steven Goulding, Sepehr Abrishami, Saleh Seyedzadeh, and Faris Elghaish. "Optical code division multiple access–based sensor network for monitoring construction sites affected by vibrations." In Industry 4.0 Solutions for Building Design and Construction, 357–80. London: Routledge, 2021. http://dx.doi.org/10.1201/9781003106944-16.
Повний текст джерела
9
Yang, Pengfei, Renjue Li, Jianlin Li, Cheng-Chao Huang, Jingyi Wang, Jun Sun, Bai Xue, and Lijun Zhang. "Improving Neural Network Verification through Spurious Region Guided Refinement." In Tools and Algorithms for the Construction and Analysis of Systems, 389–408. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72016-2_21.
Повний текст джерелаАнотація:
AbstractWe propose a spurious region guided refinement approach for robustness verification of deep neural networks. Our method starts with applying the DeepPoly abstract domain to analyze the network. If the robustness property cannot be verified, the result is inconclusive. Due to the over-approximation, the computed region in the abstraction may be spurious in the sense that it does not contain any true counterexample. Our goal is to identify such spurious regions and use them to guide the abstraction refinement. The core idea is to make use of the obtained constraints of the abstraction to infer new bounds for the neurons. This is achieved by linear programming techniques. With the new bounds, we iteratively apply DeepPoly, aiming to eliminate spurious regions. We have implemented our approach in a prototypical tool DeepSRGR. Experimental results show that a large amount of regions can be identified as spurious, and as a result, the precision of DeepPoly can be significantly improved. As a side contribution, we show that our approach can be applied to verify quantitative robustness properties.
10
Sotoudeh, Matthew, and Aditya V. Thakur. "SyReNN: A Tool for Analyzing Deep Neural Networks." In Tools and Algorithms for the Construction and Analysis of Systems, 281–302. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72013-1_15.
Повний текст джерелаАнотація:
AbstractDeep Neural Networks (DNNs) are rapidly gaining popularity in a variety of important domains. Formally, DNNs are complicated vector-valued functions which come in a variety of sizes and applications. Unfortunately, modern DNNs have been shown to be vulnerable to a variety of attacks and buggy behavior. This has motivated recent work in formally analyzing the properties of such DNNs. This paper introduces SyReNN, a tool for understanding and analyzing a DNN by computing its symbolic representation. The key insight is to decompose the DNN into linear functions. Our tool is designed for analyses using low-dimensional subsets of the input space, a unique design point in the space of DNN analysis tools. We describe the tool and the underlying theory, then evaluate its use and performance on three case studies: computing Integrated Gradients, visualizing a DNN’s decision boundaries, and patching a DNN.
Тези доповідей конференцій з теми "Code Construction Networks"
1
Mohammed, A., E. I. Babekir, N. Elfadel, N. M. Saad, M. S. Anuar, S. A. Aljunid, and M. K. Abdullah. "OSCDMA Double Weight Code: A Simplified Formula Code Construction Technique." In 2007 IFIP International Conference on Wireless and Optical Communications Networks. IEEE, 2007. http://dx.doi.org/10.1109/wocn.2007.4284151.
Повний текст джерела
2
Li, Jianping, Man Hu, and Zhiyuan Cheng. "Research on Polar Code Construction Algorithms Under Gaussian Channel." In 2018 Tenth International Conference on Ubiquitous and Future Networks (ICUFN). IEEE, 2018. http://dx.doi.org/10.1109/icufn.2018.8437011.
Повний текст джерела
3
Babekir, E. I., N. M. Saad, N. Elfadel, A. Mohammed, A. A. Aziz, M. S. Anuar, S. A. Aljunid, and M. K. Abdullah. "Optical Spectrum CDMA: A New Code Construction with Zero Cross Correlation for Double Weight Code Family." In 2007 IFIP International Conference on Wireless and Optical Communications Networks. IEEE, 2007. http://dx.doi.org/10.1109/wocn.2007.4284152.
Повний текст джерела
4
Wang, Fanggang. "Generalized diversity embedded block codes: code construction and PEP analysis in wireless cooperation networks." In 2008 Annual IEEE Student Paper Conference. IEEE, 2008. http://dx.doi.org/10.1109/aispc.2008.4460553.
Повний текст джерела
5
Kumawat, Soma, and Ravi Kumar Maddila. "Development of odd weight code construction for KS code with Ex-OR detection for SAC-OCDMA system." In 2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS). IEEE, 2019. http://dx.doi.org/10.1109/ants47819.2019.9117932.
Повний текст джерела
6
Duc Manh Nguyen and Sunghwan Kim. "Construction and complement circuit of a quantum stabilizer code with length 7." In 2016 Eighth International Conference on Ubiquitous and Future Networks (ICUFN). IEEE, 2016. http://dx.doi.org/10.1109/icufn.2016.7537043.
Повний текст джерела
7
Songsiri, Patoomsiri, Thimaporn Phetkaew, Ryutaro Ichise, and Boonserm Kijsirikul. "Sub-classifier construction for error correcting output code using minimum weight perfect matching." In 2014 International Joint Conference on Neural Networks (IJCNN). IEEE, 2014. http://dx.doi.org/10.1109/ijcnn.2014.6889436.
Повний текст джерела
8
He, Zhiyong, Sebastien Roy, and Paul Fortier. "Powerful LDPC Codes for Broadband Wireless Networks: High-performance Code Construction and High-speed Encoder/Decoder Design." In 2007 International Symposium on Signals, Systems and Electronics. IEEE, 2007. http://dx.doi.org/10.1109/issse.2007.4294441.
Повний текст джерела
9
Xiaobin Li. "Construction of optimal optical orthogonal signature patterns for high throughput optical code division multiple access image transmission." In IET International Conference on Wireless Mobile and Multimedia Networks Proceedings (ICWMMN 2006). IEE, 2006. http://dx.doi.org/10.1049/cp:20061258.
Повний текст джерела
10
Mallawaarachchi, H., Y. G. Sandanayake, G. Karunasena, and C. Liu. "Beyond the reuse: Potentials and barriers for exchanging treated wastewater among the industries in Sri Lanka." In 10th World Construction Symposium. Building Economics and Management Research Unit (BEMRU), University of Moratuwa, 2022. http://dx.doi.org/10.31705/wcs.2022.15.
Повний текст джерелаАнотація:
A major drawback in the present industrial system is that the industries are directly discharging industrial effluent to nearest waterbodies in a linear way. Even though, a few of industries have considered reusing treated and untreated wastewater in their industrial premises, it can be further extended towards ‘exchange’ among the multiple industries under the concept of Industrial Symbiosis (IS). Initiating IS-based treated wastewater exchange networks is a novel approach to Sri Lankan industries and there is a lack of a study on potentials and barriers of implementing the concept. Hence, this research aimed to investigate the potentials and barriers for exchanging treated wastewater among industries. In order to achieve the aim, 16 semi-structed interviews were conducted with industry experts in the field of Industrial Water Management (IWM) to collect the data. Code-based content analysis technique was used to analyse the data by applying QSR NVivo.12 software. Findings revealed geographical proximity of industries, willingness of industries to engage in water exchange and industry level water management initiatives as major potentials for initiating water exchange networks. Lack of expected water quality for industrial needs, outdated technologies used in water management and lack of expertise and awareness were identified as major barriers. Accordingly, strategies, such as introducing national policy enhancements, ensuring cultural adaptation, enhancing technology & infrastructure, and empowering research & development, were proposed to overcome the identified barriers to ensure a successful implementation of treated wastewater exchange networks targeting the socioeconomic development of the country.
Звіти організацій з теми "Code Construction Networks"
1
Abbo, Shahal, Hongbin Zhang, Clarice Coyne, Amir Sherman, Dan Shtienberg, and George J. Vandemark. Winter chickpea; towards a new winter pulse for the semiarid Pacific Northwest and wider adaptation in the Mediterranean basin. United States Department of Agriculture, January 2011. http://dx.doi.org/10.32747/2011.7597909.bard.
Повний текст джерелаАнотація:
Original objectives: [a] Screen an array of chickpea and wild annual Cicer germplasm for winter survival. [b] Genetic analysis of winter hardiness in domesticated x wild chickpea crosses. [c] Genetic analysis of vernalization response in domesticated x wild chickpea crosses. [d] Digital expression analysis of a core selection of breeding and germplasm lines of chickpea that differ in winter hardiness and vernalization. [e] Identification of the genes involved in the chickpea winter hardiness and vernalization and construction of gene network controlling these traits. [f] Assessing the phenotypic and genetic correlations between winter hardiness, vernalization response and Ascochyta blight response in chickpea. The complexity of the vernalization response and the inefficiency of our selection experiments (below) required quitting the work on ascochyta response in the framework of this project. Background to the subject: Since its introduction to the Palouse region of WA and Idaho, and the northern Great Plains, chickpea has been a spring rotation legume due to lack of winter hardiness. The short growing season of spring chickpea limits its grain yield and leaves relatively little stubble residue for combating soil erosion. In Israel, chilling temperatures limit pod setting in early springs and narrow the effective reproductive time window of the crop. Winter hardiness and vernalization response of chickpea alleles were lost due to a series of evolutionary bottlenecks; however, such alleles are prevalent in its wild progenitor’s genepool. Major conclusions, solutions, achievements: It appears that both vernalization response and winter hardiness are polygenic traits in the wild-domesticated chickpea genepool. The main conclusion from the fieldwork in Israel is that selection of domesticated winter hardy and vernalization responsive types should be conducted in late flowering and late maturity backgrounds to minimize interference by daylength and temperature response alleles (see our Plant Breeding paper on the subject). The main conclusion from the US winter-hardiness studies is that excellent lines have been identified for germplasm release and continued genetic study. Several of the lines have good seed size and growth habit that will be useful for introgressing winter-hardiness into current chickpea cultivars to develop releases for autumn sowing. We sequenced the transcriptomes and profiled the expression of genes in 87 samples. Differential expression analysis identified a total of 2,452 differentially expressed genes (DEGs) between vernalized plants and control plants, of which 287 were shared between two or more Cicer species studied. We cloned 498 genes controlling vernalization, named CVRN genes. Each of the CVRN genes contributes to flowering date advance (FDA) by 3.85% - 10.71%, but 413 (83%) other genes had negative effects on FDA, while only 83 (17%) had positive effects on FDA, when the plant is exposed to cold temperature. The cloned CVRN genes provide new toolkits and knowledge to develop chickpea cultivars that are suitable for autumn-sowing. Scientific & agricultural implications: Unlike the winter cereals (barley, wheat) or pea, in which a single allelic change may induce a switch from winter to spring habit, we were unable to find any evidence for such major gene action in chickpea. In agricultural terms this means that an alternative strategy must be employed in order to isolate late flowering – ascochyta resistant (winter types) domesticated forms to enable autumn sowing of chickpea in the US Great Plains. An environment was identified in U.S. (eastern Washington) where autumn-sown chickpea production is possible using the levels of winter-hardiness discovered once backcrossed into advanced cultivated material with acceptable agronomic traits. The cloned CVRN genes and identified gene networks significantly advance our understanding of molecular mechanisms underlying plant vernalization in general, and chickpea in particular, and provide a new toolkit for switching chickpea from a spring-sowing to autumn-sowing crop.