CN105608257A - Method for generating large-scale optimal pinouts in BGA package based on genetic algorithm - Google Patents
Method for generating large-scale optimal pinouts in BGA package based on genetic algorithm Download PDFInfo
- Publication number
- CN105608257A CN105608257A CN201510940321.4A CN201510940321A CN105608257A CN 105608257 A CN105608257 A CN 105608257A CN 201510940321 A CN201510940321 A CN 201510940321A CN 105608257 A CN105608257 A CN 105608257A
- Authority
- CN
- China
- Prior art keywords
- pin
- individual
- individuality
- population
- winchrom
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 29
- 230000002068 genetic effect Effects 0.000 title claims abstract description 18
- 230000003044 adaptive effect Effects 0.000 claims description 26
- 239000011159 matrix material Substances 0.000 claims description 17
- 238000005538 encapsulation Methods 0.000 claims description 13
- VYZAMTAEIAYCRO-UHFFFAOYSA-N Chromium Chemical compound [Cr] VYZAMTAEIAYCRO-UHFFFAOYSA-N 0.000 claims description 11
- 230000008569 process Effects 0.000 claims description 9
- 238000009826 distribution Methods 0.000 claims description 7
- 230000017105 transposition Effects 0.000 claims description 6
- 238000010835 comparative analysis Methods 0.000 claims description 4
- 230000008878 coupling Effects 0.000 claims description 2
- 238000010168 coupling process Methods 0.000 claims description 2
- 238000005859 coupling reaction Methods 0.000 claims description 2
- 238000001514 detection method Methods 0.000 claims description 2
- 230000004044 response Effects 0.000 claims description 2
- 230000001932 seasonal effect Effects 0.000 claims description 2
- 230000006870 function Effects 0.000 abstract description 7
- 238000005516 engineering process Methods 0.000 description 6
- 108090000623 proteins and genes Proteins 0.000 description 4
- 230000008859 change Effects 0.000 description 3
- 230000035772 mutation Effects 0.000 description 3
- 238000005457 optimization Methods 0.000 description 3
- 230000006978 adaptation Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 230000005855 radiation Effects 0.000 description 2
- XUIMIQQOPSSXEZ-UHFFFAOYSA-N Silicon Chemical compound [Si] XUIMIQQOPSSXEZ-UHFFFAOYSA-N 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000002759 chromosomal effect Effects 0.000 description 1
- 230000000052 comparative effect Effects 0.000 description 1
- 238000010353 genetic engineering Methods 0.000 description 1
- 230000008303 genetic mechanism Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000005304 joining Methods 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000035800 maturation Effects 0.000 description 1
- 238000004806 packaging method and process Methods 0.000 description 1
- 238000012856 packing Methods 0.000 description 1
- 230000002028 premature Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
- 238000010845 search algorithm Methods 0.000 description 1
- 238000010187 selection method Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 229910052710 silicon Inorganic materials 0.000 description 1
- 239000010703 silicon Substances 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 239000000758 substrate Substances 0.000 description 1
- 230000004083 survival effect Effects 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/30—Circuit design
- G06F30/39—Circuit design at the physical level
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/12—Computing arrangements based on biological models using genetic models
- G06N3/126—Evolutionary algorithms, e.g. genetic algorithms or genetic programming
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Biophysics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Health & Medical Sciences (AREA)
- General Physics & Mathematics (AREA)
- Evolutionary Biology (AREA)
- General Engineering & Computer Science (AREA)
- Evolutionary Computation (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Bioinformatics & Computational Biology (AREA)
- Computer Hardware Design (AREA)
- Biomedical Technology (AREA)
- General Health & Medical Sciences (AREA)
- Genetics & Genomics (AREA)
- Artificial Intelligence (AREA)
- Geometry (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Physiology (AREA)
- Molecular Biology (AREA)
- Computing Systems (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Measuring Or Testing Involving Enzymes Or Micro-Organisms (AREA)
- Design And Manufacture Of Integrated Circuits (AREA)
Abstract
The present invention relates to a method for generating large-scale optimal pinouts in a BGA (Ball Grid Array) package based on a genetic algorithm. The method not only effectively solves a problem that a large number of I/O pins, P/G pins must be accommodated within a signal package and even a smaller volume since more feature functions are integrated into a signal subpackage, but also enables large-scale optimal pinouts to be automatically generated, so that the problem of signal integrity can be reduced.
Description
Technical field
The present invention relates to extensive BGA encapsulation technology field, more specifically, relate to a kind of based on genetic algorithmExtensive BGA encapsulate optimum pin distribution generation method.
Background technology
Along with the continuous progress of electronic information technology and Product Process, the chip integration of chip improves constantly, I/ONumber of pins sharply increases, and power consumption also increases thereupon, also stricter to the requirement of integrated antenna package. For fullThe needs of foot product.
BGA encapsulation starts to be applied to produce. BGA is the english abbreviation of Ball-Gird-Array, sphericalEncapsulation, as chip encapsulation technology of new generation, his operation principle is to make battle array in the bottom of packaging body substrateRow soldered ball, as the I/O end and printed substrate (PCB) interconnection of circuit, mounts device phase with traditional pin shapeRatio, bga device has a lot of good characteristics, as more in I/O number, improved and mount yield rate, potentialThereby reduction cost, be conducive to heat radiation, due to the very short transmission path that shortens signal of soldered ball pin, subtractFew lead-in inductance, resistance, thus the whole performance etc. of circuit can be improved.
In recent years, along with continuous maturation and the progress of semiconductor silicon technology, the enriching constantly with the many of performance of productSample, causes the encapsulation of BGA product complicated all the more, and the number of pins of chip sharply increases, and is accompanied by BGA envelopeThe continuous difficulty that signal in dress, power pins distribute, tends to be accompanied by the problem of many signal integrities, asCrosstalk, track collapse electromagnetic interference, radiation etc. How could in BGA encapsulation, realize better pin dividesJoin, seem especially important.
In recent years, in production and chip are arranged, the method for a lot of pin Optimal Distribution is proposed successively,This research be mainly by genetic algorithm quoting in BGA layout realize optimum pin and distribute.
Genetic algorithm (GeneticAlgorithm) be one class use for reference living nature evolution laws (survival of the fittest, winningThe bad genetic mechanism of eliminating) develop and next randomization searching method. It is the J.Holland professor 1975 by the U.S.First year proposes, and its main feature is directly structure objects to be operated, and does not have differentiate and continuousRestriction; There is inherent disguise and better global optimizing ability; Adopt the optimization method of randomization, can be certainlyThe moving search volume that obtains and instruct optimization, adjusts the direction of search adaptively, does not need the rule of determining. LoseThese character of propagation algorithm, by people be widely used in Combinatorial Optimization, machine learning, signal processing, fromAdapt to the fields such as control and artificial life, it is modern about the key technology in intelligence computation.
Arranging in process at BGA pin, how to reduce as far as possible time loss and confirm global optimum, is mePrimary study direction. What mainly take is on the basis of genetic algorithm, to use static template to generate fast optimumPin.
Summary of the invention
The object of the invention is to overcome a large amount of pins arranges and causes complicated package design or even seriousThe phenomenon of problems of Signal Integrity, provides a kind of extensive BGA based on genetic algorithm to encapsulate optimum pin and dividesCloth generation method, this method not only solves effectively along with more power function is integrated in signal packing,A large amount of I/O pins, P/G pin must be contained in this problem in the volume that signal assemble is even less, andAnd can also automatically bear on a large scale optimum pin and distribute, to reduce the problem of signal integrity.
For realizing above goal of the invention, the technical scheme of employing is:
Extensive BGA based on genetic algorithm encapsulates an optimum pin distribution generation method, comprises following stepRapid:
S1. the BGA that is M*N for number of pins encapsulation, its pin distributes next by the matrix D of M*NRepresent, wherein represent respectively power supply signal pin, earth signal pin and spacing wave pin with 1,2,0;
S2. selected K encapsulation scheme, and represent that respectively its pin distributes, K envelope with the matrix of M*NDress forecast scheme configuration population Chrom, encapsulation scheme is as the individuality in population Chrom, this seasonal iterationst=0;
S3. K individual population Chrom random alignment will be contained;
S4. the individual fitness value of population Chrom is evaluated to detection;
S5. the individuality in population Chrom is compared between two according to its fitness value, will be between two suitable in relativelyThe good individuality of response is put into the container of WinChrom, and in the container of WinChrom, total N is individual;
S6. make the individuality in WinChrom mate intersection, coupling intersect position by random number m1,M2, n1, n2 determine, if m1 is less than m2, the line position of the intersection region of a volume matrix arrives in m1+1Between m2, if m1 is greater than m2, the line position of the intersection region of a volume matrix is in 1 to m2 or m1+1Between K, n1, n2 are for determining the row of intersection region, the same m1 of its principle, m2. Can confirm thusJoin intersection region;
S7. judge whether power supply signal pin, earth signal number of pins that the individual relative after intersecting is answered have occurredChange, continue if not execution step S8;
S8. make the individuality in WinChrom make a variation, first calculate variation Probability pm:
Wherein fMax、fiFor adapting to most individual adaptive value, population mean P in population WinChrom respectivelyIndividual adaptive value should be worth, make a variation;
S8. in variation probability, judge whether individual power supply signal pin, the earth signal pin of variation equals to becomeTotal number of pins of different individuality, if by certain power supply signal pin and earth signal pin transposition, if not,Utilize rand function random number that produces between (0,1), if this number is greater than Pm, by individuality certainIndividual power supply signal pin and earth signal pin transposition, otherwise by certain power supply signal pin in individuality or groundSignal pins and spacing wave pin switch;
S9.N WinChrom carries out producing (K-N) individual WinChrom offspring after cross-matched, variation,By N WinChrom and (K-N) individual WinChrom offspring combination, form population NewChrom of new generation;
S10. calculate each individual adaptive value in population NewChrom, select the best individuality of adaptive value to beBestInd;
S11. make t=t+1, using population NewChrom as initial population repeated execution of steps S3~S10 untilt>k;
S12. preserve the optimum individual BestInd of each iteration in container B estInd_Temp, by relatively dividingAnalyse the adaptive value of each BestInd in BestInd_Temp and obtain optimal pin assignment.
Preferably, the adaptive value of described step S10 is defined as
f(x)=w×Msum(A)+Dsum(A)w∈[0,∞);
Wherein w is non-negative weight coefficient, Msum(A) be individual total inductance, Dsum(A) for individuality returns to roadPath quality.
Preferably, described weight coefficient w=0.75.
Preferably, individual total inductance Msum(A) be expressed as follows:
aijFor-1,0,1, represent respectively pin i and pin, j is at direction, pin i=pin j, the pin of oppositionI is with pin j in these three kinds of different situations of identical direction, and G represents total number of pins, dijRepresent pin iAnd the distance between pin j, M 'pijRepresent the local mutual inductance of the pin of the capable j row of i, dMaxFor fixed value,Represent the maximum of pin-pitch.
Preferably, described individual return path quality representation is as follows:
Wherein DminThe vector that in representing matrix, the least member of every row forms, G represents pin total number, djLeast member in j row in representing matrix D, var (Dmin) expression DminMean square deviation.
Preferably, in described step S12, by fitting of each BestInd in comparative analysis BestInd_TempShould be worth that to obtain the process of optimal pin assignment specific as follows:
Whether the number that S121. judges BestInd in BestInd_Temp is greater than 1 is less than 8, if carry out stepRapid S123, otherwise execution step S122;
S122. export the individuality of adaptive value maximum;
S123. judge in BestInd_Temp whether have identical individuality, if export the individual of adaptive value maximumBody, otherwise execution step S121.
Compared with prior art, the invention has the beneficial effects as follows:
(1) greatly improve the efficiency that pin distributes, improved signal integrity;
(2) human eye can directly carry out visual assessment to final result;
(3) shorten time of whole extensive BGA package design, can extensively be useful in modern extensive high propertyIn energy system in package.
Brief description of the drawings
Fig. 1 is the flow chart of optimum pin distribution generation method.
Fig. 2 is the interconversion relation judgement figure of signal of telecommunication pin, earth signal pin, spacing wave pin.
Fig. 3 obtains optimal pin by the adaptive value of each BestInd in comparative analysis BestInd_Temp to divideThe process schematic diagram of joining.
Fig. 4 uses matrix notation pin to divide other exemplary plot.
Fig. 5 is the schematic diagram of the algorithm of tournament selection after improvement.
Fig. 6 is definite exemplary plot of intersection region.
Detailed description of the invention
Accompanying drawing, only for exemplary illustration, can not be interpreted as the restriction to this patent;
Below in conjunction with drawings and Examples, the present invention is further elaborated.
Embodiment 1
As shown in Figure 1, optimum pin distribution generation method is specifically implemented as follows:
1. initialize population
The BGA encapsulation that a given number of pins is M*N size, we can be by a M*N for this pin clothMatrix notation, can transmit by proposing a kind of matrix coder mode the rule that in BGA encapsulation, pin distributes here,Respectively with 1,2,0 replace power supply,, other signal pins arrange rule as shown in Figure 4. Pass throughUse the mode of matrix coder, first we are than being easier to obtain in matrix the distance of pair of pins arbitrarily, therebyFacilitate our calculating target function; Secondly be easier to realize for the operation ratio of gene pin.
In addition, between each individuality of initial population, should maintain a certain distance, and define equal length withA certain constant is that in two character strings of base, corresponding different quantity is broad sense Hamming distance between the two, this requirementThe bright sea of broad sense distance between the individuality of selected initial population must be greater than the value of certain setting. Adopt in this wayCan ensure has obvious difference between random each individuality producing, and makes them can be evenly distributed on solution spaceIn, increase the possibility of obtaining globally optimal solution. Simultaneously the size of initial population is also by the whole genetic algorithm of impactEfficiency, scale is larger, can obtain globally optimal solution, but meanwhile aspect time loss, can pay moreLarge cost.
2. select
By algorithm of tournament selection method to the selection of reducing by half of initial population individuality. Again with traditional algorithm of tournament selectionAlgorithm has difference, and traditional algorithm of tournament selection easily reduces the diversity of early stage population, strangles other may have entirelyThe gene of office's optimal solution, causes genetic algorithm to restrain in advance; May, the later stage, certain be connect very much againThe individuality of nearly globally optimal solution, because of crossover and mutation, on the contrary away from optimal solution, causes evolutionary rate very slow,Even cannot converge to globally optimal solution. The algorithm of tournament selection of improvement version as shown in Figure 5, specific implementation process asUnder:
(1) M individual population Chrom random alignment will be contained;
(2) individuality is compared between two, being 1 as sequence number compares with 2, and sequence number is 3,4Compare, each group relevance grade best individuality is put into the container (N altogether) of WinChrom,If last individuality of odd number of individual is directly stored in WinChrom.
(3) N WinChrom carried out to mutual crossover and mutation computing, produce (M-N) individual WinChromOffspring.
(4) by N WinChrom and (M-N) individual WinChrom offspring combination, form a new generation and plantGroup NewChrom.
3. intersect
Intersection is the built-in function that encoder matrix is carried out, and it must standard keep three principles 1. between generations simultaneouslyMust ensure that high heredity is in the time of interlace operation; 2. interlace operation at random existence always change whole GAAbility of searching optimum; 3. interlace operation should not destroy chromosomal validity. Specifically be implemented as follows:
(1) produce at random m1、m2、n1、n2If, m1Be less than m2, the line position of intersection region is in m1+1To m2Between; If m1Be greater than m2, the line position of intersection region is in 1 to m2Or m1Between+1 to M.For the row n of intersection region1With n2In like manner, as shown in Figure 6.
(2) carry out legitimacy matching judgment, the individual A power supply ground number of pins corresponding with B after intersectionThere is change, in order to maintain individual legitimacy, cross one another individual guarantee will with original power supply drawPin number is identical. Can be divided into nine kinds of situation discussion, reach pin style specifications.
(3) intersection offspring and prechiasmal population at individual are combined, form new population, can deriveThe individual while making new advances also can ensure that already present optimal base is because retaining, and can not lose because of interlace operation excellentElegant individual.
4. variation
Variation is the process of an accelerating ated test, in the last optimizing process of genetic algorithm, can keep populationDiversity and prevent the Premature Convergence of population.
In general genetic manipulation, fixing variation probability P m has had a strong impact on convergence of algorithm performance, ifPm is too small, is just not easy to produce new individuality, causes Evolution of Population slow; If Pm is excessive, that willDestroy the heritability that interlace operation brings, caused search to become pure random search algorithm. Here adoptWith a kind of self adaptation adjustment based on the average relevance grade of ideal adaptation degree and colony variation probability:
Wherein fMax、fiBe respectively and in a Chorm of colony, adapt to individual adaptive value most, plant group meanAdaptive value, the individual adaptive value that makes a variation, can find out from above formula, adaptive value is than little being endowed of mean valueHigh variation probability, produces new individuality for suddenling change, and explores the farther solution in space far away; Adaptive value is than averageThe individuality that value is high has less variation probability, outstanding gene is retained and intersect the next generation,Variation, the strategy of the outstanding gene of this reservation is more conducive to explore local optimum. Concrete mutation process is as follows:
In variation probability, judge whether power supply ground number of pins equals total number of pins, if certain power supply is drawnPin and ground pin transposition, if not, utilize rand function random number that produces between (0,1),If this number is greater than 0.7, by certain power supply signal pin in individuality and earth signal pin transposition, otherwise willCertain power supply signal pin or earth signal pin and spacing wave pin switch in individuality; Specific implementation methodAs shown in Figure 2.
5. preferred
To wait sequence of operations population and initial population to be afterwards combined into number of individuals with variation through intersectingThe new population that order is double, and calculate whole individual adaptive values based on two object functions in new population, countA best individuality is BestInd, and definition adaptive value is:
f(x)=w×Msum(A)+Dsum(A)w∈[0,∞);
Wherein w is a non-negative weight coefficient, Msum(A) be individual total inductance, Dsum(A) for individuality returnsLoop path quality, is a very important step for suitable weight coefficient is set, if w is too little, and whole something lostPropagation algorithm will more be paid close attention to return path quality, and ignore the mutual inductance between each pin, if weight coefficient w tooGreatly, algorithm can more be paid attention to the inductance between each pin, thereby ignores return path quality. Through a series of realityTest comparison comparative analysis, w=0.75 can reasonable balance both sides relation, and adaptive value can apply to variousThe power supply ground pin assignment ratio of various kinds.
Iterative cycles is carried out GA, if population is without any evolution in the circulation in continuous 80 generations, retains outstandingIndividual BestInd, in container B estInd_Temp, then resets to population comprehensively, by comparative analysisIn BestInd_Temp, the adaptive value of each BestInd obtains optimal pin assignment, specific implementation method asShown in Fig. 3.
Obviously, the above embodiment of the present invention is only for example of the present invention is clearly described, and is notIt is the restriction to embodiments of the present invention. For those of ordinary skill in the field, in above-mentioned explanationBasis on can also make other changes in different forms. Here without also cannot be to all enforcementMode gives exhaustive. All any amendments of doing within the spirit and principles in the present invention, be equal to replace and improveDeng, within all should being included in the protection domain of the claims in the present invention.
Claims (6)
1. the extensive BGA based on genetic algorithm encapsulates an optimum pin distribution generation method, and its feature existsIn: comprise the following steps:
S1. the BGA that is M*N for number of pins encapsulation, its pin distributes next by the matrix D of M*NRepresent, wherein represent respectively power supply signal pin, earth signal pin and spacing wave pin with 1,2,0;
S2. selected K encapsulation scheme, and represent that respectively its pin distributes, K envelope with the matrix of M*NDress forecast scheme configuration population Chrom, encapsulation scheme is as the individuality in population Chrom, this seasonal iterationst=0;
S3. K individual population Chrom random alignment will be contained;
S4. the individual fitness value of population Chrom is evaluated to detection;
S5. the individuality in population Chrom is compared between two according to its fitness value, will be between two suitable in relativelyThe good individuality of response is put into the container of WinChrom, and in the container of WinChrom, total N is individual;
S6. make the individuality in WinChrom mate intersection, coupling intersect position by random number m1,M2, n1, n2 determine, if m1 is less than m2, the line position of the intersection region of a volume matrix arrives in m1+1Between m2, if m1 is greater than m2, the line position of the intersection region of a volume matrix is in 1 to m2 or m1+1Between K, n1, n2 are for determining the row of intersection region, the same m1 of its principle, m2. Can confirm thusJoin intersection region;
S7. judge whether power supply signal pin, earth signal number of pins that the individual relative after intersecting is answered have occurredChange, continue if not execution step S8;
S8. make the individuality in WinChrom make a variation, first calculate variation Probability pm:
WhereinFor adapting to most individual adaptive value, population mean P in population WinChrom respectivelyIndividual adaptive value should be worth, make a variation;
S8. in variation probability, judge whether individual power supply signal pin, the earth signal pin of variation equals to becomeTotal number of pins of different individuality, if by certain power supply signal pin and earth signal pin transposition, if not,Utilize rand function random number that produces between (0,1), if this number is greater than Pm, by individuality certainIndividual power supply signal pin and earth signal pin transposition, otherwise by certain power supply signal pin in individuality or groundSignal pins and spacing wave pin switch;
S9.N WinChrom carries out producing (K-N) individual WinChrom offspring after cross-matched, variation,By N WinChrom and (K-N) individual WinChrom offspring combination, form population NewChrom of new generation;
S10. calculate each individual adaptive value in population NewChrom, select the best individuality of adaptive value to beBestInd;
S11. make t=t+1, using population NewChrom as initial population repeated execution of steps S3~S10 untilt>k;
S12. preserve the optimum individual BestInd of each iteration in container B estInd_Temp, by relatively dividingAnalyse the adaptive value of each BestInd in BestInd_Temp and obtain optimal pin assignment.
2. it is raw that the extensive BGA based on genetic algorithm according to claim 1 encapsulates optimum pin distributionOne-tenth method, is characterized in that: the adaptive value of described step S10 is defined as
f(x)=w×Msum(A)+Dsum(A)w∈[0,∞);
Wherein w is non-negative weight coefficient, Msum(A) be individual total inductance, Dsum(A) for individuality returns to roadPath quality.
3. it is raw that the extensive BGA based on genetic algorithm according to claim 2 encapsulates optimum pin distributionOne-tenth method, is characterized in that: described weight coefficient w=0.75.
4. it is raw that the extensive BGA based on genetic algorithm according to claim 2 encapsulates optimum pin distributionOne-tenth method, is characterized in that: individual total inductance Msum(A) be expressed as follows:
aijFor-1,0,1, represent respectively pin i and pin j direction, pin i=pin j, the pin in oppositionI is with pin j in these three kinds of different situations of identical direction, and G represents total number of pins, dijRepresent pin iAnd the distance between pin j, M 'pijRepresent the local mutual inductance of the pin of the capable j row of i, dMaxFor fixed value,Represent the maximum of pin-pitch.
5. it is raw that the extensive BGA based on genetic algorithm according to claim 2 encapsulates optimum pin distributionOne-tenth method, is characterized in that: described individual return path quality representation is as follows:
Wherein DminThe vector that in representing matrix, the least member of every row forms, G represents pin total number, djLeast member in j row in representing matrix D, var (Dmin) expression DminMean square deviation.
6. it is raw that the extensive BGA based on genetic algorithm according to claim 1 encapsulates optimum pin distributionOne-tenth method, is characterized in that: in described step S12, by each in comparative analysis BestInd_TempIt is specific as follows that the adaptive value of BestInd obtains the process of optimal pin assignment:
Whether the number that S121. judges BestInd in BestInd_Temp is greater than 1 is less than 8, if carry out stepRapid S123, otherwise execution step S122;
S122. export the individuality of adaptive value maximum;
S123. judge in BestInd_Temp whether have identical individuality, if export the individual of adaptive value maximumBody, otherwise execution step S121.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510940321.4A CN105608257B (en) | 2015-12-15 | 2015-12-15 | The optimal pin of extensive BGA package based on genetic algorithm is distributed generation method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510940321.4A CN105608257B (en) | 2015-12-15 | 2015-12-15 | The optimal pin of extensive BGA package based on genetic algorithm is distributed generation method |
Publications (2)
Publication Number | Publication Date |
---|---|
CN105608257A true CN105608257A (en) | 2016-05-25 |
CN105608257B CN105608257B (en) | 2018-12-21 |
Family
ID=55988189
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201510940321.4A Active CN105608257B (en) | 2015-12-15 | 2015-12-15 | The optimal pin of extensive BGA package based on genetic algorithm is distributed generation method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN105608257B (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108363839A (en) * | 2018-01-23 | 2018-08-03 | 佛山市顺德区中山大学研究院 | The optimal pin of extensive BGA package based on priori is distributed generation method |
CN115169276A (en) * | 2022-07-22 | 2022-10-11 | 北京云枢创新软件技术有限公司 | Pin area matching method based on stacking module |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6521846B1 (en) * | 2002-01-07 | 2003-02-18 | Sun Microsystems, Inc. | Method for assigning power and ground pins in array packages to enhance next level routing |
US20040212103A1 (en) * | 2000-06-19 | 2004-10-28 | Herman Kwong | Techniques for pin arrangements in circuit chips |
CN1940946A (en) * | 2005-09-13 | 2007-04-04 | 阿尔卡特公司 | Area array routing masks for improved escape of devices on PCB |
CN101197356A (en) * | 2006-12-08 | 2008-06-11 | 育霈科技股份有限公司 | Multi-chip package structure and its forming method |
CN102237324A (en) * | 2010-04-29 | 2011-11-09 | 国碁电子(中山)有限公司 | Integrated circuit packaging structure and method |
CN203445108U (en) * | 2013-07-10 | 2014-02-19 | 詹泽明 | Chip packaging and switching board and circuit board with chip packaging and switching board |
-
2015
- 2015-12-15 CN CN201510940321.4A patent/CN105608257B/en active Active
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040212103A1 (en) * | 2000-06-19 | 2004-10-28 | Herman Kwong | Techniques for pin arrangements in circuit chips |
US6521846B1 (en) * | 2002-01-07 | 2003-02-18 | Sun Microsystems, Inc. | Method for assigning power and ground pins in array packages to enhance next level routing |
CN1940946A (en) * | 2005-09-13 | 2007-04-04 | 阿尔卡特公司 | Area array routing masks for improved escape of devices on PCB |
CN101197356A (en) * | 2006-12-08 | 2008-06-11 | 育霈科技股份有限公司 | Multi-chip package structure and its forming method |
CN102237324A (en) * | 2010-04-29 | 2011-11-09 | 国碁电子(中山)有限公司 | Integrated circuit packaging structure and method |
CN203445108U (en) * | 2013-07-10 | 2014-02-19 | 詹泽明 | Chip packaging and switching board and circuit board with chip packaging and switching board |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108363839A (en) * | 2018-01-23 | 2018-08-03 | 佛山市顺德区中山大学研究院 | The optimal pin of extensive BGA package based on priori is distributed generation method |
CN108363839B (en) * | 2018-01-23 | 2022-03-08 | 佛山市顺德区中山大学研究院 | Priori knowledge based optimal pin distribution generation method for large-scale BGA package |
CN115169276A (en) * | 2022-07-22 | 2022-10-11 | 北京云枢创新软件技术有限公司 | Pin area matching method based on stacking module |
CN115169276B (en) * | 2022-07-22 | 2023-04-07 | 北京云枢创新软件技术有限公司 | Pin area matching method based on stacking module |
Also Published As
Publication number | Publication date |
---|---|
CN105608257B (en) | 2018-12-21 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Degertekin et al. | Parameter free Jaya algorithm for truss sizing-layout optimization under natural frequency constraints | |
CN104899374B (en) | Based on small echo variation wind Drive Optimization algorithm collinear array Pattern Synthesis method | |
White | Density matrix renormalization group algorithms with a single center site | |
US20200052412A1 (en) | Method for array elements arrangement of l-shaped array antenna based on inheritance of acquired character | |
CN107153800A (en) | A kind of reader antenna Optimization deployment scheme that alignment system is recognized based on the super high frequency radio frequency for improving chicken group's algorithm | |
CN107657098A (en) | Perimeter antenna array Sparse methods based on quantum chicken group's mechanism of Evolution | |
Jiao et al. | Antenna design using dynamic multi‐objective evolutionary algorithm | |
CN108319759A (en) | A kind of antenna arrangement method for improving with platform antenna isolation | |
CN105608257A (en) | Method for generating large-scale optimal pinouts in BGA package based on genetic algorithm | |
CN106874555A (en) | A kind of Reed Muller logic circuits power consumption and area-optimized method | |
CN104679947A (en) | Automatic generation method of cable component optimizing structure of mechanical and electrical product | |
CN115329710B (en) | Heat pipe constraint assembly layout optimization method based on genetic algorithm | |
CN109145342A (en) | Automatic wiring system and method | |
Dan et al. | Clustering approach for solving traveling salesman problems via Ising model based solver | |
CN108875915B (en) | A kind of depth confrontation network optimized approach of Embedded application | |
Noilublao et al. | Simultaneous topology, shape, and sizing optimisation of plane trusses with adaptive ground finite elements using MOEAs | |
Ram et al. | Optimal design of non-uniform circular antenna arrays using PSO with wavelet mutation | |
Ewert et al. | Efficient per query information extraction from a hamming oracle | |
CN107729431A (en) | A kind of improved harmony chess game optimization method | |
Fu et al. | An Improved Chaos Genetic Algorithm for T‐Shaped MIMO Radar Antenna Array Optimization | |
CN106682729A (en) | BP neural network MapReduce training method based on local convergence weight matrix evolution | |
CN104376363B (en) | A kind of multiphase orthogonal code generating method based on improved immune genetic algorithm | |
CN110113815A (en) | A kind of improved wireless sensor network locating method based on IWO | |
Long et al. | Pattern synthesis for opportunistic array radar using least square fitness estimation‐genetic algorithm method | |
CN113312852B (en) | Method for predicting glass dielectric loss based on neural network algorithm |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |