Patent application number | Description | Published |
20100074015 | SENSING FOR MEMORY READ AND PROGRAM VERIFY OPERATIONS IN A NON-VOLATILE MEMORY DEVICE - Methods for sensing in a memory device, a memory device, and a memory system are disclosed. In one such sensing method, a single read operation with multiple sense amplifier circuit comparisons to a reference threshold level are performed to determine a state of a selected memory cell. A ramped voltage turns on the selected memory cell when the ramped voltage reaches the threshold voltage to which the selected memory cell is programmed. In one embodiment, the turned on memory cell discharges its respective bit line. | 03-25-2010 |
20100110789 | MEMORY DEVICE BIASING METHOD AND APPARATUS - Memory devices and methods are disclosed, such as those facilitating data line shielding by way of capacitive coupling with data lines coupled to a memory string source line. For example, alternating data lines are sensed while adjacent data lines are coupled to a common source line of the data lines being sensed. Data line shielding methods and apparatus disclosed can reduce effects of source line bounce occurring during a sense operation of a memory device. | 05-06-2010 |
20100211733 | DATA VALID INDICATION METHOD AND APPARATUS - Memory devices and methods facilitate handling of data received by a memory device through the use of data grouping and assignment of data validity status values to grouped data. For example, data is received and delineated into one or more data groups and a data validity status is associated with each data group. Data groups having a valid status are latched into one or more cache registers for storage in an array of memory cells wherein data groups comprising an invalid status are rejected by the one or more cache registers. | 08-19-2010 |
20110063919 | MEMORY KINK CHECKING - This disclosure concerns memory kink checking. One embodiment includes selectively applying one of a plurality of voltages to a first data line according to a programming status of a first memory cell, wherein the first memory cell is coupled to the first data line and to a selected access line. An effect on a second data line is determined, due at least in part to the voltage applied to the first data line and a capacitive coupling between at least the first data line and the second data line, wherein the second data line is coupled to a second memory cell, the second memory cell is adjacent to the first memory cell, and the second memory cell is coupled to the selected access line. A kink correction is applied to the second data line, responsive to the determined effect, during a subsequent programming pulse applied to the second memory cell. | 03-17-2011 |
20110310675 | LOCAL SENSING IN A MEMORY DEVICE - Methods for sensing, memory devices, and memory systems are disclosed. In one such memory device, a local sense circuit provides sensing of an upper group of memory cells while a global sense circuit provides sensing of a lower group of memory cells. Data sensed by the local sense circuit is transferred to the global sense circuit over local data lines or a global transfer line that is multiplexed to the local data lines. An alternate embodiment uses the local sense circuit to sense both upper and lower groups of memory cells. | 12-22-2011 |
20120170372 | MEMORY DEVICE BIASING METHOD AND APPARATUS - Memory devices and methods are disclosed, such as those facilitating data line shielding by way of capacitive coupling with data lines coupled to a memory string source line. For example, alternating data lines are sensed while adjacent data lines are coupled to a common source line of the data lines being sensed. Data line shielding methods and apparatus disclosed can reduce effects of source line bounce occurring during a sense operation of a memory device. | 07-05-2012 |
20120240011 | METHODS, DEVICES, AND SYSTEMS FOR DATA SENSING - The present disclosure includes methods and devices for data sensing. One such method includes performing a number of successive sense operations on a number of memory cells using a number of different sensing voltages, determining a quantity of the number memory cells that change states between consecutive sense operations of the number of successive sense operations, and determining, based at least partially on the determined quantity of the number of memory cells that change states between consecutive sense operations, whether to output hard data corresponding to one of the number of successive sense operations. | 09-20-2012 |
20130003465 | LOCAL SENSING IN A MEMORY DEVICE - Methods for sensing, memory devices, and memory systems are disclosed. In one such memory device, a local sense circuit provides sensing of an upper group of memory cells while a global sense circuit provides sensing of a lower group of memory cells. Data sensed by the local sense circuit is transferred to the global sense circuit over local data lines or a global transfer line that is multiplexed to the local data lines. An alternate embodiment uses the local sense circuit to sense both upper and lower groups of memory cells. | 01-03-2013 |
20130294156 | MEMORY KINK CHECKING - This disclosure concerns memory kink checking. One embodiment includes selectively applying one of a plurality of voltages to a first data line according to a programming status of a first memory cell, wherein the first memory cell is coupled to the first data line and to a selected access line. An effect on a second data line is determined, due at least in part to the voltage applied to the first data line and a capacitive coupling between at least the first data line and the second data line, wherein the second data line is coupled to a second memory cell, the second memory cell is adjacent to the first memory cell, and the second memory cell is coupled to the selected access line. A kink correction is applied to the second data line, responsive to the determined effect, during a subsequent programming pulse applied to the second memory cell. | 11-07-2013 |
20130322170 | MEMORY CELL SENSING - This disclosure concerns memory cell sensing. One or more methods include determining a data state of a first memory cell coupled to a first data line, determining a data state of a third memory cell coupled to a third data line, transferring determined data of at least one of the first and the third memory cells to a data line control unit corresponding to a second data line to which a second memory cell is coupled, the second data line being adjacent to the first data line and the third data line, and determining a data state of the second memory cell based, at least partially, on the transferred determined data. | 12-05-2013 |
20140068186 | METHODS AND APPARATUS FOR DESIGNATING OR USING DATA STATUS INDICATORS - Memory devices and methods facilitate handling of data received by a memory device through the use of data grouping and assignment of data validity status values to grouped data. For example, data is received and delineated into one or more data groups and a data validity status is associated with each data group. Data groups having a valid status are latched into one or more cache registers for storage in an array of memory cells wherein data groups comprising an invalid status are rejected by the one or more cache registers. | 03-06-2014 |
20140189465 | METHODS, DEVICES, AND SYSTEMS FOR DATA SENSING - The present disclosure includes methods and devices for data sensing. One such method includes performing a number of successive sense operations on a number of memory cells using a number of different sensing voltages, determining a quantity of the number memory cells that change states between consecutive sense operations of the number of successive sense operations, and determining, based at least partially on the determined quantity of the number of memory cells that change states between consecutive sense operations, whether to output hard data corresponding to one of the number of successive sense operations. | 07-03-2014 |
20140286092 | MEMORY KINK CHECKING - This disclosure concerns memory kink checking. One embodiment includes selectively applying one of a plurality of voltages to a first data line according to a programming status of a first memory cell, wherein the first memory cell is coupled to the first data line and to a selected access line. An effect on a second data line is determined, due at least in part to the voltage applied to the first data line and a capacitive coupling between at least the first data line and the second data line, wherein the second data line is coupled to a second memory cell, the second memory cell is adjacent to the first memory cell, and the second memory cell is coupled to the selected access line. A kink correction is applied to the second data line, responsive to the determined effect, during a subsequent programming pulse applied to the second memory cell. | 09-25-2014 |
20140321202 | DEFECTIVE BLOCK MANAGEMENT - In a flash memory, erase blocks containing shorted or broken word lines may be used, at least in part, to store user data. Such blocks may use different parameters to those used by non-defective blocks, may be subject to different wear leveling, and may store data selected to reduce the number of access operations. | 10-30-2014 |
20150046770 | SENSING PARAMETER MANAGEMENT IN NON-VOLATILE MEMORY STORAGE SYSTEM TO COMPENSATE FOR BROKEN WORD LINES - Disclosed is a technology to change the parameters by which a read operation is performed in a block with a broken word line. The first method is for reading a broken word line, which may involve changing the voltage on word lines neighboring the broken word line to let the voltage on the broken word line reach the appropriate magnitude through capacitive coupling between word lines. The first method may also involve increasing the time delay before memory cells connected to the broken word line are sensed to allow the voltage on the word line to settle due to increased RC delay. The second method is for reading an unbroken word line in a block with a broken word line, which involves increasing the time delay before memory cells connected to the unbroken word line are sensed while raising the voltages on the word lines neighboring the broken word line. | 02-12-2015 |
20150063035 | MEMORY DEVICE BIASING METHOD AND APPARATUS - Memory devices and methods are disclosed, such as those facilitating data line shielding by way of capacitive coupling with data lines coupled to a memory string source line. For example, alternating data lines are sensed while adjacent data lines are coupled to a common source line of the data lines being sensed. Data line shielding methods and apparatus disclosed can reduce effects of source line bounce occurring during a sense operation of a memory device. | 03-05-2015 |
20150085571 | UPDATING READ VOLTAGES - A data storage device includes a controller that is configured to determine a first read voltage for a first page of a non-volatile memory (e.g., a lower page of a Multi-Level Cell flash memory device). The controller is also configured to determine a second read voltage for a second page (e.g., an upper page) of the non-volatile memory by applying an offset value to the first read voltage. The controller is also configured to store data identifying the first read voltage and the second read voltage. | 03-26-2015 |
20150089324 | METHOD AND DEVICE FOR WRITE ABORT PROTECTION - A data storage device includes a non-volatile memory and a controller. A method includes receiving first data and second data from a host device. A first error-correcting code (ECC) codeword associated with the first data is written to a first word line of the non-volatile memory, and a second ECC codeword associated with the second data is written to a second word line of the non-volatile memory. The first ECC codeword includes a first bit and a second bit, and the second ECC codeword includes a third bit and a fourth bit. The method further includes writing parity information to a parity storage portion of the non-volatile memory that is distinct from the first word line and from the second word line. The parity information includes a parity bit that is based on the first bit, the second bit, the third bit, and the fourth bit. | 03-26-2015 |
20150089325 | METHOD AND DEVICE FOR WRITE ABORT PROTECTION - A data storage device includes a non-volatile memory that includes a three-dimensional (3D) memory. A method includes receiving first data and second data from a host device. A first error-correcting code (ECC) codeword associated with the first data is written to a first word line of the non-volatile memory, and a second ECC codeword associated with the second data is written to a second word line of the non-volatile memory. The first ECC codeword includes a first bit and a second bit, and the second ECC codeword includes a third bit and a fourth bit. The method further includes writing parity information to a parity storage portion of the non-volatile memory that is distinct from the first word line and from the second word line. The parity information includes a parity bit that is based on the first bit, the second bit, the third bit, and the fourth bit. | 03-26-2015 |
20150194218 | MEMORY CELL SENSING - This disclosure concerns memory cell sensing. One or more methods include determining a data state of a first memory cell coupled to a first data line, determining a data state of a third memory cell coupled to a third data line, transferring determined data of at least one of the first and the third memory cells to a data line control unit corresponding to a second data line to which a second memory cell is coupled, the second data line being adjacent to the first data line and the third data line, and determining a data state of the second memory cell based, at least partially, on the transferred determined data. | 07-09-2015 |
20150262695 | METHODS, DEVICES, AND SYSTEMS FOR DATA SENSING - The present disclosure includes methods and devices for data sensing. One such method includes performing a number of successive sense operations on a number of memory cells using a number of different sensing voltages, determining a quantity of the number memory cells that change states between consecutive sense operations of the number of successive sense operations, and determining, based at least partially on the determined quantity of the number of memory cells that change states between consecutive sense operations, whether to output hard data corresponding to one of the number of successive sense operations. | 09-17-2015 |
Patent application number | Description | Published |
20120269278 | DOWNLINK MULTIPLE INPUT MULTIPLE OUTPUT ENHANCEMENTS FOR SINGLE-CELL WITH REMOTE RADIO HEADS - A base station selects a subset of at least one geographically separated antennas for each of the plurality of user equipments. The base station forms at least layer of data stream including modulated symbols, precodes the data stream via multiplication with the NT-by-N precoding matrix where N is the number of said layers and NT is the number of transmit antenna elements and transmits the precoded layers of data stream to the user equipment via the selected geographically separated antennas. The base station signals the subset of the plurality of geographically separated antennas via higher layer Radio Resource Control or via a down link grant mechanism. The base station optionally does not signal the subset of the plurality of geographically separated antennas to the corresponding mobile user equipment. | 10-25-2012 |
20120275400 | PHYSICAL DOWNLINK CONTROL CHANNEL AND PHYSICAL HYBRID AUTOMATIC REPEAT REQUEST INDICATOR CHANNEL ENHANCEMENTS - A wireless transmission system included at least one user equipment and a base station. The base station is operable to form a downlink control information block, modulate the downlink control information, precode the modulated downlink control information, and transmit the precoded, modulated downlink control information on at least one demodulation reference signal antenna port to the at least one user equipment. The precoded, modulated downlink control information is mapped to a set of N1 physical resource block pairs in a subframe from an orthogonal frequency division multiplexing symbol T | 11-01-2012 |
20120287799 | CHANNEL FEEDBACK FOR COORDINATED MULTI-POINT TRANSMISSIONS - A method of Coordinated Multipoint (CoMP) communication between a base station has a plurality of points with at least one user equipment (UE). At least one UE receives at least one transmission from the base station having the plurality of points. This UE measures downlink channel state information for each of the plurality of points including a rank indicator (RI), a precoding matrix indicator (PMI) and a channel quality indicator (CQI). This UE transmits the downlink channel station information in an uplink feedback channel to the base station. | 11-15-2012 |
20130114528 | METHOD AND APPARATUS WITH ENHANCED CONTROL MESSAGES AND SEARCH SPACE - A method of mapping control information in a wireless communication system is disclosed (FIG. | 05-09-2013 |
20130215835 | ON TRANSPARENCY OF CoMP - This invention is a technique for coordinate multi-point wireless transmission between plural base stations and user equipment. At least one base station transmits via a Physical Downlink Shared CHannel (PDSCH). The user equipment does not know the identity of the plural base stations. This could include joint transmission by simultaneous data transmission from multiple base stations. This could include dynamic point selection by data transmission from one base station at a time and changing the transmitting point (TP) from one subframe to another subframe. This could include coordinated scheduling/beamforming (CS/CB) where data is transmitted to the user equipment from one base station at a time and the base stations communicate to coordinate user scheduling and beamforming. The transmission point (TP) could vary over Resource Block (RB) pairs within a subframe while never transmitting from more than one base station. The transmission point (TP) could change in a semi-static fashion. | 08-22-2013 |
20130272285 | INTERFERENCE MANAGEMENT AND NETWORK PERFORMANCE OPTIMIZATION IN DENSE WIFI NETWORKS - A method of managing Wi-Fi access points using a Wi-Fi network manager is disclosed. Measurement data is received from a plurality of Wi-Fi access points via a control interface. Optimized adjustments to one or more Wi-Fi parameters associated with one or more of the plurality of access points are searched based at least in part on a set of network optimization goals and the measurement data received from the plurality of access points. At least some of the optimized adjustments to the one or more Wi-Fi parameters are transmitted to the one or more of the plurality of access points using the control interface. | 10-17-2013 |
20130281089 | INTERFERENCE MANAGEMENT AND NETWORK PERFORMANCE OPTIMIZATION IN SMALL CELLS - A method of configuring small cell base stations in a cellular network is disclosed. A constraint on a performance-related metric associated with at least a portion of the cellular network is received. In some embodiments, the constraint on the performance-related metric comprises a constraint on a performance-related metric associated with one or more macrocells. Measurement data from one or more small cell base stations is received via a control interface. One or more optimized values of one or more parameters associated with one or more small cell base stations are searched. The searching is based at least in part on the received measurement data and subject to the constraint on the performance-related metric associated with the at least a portion of the cellular network. The one or more optimized values of the one or more parameters to the associated small cell base stations are transmitted. | 10-24-2013 |
20140036691 | GLOBAL AND LOCAL OPTIMIZATION OF WI-FI ACCESS POINTS - A method of managing Wi-Fi access points (APs) includes selecting between a global optimization and a local optimization of AP parameters based at least in part on one or more factors. The method includes causing a global optimization to be performed in the event that a global optimization is selected, the global optimization comprising: searching for adjustments to a first set of AP parameters that optimize an overall performance associated with a global region, the global region including a first set of APs. The method includes causing a local optimization to be performed in the event that a local optimization is selected, the local optimization comprising: searching for adjustments to a second set of AP parameters that optimize an overall performance associated with a localized region, the localized region including a second set of APs, wherein the second set of APs comprises a subset of the first set of APs. | 02-06-2014 |
20140036709 | HIDDEN NODES DETECTION - A method of detecting a hidden node is disclosed. Reports from a plurality of access points (APs) are received. The method includes determining that transmissions from a second AP are not detected by a first AP based on the received report from the first AP. The method includes determining that transmissions from a client associated with the first AP are detected by the second AP based on the received report from the second AP. The method further includes detecting that the second AP is a hidden node, wherein transmissions from the hidden node interfere with transmissions between the client and the first AP, and wherein the detection is based at least in part on the determination that transmissions from the second AP are not detected by the first AP and the determination that transmissions from the client associated with the first AP are detected by the second AP. | 02-06-2014 |
20140036816 | DYNAMIC CHANNEL SELECTION ALGORITHMS FOR INTERFERENCE MANAGEMENT IN WIFI NETWORKS - A method of dynamically adjusting Wi-Fi parameters of a plurality of access points (APs) is disclosed. Reports from the plurality of APs are received through an interface. A conflict graph is created by a processor. Creating the conflict graph includes creating a plurality of vertices of the conflict graph, each vertex corresponding to one of the plurality of APs. Creating the conflict graph further includes determining that there is a conflict between at least some of the pairs of APs based at least in part on the received reports. Creating the conflict graph includes connecting an edge between each of the at least some of the pairs of APs. The conflict graph is stored in a memory. | 02-06-2014 |
20140067806 | Retroactive Search of Objects Using K-D Tree - In one embodiment, a method includes at time t | 03-06-2014 |
20140067870 | Prospective Search of Objects Using K-D Forest - In one embodiment, an object is stored in a k-dimensional forest that has a plurality of k-dimensional trees and each k-dimensional tree has a different size. If the smallest k-dimensional tree in the k-dimensional forest is not full, then the object is stored as a specific node in the smallest k-dimensional tree. Otherwise, a first k-dimensional tree in the k-dimensional forest is located, which is the smallest k-dimensional tree in the k-dimensional forest that is capable of storing the first object, objects in one or more second k-dimensional trees from the k-dimensional forest that are smaller than the first k-dimensional tree, and objects currently in the first k-dimensional tree. The object is stored as a specific node in the first k-dimensional tree. In addition, the objects in the second k-dimensional trees are moved and stored as specific nodes in the first k-dimensional tree. | 03-06-2014 |
20150193503 | RETROACTIVE SEARCH OF OBJECTS USING K-D TREE - In one embodiment, a method includes receiving a set of one or more content objects to be blacklisted; retrieving a set of currently blacklisted content objects; and determining a delta set of content objects that includes the content objects in the set of content objects to be blacklisted that are not included in the set of currently blacklisted content objects. Each of the content objects of the delta set is represented as a vector that includes a number of first elements. The method also includes retrieving, for each content object of a third set of content objects, a representation of the content object as a vector that includes a number of second elements; and identifying each content object in the third set whose content substantially matches at least one content object of the delta set. | 07-09-2015 |
20150234876 | PROSPECTIVE SEARCH OF OBJECTS USING K-D FOREST - In one embodiment, a method includes receiving a content object; and determining whether a list configured to store information of a pre-determined number of stored content objects is full. Each content object is represented as a vector of elements. The method also includes identifying a corresponding node of a k-dimensional tree for each of the stored content objects and the received content object based on determining one or more median vectors from the vectors of the content objects. Each node of the k-dimensional tree is configured to store the vector of a particular one of the content objects. The method also includes moving information corresponding to the vector of one or more of the stored content objects and the received content object from the list to the corresponding node of the k-dimensional tree. | 08-20-2015 |
20150312778 | INTERFERENCE MANAGEMENT AND NETWORK PERFORMANCE OPTIMIZATION IN SMALL CELLS - A method of configuring small cell base stations in a cellular network is disclosed. A constraint on a performance-related metric associated with at least a portion of the cellular network is received. In some embodiments, the constraint on the performance-related metric comprises a constraint on a performance-related metric associated with one or more macrocells. Measurement data from one or more small cell base stations is received via a control interface. One or more optimized values of one or more parameters associated with one or more small cell base stations are searched. The searching is based at least in part on the received measurement data and subject to the constraint on the performance-related metric associated with the at least a portion of the cellular network. The one or more optimized values of the one or more parameters to the associated small cell base stations are transmitted. | 10-29-2015 |
20150327164 | GLOBAL AND LOCAL OPTIMIZATION OF WI-FI ACCESS POINTS - A method of managing Wi-Fi access points (APs) includes selecting between a global optimization and a local optimization of AP parameters based at least in part on one or more factors. The method includes causing a global optimization to be performed in the event that a global optimization is selected, the global optimization comprising: searching for adjustments to a first set of AP parameters that optimize an overall performance associated with a global region, the global region including a first set of APs. The method includes causing a local optimization to be performed in the event that a local optimization is selected, the local optimization comprising: searching for adjustments to a second set of AP parameters that optimize an overall performance associated with a localized region, the localized region including a second set of APs, wherein the second set of APs comprises a subset of the first set of APs. | 11-12-2015 |
20150341797 | DYNAMIC CHANNEL SELECTION ALGORITHMS FOR INTERFERENCE MANAGEMENT IN WIFI NETWORKS - A method of dynamically adjusting Wi-Fi parameters of a plurality of access points (APs) is disclosed. Reports from the plurality of APs are received through an interface. A conflict graph is created by a processor. Creating the conflict graph includes creating a plurality of vertices of the conflict graph, each vertex corresponding to one of the plurality of APs. Creating the conflict graph further includes determining that there is a conflict between at least some of the pairs of APs based at least in part on the received reports. Creating the conflict graph includes connecting an edge between each of the at least some of the pairs of APs. The conflict graph is stored in a memory. | 11-26-2015 |